04-09-2008
that is very helpful/cool!
thanks for posting it!
10 More Discussions You Might Find Interesting
1. Programming
How can I make a process tree?
The tree must have X rows and each process must have Y sons.
All the processes must comunicate with their fathers.
Can anyone help me with that? (1 Reply)
Discussion started by: bb666
1 Replies
2. Shell Programming and Scripting
#!/usr/bin/ksh
#
# COPYRIGHT (c) 2003 - SIMERIAN
#
# e: info@simerian.com
# w: www.simerian.com
#
# DISCLAIMER
# The author of this product does not accept any responsibility for
# loss or damages resulting from the use of said product and makes no
# warranty or representation, either... (3 Replies)
Discussion started by: Simerian
3 Replies
3. Programming
hi i have modified a program to display directory entries recursively in a tree like form
i need an output with the following guidelines:
the prog displays the contents of the directory
the directory contents are sorted before printing so that directories come before regular files
if an entry... (2 Replies)
Discussion started by: anything2
2 Replies
4. UNIX for Dummies Questions & Answers
In DOS, to get the complete directory structure, we use 'TREE' command..
can anyone tell me what is the equivalent command in Unix
I am using
SunOS ABC 5.8 Generic_117350-18 sun4u sparc SUNW,Sun-Fire-V240
thanks.. (1 Reply)
Discussion started by: wip_vasikaran
1 Replies
5. Shell Programming and Scripting
Hi all,
The following is a script for displaying directory tree.
D=${1:-`pwd`}
(cd $D; pwd)
find $D -type d -print | sort |
sed -e "s,^$D,,"\
-e "/^$/d"\
-e "s,*/\(*\)$,\:-----\1,"\
-e "s,*/,: ,g" | more
exit 0
I am trying to understand the above script.But... (3 Replies)
Discussion started by: ravi raj kumar
3 Replies
6. UNIX for Dummies Questions & Answers
Hi,
I want to list all the last directories from mentioned base path.
for eg: If i have a base path say /base/base1/
How can i get the path till last node in tree like directory structure of unix by applying any command.
so that i will get following output.
... (7 Replies)
Discussion started by: Shiv@jad
7 Replies
7. Shell Programming and Scripting
how to draw a process tree if i know my process id
and how can i identify session leaders (1 Reply)
Discussion started by: annapurna konga
1 Replies
8. UNIX for Dummies Questions & Answers
a buddy and i are trying to re-learn basic commands. i havent used linux for awhile. so i need help on this. what are the commands to create a tree like this.
.
|-- a1.A
|-- a1.B
|-- opt
| |-- documents
| | `-- tmp
| | |-- backup
| | `-- etc
| |-- music
| `--... (1 Reply)
Discussion started by: ink
1 Replies
9. UNIX for Dummies Questions & Answers
How can i install tree command in ubundu without root ? I have found some shell script which does the same job as tree but i would like to get all the options in tree command
thanks (2 Replies)
Discussion started by: gvj
2 Replies
10. Programming
I have just been researching this topic and I was wondering what type of application might a binary tree be used for. For instance what type of application would be a good showcase for a binary tree that I could write as an example? (5 Replies)
Discussion started by: sepoto
5 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)