libtree-simple-visitorfactory-perl 0.16-2 source package in Ubuntu
Changelog
libtree-simple-visitorfactory-perl (0.16-2) unstable; urgency=medium [ Debian Janitor ] * Remove constraints unnecessary since buster -- Jelmer Vernooij <email address hidden> Sun, 16 Oct 2022 06:10:09 +0100
Upload details
- Uploaded by:
- Debian Perl Group
- Uploaded to:
- Sid
- Original maintainer:
- Debian Perl Group
- Architectures:
- all
- Section:
- perl
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section |
---|
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
libtree-simple-visitorfactory-perl_0.16-2.dsc | 2.4 KiB | d105e782a2bd00d414988eccdc58c1c5801645afafdc9a26e0b109b20041ac0e |
libtree-simple-visitorfactory-perl_0.16.orig.tar.gz | 40.3 KiB | 9cf538faa12c54ffb4a91439945e488f1856f62b89ac5072a922119e01880da6 |
libtree-simple-visitorfactory-perl_0.16-2.debian.tar.xz | 3.5 KiB | b97854ff2c5b757e75d0524c935e02d1496c389898f9d9b5ee2b61f35a23dee9 |
Available diffs
- diff from 0.16-1 to 0.16-2 (519 bytes)
No changes file available.
Binary packages built by this source
- libtree-simple-visitorfactory-perl: collection of dispensing visitor objects for Tree::Simple
The Tree::Simple:
:VisitorFactory module contains a number of visitor objects
which can perform various tasks on Tree::Simple objects.
.
The following visitors are included:
* PathToRoot: find the path back to the tree's root node
* FindByPath: find the node specified by a path
* FindByUID: find the node with the same UID
* FindByNodeValue: find the node with the same node value
* BreadthFirstTraversal: implements a breadth-first traversal
* PostOrderTraversal: implements a post-order traversal
* PreOrderTraversal: implements a pre-order traversal
* LoadDirectoryTree: load a directory tree into a Tree::Simple hierarchy
* CreateDirectoryTree: create a set of directories and files from a
Tree::Simple hierarchy
* FromNestedArray: create a Tree::Simple hierarchy from nested arrays
* ToNestedArray: create a nested array construct from a Tree::Simple hierarchy
* Tree::Simple::Visitor: :VariableDepthC lone: clone parts of Tree hierarchies
* FromNestedHash: create a Tree::Simple hierarchy from nested hashes
* ToNestedHash: create a nested hash construct from a Tree::Simple hierarchy
* LoadClassHierarchy: create a Tree::Simple hierarchy which models the classes
inheritance hierarchy
* GetAllDescendents: return all the descendents recursively on down the
hierarchy
* Sort: implements a multi-level sort of a Tree::Simple hierarchy