thanks to both kennethk and ikegami.
the first code from kennethk does indeed work. so i guess i don't understand what routines that return an array really do......
given this snippet :
foreach my $node ( @{ $self->{_children} } ) { push @list, $node->traverse(); } return @list;
is the following a correct description ?
foreach node in the children ARRAY recursively call this routine if the node has children recursively call this routine if the node has NO children the returned list is just that node each time the routine returns it's array is pushed onto the array of the callee when the routine reaches the end of the top children ARRAY the visited nodes haved all been pushed into the top list
for some reason, i had the impression that if you push an ARRAY into an ARRAY, the ARRAYS are preserved (not merged).
thanks for your patience and support
In reply to Re^3: map & arrays & recursion
by Anonymous Monk
in thread map & arrays & recursion
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |