03-01-2012
Not true for the data I had.
Please post your actual input string and input file. It may be taking some of them to be special characters.
10 More Discussions You Might Find Interesting
1. Shell Programming and Scripting
please give me proper solution for finding a shortest substring from given string if string itself and first char and last char of that substr are also given by user
if S="dpoaoqooroo" and FC="o" and LC="o",then shortest substr is "oo" and rest of the string is "dpoaoqroo"
i have code but it is... (1 Reply)
Discussion started by: pankajd
1 Replies
2. Shell Programming and Scripting
I got a file called Album in that there is list of songs i want to find the Longest and shortest song name in field 2 ie ($2)....
Please help me with "awk" (2 Replies)
Discussion started by: Markwaugh
2 Replies
3. Shell Programming and Scripting
Hello
I have a abc.txt file which semicolon delimited. I need to read the first line of the abc.txt file where i need to extract specific string which at specific location.
i.e first line of the abc.txt file is as below
abc;123;xyz;345;678
my requirement is i need to get the 678. I was... (7 Replies)
Discussion started by: dsdev_123
7 Replies
4. Programming
Hello. I have a large file that contains a lot of gibberish and also a lot of http addresses. How can i read the file, take out the http addresses, and write each one of them on one line each into another file?
It looks something like this.
... (1 Reply)
Discussion started by: cbreiny
1 Replies
5. Shell Programming and Scripting
Hello. I have a large file that contains a lot of gibberish and also a lot of http addresses. How can i read the file, take out the http addresses, and write each one of them on one line each into another file?
It looks something like this.
... (7 Replies)
Discussion started by: cbreiny
7 Replies
6. Shell Programming and Scripting
Hello,
I have a 100 line code. I have given a sample of it below:
ABC*654654*1*54.54*21.2*87*1*654654654654
CCC*FS*FS*SFD*DSF
GGG*FGH*CGB*FBDFG*FGDG
ABC*654654*1*57.84*45.4*88*2*6546546545
CCC*WSF*SG*FGH*GHJ
ADA*AF*SFG*DFGH*FGH*FGTH
I need to select the line starting with "ABC" its... (6 Replies)
Discussion started by: nithins007
6 Replies
7. Emergency UNIX and Linux Support
Hello,
I have a 100 line code. I have given a sample of it below:
ABC*654654*1*54.54*21.2*87*1*654654654654
CCC*FS*FS*SFD*DSF
GGG*FGH*CGB*FBDFG*FGDG
ABC*654654*1*57.84*45.4*88*2*6546546545
CCC*WSF*SG*FGH*GHJ
ADA*AF*SFG*DFGH*FGH*FGTH
I need to select the line starting with "ABC" its... (3 Replies)
Discussion started by: nithins007
3 Replies
8. UNIX for Advanced & Expert Users
Hi ,
i have a file with data as below.This is same file. But actual file contains to many rows.
i want to search for a string "Field 039 00" and delete that line and previous 3 lines in that file.. Can some body suggested me how can i do using either sed or awk command ?
Field 004... (7 Replies)
Discussion started by: vadlamudy
7 Replies
9. Homework & Coursework Questions
Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted!
1. The problem statement, all variables and given/known data:
I have to write a program that have to read every standard input then print out the line number and the content of... (10 Replies)
Discussion started by: scopiop
10 Replies
10. Shell Programming and Scripting
Hello guys, would you please help me with this?
this is the line inside a file:
first line Something Today YYDDPPSVXIPYYY0XXXOFFS00000000000?
I'd like to find the position of string XXX from string PYYY
In the example above
XXX starts from 6th position from PYYY
desired... (4 Replies)
Discussion started by: netrom
4 Replies
LEARN ABOUT DEBIAN
tree::redblack
RedBlack(3pm) User Contributed Perl Documentation RedBlack(3pm)
NAME
Tree::RedBlack - Perl implementation of Red/Black tree, a type of balanced tree.
SYNOPSIS
use Tree::RedBlack;
my $t = new Tree::RedBlack;
$t->insert(3, 'cat');
$t->insert(4, 'dog');
my $v = $t->find(4);
my $min = $t->min;
my $max = $t->max;
$t->delete(3);
$t->print;
DESCRIPTION
This is a perl implementation of the Red/Black tree algorithm found in the book "Algorithms", by Cormen, Leiserson & Rivest (more commonly
known as "CLR" or "The White Book"). A Red/Black tree is a binary tree which remains "balanced"- that is, the longest length from root to
a node is at most one more than the shortest such length. It is fairly efficient; no operation takes more than O(lg(n)) time.
A Tree::RedBlack object supports the following methods:
new ()
Creates a new RedBlack tree object.
root ()
Returns the root node of the tree. Note that this will either be undef if no nodes have been added to the tree, or a
Tree::RedBlack::Node object. See the Tree::RedBlack::Node manual page for details on the Node object.
cmp (&)
Use this method to set a comparator subroutine. The tree defaults to lexical comparisons. This subroutine should be just like a
comparator subroutine to sort, except that it doesn't do the $a, $b trick; the two elements to compare will just be the first two items
on the stack.
insert ($;$)
Adds a new node to the tree. The first argument is the key of the node, the second is its value. If a node with that key already
exists, its value is replaced with the given value and the old value is returned. Otherwise, undef is returned.
delete ($)
The argument should be either a node object to delete or the key of a node object to delete. WARNING!!! THIS STILL HAS BUGS!!!
find ($)
Searches the tree to find the node with the given key. Returns the value of that node, or undef if a node with that key isn't found.
Note, in particular, that you can't tell the difference between finding a node with value undef and not finding a node at all. If you
want to determine if a node with a given key exists, use the node method, below.
node ($)
Searches the tree to find the node with the given key. Returns that node object if it is found, undef otherwise. The node object is a
Tree::RedBlack::Node object.
min ()
Returns the node with the minimal key.
max ()
Returns the node with the maximal key.
AUTHOR
Benjamin Holzman <bholzman@earthlink.net>
SEE ALSO
Tree::RedBlack::Node
perl v5.10.0 2008-07-31 RedBlack(3pm)