• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /macosx-10.9.5/CPANInternal-140/Tree-Simple-VisitorFactory-0.10/lib/Tree/Simple/Visitor/

Lines Matching +refs:Tree +refs:find

2 package Tree::Simple::Visitor::FindByPath;
11 use base qw(Tree::Simple::Visitor);
37 (blessed($tree) && $tree->isa("Tree::Simple"))
38 || die "Insufficient Arguments : You must supply a valid Tree::Simple object";
96 # if we find a match, then
107 # if we do not find a match, then we can fall off
136 Tree::Simple::Visitor::FindByPath - A Visitor for finding an element in a Tree::Simple hierarchy with a path
140 use Tree::Simple::Visitor::FindByPath;
143 my $visitor = Tree::Simple::Visitor::FindByPath->new();
152 # be the Tree::Simple object that
154 my $result = $visitor->getResult() || die "No Tree found";
162 Given a path and Tree::Simple hierarchy, this Visitor will attempt to find the node specified by the path.
182 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.
186 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.
194 This method will return the tree's that make up the path specified in C<setSearchPath>. In the case of a failed search, this can be used to find the elements which did successfully match along the way.
200 None that I am aware of. Of course, if you find a bug, let me know, and I will be sure to fix it.
204 See the B<CODE COVERAGE> section in L<Tree::Simple::VisitorFactory> for more inforamtion.
208 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.