|
NAMETree::Simple::Visitor::ToNestedHash - A Visitor for creating nested hash trees from Tree::Simple objects.SYNOPSISuse Tree::Simple::Visitor::ToNestedHash; my $visitor = Tree::Simple::Visitor::ToNestedHash->new(); # given this Tree::Simple tree my $tree = Tree::Simple->new("Root") ->addChildren( Tree::Simple->new("Child1") ->addChildren( Tree::Simple->new("GrandChild1"), Tree::Simple->new("GrandChild2") ), Tree::Simple->new("Child2"), ); $tree->accept($visitor); my $array_tree = $visitor->getResults(); # this then creates the equivalent nested array tree: # { # Root => { # Child1 => { # GrandChild1 => {}, # GrandChild2 => {} # }, # Child2 => {} # } # } DESCRIPTIONGiven a tree constructed from a Tree::Simple hierarchy, this Visitor will create the equivalent tree of nested hashes.METHODS
Repository<https://github.com/ronsavage/Tree-Simple-VisitorFactory>SUPPORTBugs should be reported via the CPAN bug tracker at<https://github.com/ronsavage/Tree-Simple-VisitorFactory/issues> CODE COVERAGESee the CODE COVERAGE section in Tree::Simple::VisitorFactory for more information.SEE ALSOThese Visitor classes are all subclasses of Tree::Simple::Visitor, which can be found in the Tree::Simple module, you should refer to that module for more information.AUTHORstevan little, <stevan@iinteractive.com>COPYRIGHT AND LICENSECopyright 2004, 2005 by Infinity Interactive, Inc.<http://www.iinteractive.com> This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself.
Visit the GSP FreeBSD Man Page Interface. |