Data::Hierarchy::Traverser for Linux 0.01

Data::Hierarchy::Traverser is a Perl module to export one recursive function hierarchy_traverse, which traverses a hierarchy structure in the depth-first fashion.<br /><br />Caution: As it is a recursive function, pay attention of the usage of gobal variables such as $_, < FH >.<br /><br />SYNOPSIS<br /><br /> use Data::Hierarchy::Traverser;<br /> <br /> hierarchy_traverse (<br /> $roots, # a scalar for one root,<br /> # or a ref to a list of roots,<br /> # or a ref to a list of the wrappers of root.<br /> <br /> &get_children, # a function for getting child nodes<br /> { # Options:<br /> depth => 1, # how depth limitaion. (default undef, no limitation)<br /> pre_branch => $per_banch_function, # the function called before visit childeren nodes<br /> post_branch => $per_banch_function, # the fucntion called after visite all it children nodes<br /> bare_branch => $per_banch_function, # the function for empty branches<br /> leaf => $leaf_function, # the function for leaf nodes<br /> is_leaf => $is_leaf_function, # the function for check if a node is leaf<br /> # all default functions are default to be {}<br /> # (do nothing and return false.<br /> # (?Should it just skip the call to an empty funcion?)<br /> } ,<br /> );

Requirements:	No special requirements
Platforms:	*nix, Linux
Keyword:	Banch Function,  Called,  Childeren,  Data,  Data Hi,  Datahierarchytraverser,  Default,  Depth,  Empty,  False,  Fshould,  Fucntion,  Funcion,  Function,  Hierarchy,  Hierarchy Traverse,  Hierarchy Traverser,  Linux,  Nodes,  Post Branch,  Recursive,  Roots,  Traverser,  Visit
Users rating:	0/10