Lines Matching +refs:Tree +refs:find
2 package Tree::Simple::Visitor::ToNestedHash;
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";
60 Tree::Simple::Visitor::ToNestedHash - A Visitor for creating nested hash trees from Tree::Simple objects.
64 use Tree::Simple::Visitor::ToNestedHash;
66 my $visitor = Tree::Simple::Visitor::ToNestedHash->new();
68 # given this Tree::Simple tree
69 my $tree = Tree::Simple->new("Root")
71 Tree::Simple->new("Child1")
73 Tree::Simple->new("GrandChild1"),
74 Tree::Simple->new("GrandChild2")
76 Tree::Simple->new("Child2"),
96 Given a tree constructed from a Tree::Simple heirarchy, this Visitor will create the equivalent tree of nested hashes.
112 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 placed into the hash tree. The C<$filter_function> is passed a Tree::Simple object, and is expected to return the value desired for inclusion into the hash tree.
116 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.
126 None that I am aware of. Of course, if you find a bug, let me know, and I will be sure to fix it.
130 See the B<CODE COVERAGE> section in L<Tree::Simple::VisitorFactory> for more inforamtion.
134 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.