Lines Matching +refs:Tree +refs:find
2 package Tree::Simple::Visitor::PostOrderTraversal;
11 use base qw(Tree::Simple::Visitor);
24 (blessed($tree) && $tree->isa("Tree::Simple"))
25 || die "Insufficient Arguments : You must supply a valid Tree::Simple object";
64 Tree::Simple::Visitor::PostOrderTraversal - A Visitor for post-order traversal a Tree::Simple hierarchy
68 use Tree::Simple::Visitor::PostOrderTraversal;
71 my $visitor = Tree::Simple::Visitor::PostOrderTraversal->new();
93 Post-order traversal is a variation of the depth-first traversal in which the sub-tree's are processed I<before> the parent. It is another alternative to Tree::Simple's C<traverse> method which implements a depth-first, pre-order traversal.
109 This method accepts a CODE reference as its C<$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.
113 This is the method that is used by Tree::Simple's C<accept> method. It can also be used on its own, it requires the C<$tree> argument to be a Tree::Simple object (or derived from a Tree::Simple object), and will throw and exception otherwise.
123 None that I am aware of. Of course, if you find a bug, let me know, and I will be sure to fix it.
127 See the B<CODE COVERAGE> section in L<Tree::Simple::VisitorFactory> for more inforamtion.
131 These Visitor classes are all subclasses of B<Tree::Simple::Visitor>, which can be found in the B<Tree::Simple> module, you should refer to that module for more information.