1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
|
Source: libtree-simple-visitorfactory-perl
Maintainer: Debian Perl Group <pkg-perl-maintainers@lists.alioth.debian.org>
Uploaders: Ansgar Burchardt <ansgar@debian.org>,
gregor herrmann <gregoa@debian.org>
Section: perl
Testsuite: autopkgtest-pkg-perl
Priority: optional
Build-Depends: debhelper (>= 9)
Build-Depends-Indep: perl,
libtree-simple-perl (>= 1.22),
libtest-exception-perl,
perl (>= 5.21.10) | libtest-simple-perl (>= 1.001014)
Standards-Version: 3.9.8
Vcs-Browser: https://anonscm.debian.org/cgit/pkg-perl/packages/libtree-simple-visitorfactory-perl.git
Vcs-Git: https://anonscm.debian.org/git/pkg-perl/packages/libtree-simple-visitorfactory-perl.git
Homepage: https://metacpan.org/release/Tree-Simple-VisitorFactory
Package: libtree-simple-visitorfactory-perl
Architecture: all
Depends: ${misc:Depends},
${perl:Depends},
libtree-simple-perl (>= 1.22)
Description: 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::VariableDepthClone: 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
|
