Lines Matching +refs:Tree +refs:find
2 package Tree::Simple::Visitor::BreadthFirstTraversal;
11 use base qw(Tree::Simple::Visitor);
29 (blessed($tree) && $tree->isa("Tree::Simple"))
30 || die "Insufficient Arguments : You must supply a valid Tree::Simple object";
71 Tree::Simple::Visitor::BreadthFirstTraversal - A Visitor for breadth-first traversal a Tree::Simple hierarchy
75 use Tree::Simple::Visitor::BreadthFirstTraversal;
78 my $visitor = Tree::Simple::Visitor::BreadthFirstTraversal->new();
100 This implements a breadth-first traversal of a Tree::Simple hierarchy. This can be an alternative to the built in depth-first traversal of the Tree::Simple C<traverse> method.
116 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.
120 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.
130 None that I am aware of. Of course, if you find a bug, let me know, and I will be sure to fix it.
134 See the B<CODE COVERAGE> section in L<Tree::Simple::VisitorFactory> for more inforamtion.
138 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.