|
NAMETree::Simple::Visitor::PostOrderTraversal - A Visitor for post-order traversal a Tree::Simple hierarchySYNOPSISuse Tree::Simple::Visitor::PostOrderTraversal; # create an visitor my $visitor = Tree::Simple::Visitor::PostOrderTraversal->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.2 1 2.1 2 3.1 3 # assuming your tree is like this: # 1 # 1.1 # 1.1.1 # 1.2 # 2 # 2.1 # 3 # 3.1 DESCRIPTIONPost-order traversal is a variation of the depth-first traversal in which the sub-tree's are processed before the parent. It is another alternative to Tree::Simple's "traverse" method which implements a depth-first, pre-order traversal.METHODS
Repository<https://github.com/ronsavage/Tree-Simple-VisitorFactory>SUPPORTBugs should be reported via the CPAN bug tracker at<https://github.com/ronsavage/Tree-Simple-VisitorFactory/issues> CODE COVERAGESee the CODE COVERAGE section in Tree::Simple::VisitorFactory for more information.SEE ALSOThese 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.AUTHORstevan little, <stevan@iinteractive.com>COPYRIGHT AND LICENSECopyright 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.
Visit the GSP FreeBSD Man Page Interface. |