Tree::Simple::Visitor::FromNestedArray(3pm) | User Contributed Perl Documentation | Tree::Simple::Visitor::FromNestedArray(3pm) |
Tree::Simple::Visitor::FromNestedArray - A Visitor for creating Tree::Simple objects from nested array trees.
use Tree::Simple::Visitor::FromNestedArray; my $visitor = Tree::Simple::Visitor::FromNestedArray->new(); # given this nested array tree my $array_tree = [ 'Root', [ 'Child1', [ 'GrandChild1', 'GrandChild2' ], 'Child2' ] ]; # set the array tree we # are going to convert $visitor->setArrayTree($array_tree); $tree->accept($visitor); # this then creates the equivalent Tree::Simple object: # Tree::Simple->new("Root") # ->addChildren( # Tree::Simple->new("Child1") # ->addChildren( # Tree::Simple->new("GrandChild1"), # Tree::Simple->new("GrandChild2") # ), # Tree::Simple->new("Child2"), # );
Given a tree constructed from nested arrays, this Visitor will create the equivalent Tree::Simple hierarchy.
[ 'Root', [ 'Child1', [ 'GrandChild1', 'GrandChild2' ], 'Child2' ] ]
Basically each element in the array is considered a node, unless it is an array reference, in which case it is interpreted as containing the children of the node created from the previous element in the array.
The tree is validated prior being accepted, if it fails validation an exception will be thrown. The rules are as follows;
None that I am aware of. Of course, if you find a bug, let me know, and I will be sure to fix it.
See the CODE COVERAGE section in Tree::Simple::VisitorFactory for more information.
These 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.
stevan little, <stevan@iinteractive.com>
Copyright 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.
2021-02-20 | perl v5.32.1 |