Hi, I know that inode for each file is unique, but is it the for the directory? So far I found different directories has the same inode nubmer when you do ls -i, could some one explain why? Thanks a lot. (9 Replies)
I need to find to find duplicate lines in a document and then print the line numbers of the duplicates
The files contain multiple lines with about 100 numbers on each line I need something that will output the line numbers where duplicates were found ie 1=5=7, 2=34=76
Any suggestions would be... (5 Replies)
Hello,
In korn-shell, how can I do to have an unique number for a date done.
I want to use it to have the number of days between two dates.
Thanks in advance. (4 Replies)
I'd like to be able to identify in which column a string occurs. So far I know that I can tell how many columns there are and how to return a specific column:
$ sar -r | grep 'kbswpcad' | awk 'NF = 9 { print $NF }'
%swpused
I've even managed to get the columns to output to an array but I... (2 Replies)
Hi,
how i can display all the unique number from my random number script below;
#!/usr/bin/perl
use strict;
my @alphanum = ( 'A' .. 'Z', 'a' .. 'z', 0 .. 9);
my $random = join('', map($alphanum,(1..5)));
print "$random\n";
Thank You. (1 Reply)
Wrote a script to create a hidden account in OS X. It works perfect but I need to check if the UID is already in use before I tried to create the account.
dscl . list /Users UniqueID | awk '{print $2}' | while read UIDS
do
if ; then
echo "UID Is Already in USE"
i=`expr "$2" - 1`
echo... (4 Replies)
input
a 1
a 2
a -1
b 1
b 2
b 3
output
a -1
b 1
Thanx
---------- Post updated at 09:42 PM ---------- Previous update was at 09:10 PM ----------
Ok I managed it (7 Replies)
In Bash using AWK or sed I need to convert the following file:
...
numitem_tab0 =<p>1 KEYWORD</p><p>2 KEYWORD</p><p>3 KEYWORD</p><p>4 KEYWORD</p><p>5 KEYWORD</p>...<p>25 KEYWORD</p>
subitem_tab0 =<p></p><p></p>
...
numitem_tab6 =<p>1 KEYWORD</p><p>2 KEYWORD</p><p>3 KEYWORD</p><p>4 KEYWORD</p>... (2 Replies)
Hello,
I have a database of name variants with the following structure:
variant=variant=variant
The number of variants can be as many as thirty to forty.
Since the database is quite large (at present around 60,000 lines) duplicate sets of variants creep in. Thus
John=Johann=Jon
and... (2 Replies)
Discussion started by: gimley
2 Replies
LEARN ABOUT DEBIAN
tree::simple::visitor::preordertraversal
Tree::Simple::Visitor::PreOrderTraversal(3pm) User Contributed Perl Documentation Tree::Simple::Visitor::PreOrderTraversal(3pm)NAME
Tree::Simple::Visitor::PreOrderTraversal - A Visitor for pre-order traversal a Tree::Simple hierarchy
SYNOPSIS
use Tree::Simple::Visitor::PreOrderTraversal;
# create an visitor
my $visitor = Tree::Simple::Visitor::PreOrderTraversal->new();
# pass our visitor to the tree
$tree->accept($visitor);
# print our results
print join ", " => $visitor->getResults();
# this will print this:
# 1 1.1 1.1.1 1.2 2 2.1 3 3.1
# assuming your tree is like this:
# 1
# 1.1
# 1.1.1
# 1.2
# 2
# 2.1
# 3
# 3.1
DESCRIPTION
Pre-order traversal is a depth-first traversal method in which the sub-tree's are processed after the parent. It is essentially a wrapper
around the base Tree::Simple::Visitor class, and is a separate module here for completeness. (If you have a post-order, you should have a
pre-order too).
METHODS
new There are no arguments to the constructor the object will be in its default state. You can use the "setNodeFilter" method to customize
its behavior.
includeTrunk ($boolean)
Based upon the value of $boolean, this will tell the visitor to include the trunk of the tree in the traversal as well.
setNodeFilter ($filter_function)
This method accepts a CODE reference as its $filter_function argument and throws an exception if it is not a code reference. This code
reference is used to filter the tree nodes as they are collected. This can be used to customize output, or to gather specific
information from a more complex tree node. The filter function should accept a single argument, which is the current Tree::Simple
object.
visit ($tree)
This is the method that is used by Tree::Simple's "accept" method. It can also be used on its own, it requires the $tree argument to be
a Tree::Simple object (or derived from a Tree::Simple object), and will throw and exception otherwise.
getResults
This method returns the accumulated results of the application of the node filter to the tree.
BUGS
None that I am aware of. Of course, if you find a bug, let me know, and I will be sure to fix it.
CODE COVERAGE
See the CODE COVERAGE section in Tree::Simple::VisitorFactory for more inforamtion.
SEE ALSO
These Visitor classes are all subclasses of Tree::Simple::Visitor, which can be found in the Tree::Simple module, you should refer to that
module for more information.
AUTHOR
stevan little, <stevan@iinteractive.com>
COPYRIGHT AND LICENSE
Copyright 2004, 2005 by Infinity Interactive, Inc.
<http://www.iinteractive.com>
This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.
perl v5.10.1 2010-02-18 Tree::Simple::Visitor::PreOrderTraversal(3pm)