Lines Matching defs:Tree
2 package Tree::Simple::Visitor::PreOrderTraversal;
9 use base qw(Tree::Simple::Visitor);
26 Tree::Simple::Visitor::PreOrderTraversal - A Visitor for pre-order traversal a Tree::Simple hierarchy
30 use Tree::Simple::Visitor::PreOrderTraversal;
33 my $visitor = Tree::Simple::Visitor::PreOrderTraversal->new();
55 Pre-order traversal is a depth-first traversal method in which the sub-tree's are processed I<after> the parent. It is essentially a wrapper around the base Tree::Simple::Visitor class, and is a seperate module here for completeness. (If you have a post-order, you should have a pre-order too).
71 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.
75 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.
89 See the B<CODE COVERAGE> section in L<Tree::Simple::VisitorFactory> for more inforamtion.
93 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.