--- /dev/null
+.\" Automatically generated by Pod::Man v1.37, Pod::Parser v1.3
+.\"
+.\" Standard preamble:
+.\" ========================================================================
+.de Sh \" Subsection heading
+.br
+.if t .Sp
+.ne 5
+.PP
+\fB\\$1\fR
+.PP
+..
+.de Sp \" Vertical space (when we can't use .PP)
+.if t .sp .5v
+.if n .sp
+..
+.de Vb \" Begin verbatim text
+.ft CW
+.nf
+.ne \\$1
+..
+.de Ve \" End verbatim text
+.ft R
+.fi
+..
+.\" Set up some character translations and predefined strings. \*(-- will
+.\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
+.\" double quote, and \*(R" will give a right double quote. | will give a
+.\" real vertical bar. \*(C+ will give a nicer C++. Capital omega is used to
+.\" do unbreakable dashes and therefore won't be available. \*(C` and \*(C'
+.\" expand to `' in nroff, nothing in troff, for use with C<>.
+.tr \(*W-|\(bv\*(Tr
+.ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
+.ie n \{\
+. ds -- \(*W-
+. ds PI pi
+. if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
+. if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch
+. ds L" ""
+. ds R" ""
+. ds C` ""
+. ds C' ""
+'br\}
+.el\{\
+. ds -- \|\(em\|
+. ds PI \(*p
+. ds L" ``
+. ds R" ''
+'br\}
+.\"
+.\" If the F register is turned on, we'll generate index entries on stderr for
+.\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
+.\" entries marked with X<> in POD. Of course, you'll have to process the
+.\" output yourself in some meaningful fashion.
+.if \nF \{\
+. de IX
+. tm Index:\\$1\t\\n%\t"\\$2"
+..
+. nr % 0
+. rr F
+.\}
+.\"
+.\" For nroff, turn off justification. Always turn off hyphenation; it makes
+.\" way too many mistakes in technical documents.
+.hy 0
+.if n .na
+.\"
+.\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
+.\" Fear. Run. Save yourself. No user-serviceable parts.
+. \" fudge factors for nroff and troff
+.if n \{\
+. ds #H 0
+. ds #V .8m
+. ds #F .3m
+. ds #[ \f1
+. ds #] \fP
+.\}
+.if t \{\
+. ds #H ((1u-(\\\\n(.fu%2u))*.13m)
+. ds #V .6m
+. ds #F 0
+. ds #[ \&
+. ds #] \&
+.\}
+. \" simple accents for nroff and troff
+.if n \{\
+. ds ' \&
+. ds ` \&
+. ds ^ \&
+. ds , \&
+. ds ~ ~
+. ds /
+.\}
+.if t \{\
+. ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u"
+. ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u'
+. ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u'
+. ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u'
+. ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u'
+. ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u'
+.\}
+. \" troff and (daisy-wheel) nroff accents
+.ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V'
+.ds 8 \h'\*(#H'\(*b\h'-\*(#H'
+.ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#]
+.ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H'
+.ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u'
+.ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#]
+.ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#]
+.ds ae a\h'-(\w'a'u*4/10)'e
+.ds Ae A\h'-(\w'A'u*4/10)'E
+. \" corrections for vroff
+.if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u'
+.if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u'
+. \" for low resolution devices (crt and lpr)
+.if \n(.H>23 .if \n(.V>19 \
+\{\
+. ds : e
+. ds 8 ss
+. ds o a
+. ds d- d\h'-1'\(ga
+. ds D- D\h'-1'\(hy
+. ds th \o'bp'
+. ds Th \o'LP'
+. ds ae ae
+. ds Ae AE
+.\}
+.rm #[ #] #H #V #F C
+.\" ========================================================================
+.\"
+.IX Title "Tree::Simple::Visitor::FromNestedHash 3"
+.TH Tree::Simple::Visitor::FromNestedHash 3 "2005-07-14" "perl v5.8.7" "User Contributed Perl Documentation"
+.SH "NAME"
+Tree::Simple::Visitor::FromNestedHash \- A Visitor for creating Tree::Simple objects from nested hash trees.
+.SH "SYNOPSIS"
+.IX Header "SYNOPSIS"
+.Vb 1
+\& use Tree::Simple::Visitor::FromNestedHash;
+.Ve
+.PP
+.Vb 1
+\& my $visitor = Tree::Simple::Visitor::FromNestedHash\->new();
+.Ve
+.PP
+.Vb 10
+\& # given this nested hash tree
+\& my $hash_tree = {
+\& Root => {
+\& Child1 => {
+\& GrandChild1 => {},
+\& GrandChild2 => {}
+\& },
+\& Child2 => {}
+\& }
+\& };
+.Ve
+.PP
+.Vb 3
+\& # set the array tree we
+\& # are going to convert
+\& $visitor\->setHashTree($hash_tree);
+.Ve
+.PP
+.Vb 1
+\& $tree\->accept($visitor);
+.Ve
+.PP
+.Vb 10
+\& # 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"),
+\& # );
+.Ve
+.SH "DESCRIPTION"
+.IX Header "DESCRIPTION"
+Given a tree constructed from nested hashs, this Visitor will create the equivalent Tree::Simple heirarchy.
+.SH "METHODS"
+.IX Header "METHODS"
+.IP "\fBnew\fR" 4
+.IX Item "new"
+There are no arguments to the constructor the object will be in its default state. You can use the \f(CW\*(C`setNodeFilter\*(C'\fR methods to customize its behavior.
+.IP "\fBsetNodeFilter ($filter_function)\fR" 4
+.IX Item "setNodeFilter ($filter_function)"
+This method accepts a \s-1CODE\s0 reference as its \f(CW$filter_function\fR argument and throws an exception if it is not a code reference. This code reference is used to filter the tree nodes as they are created, the \f(CW$filter_function\fR is passed the node value extracted from the hash prior to it being inserted into the tree being built. The \f(CW$filter_function\fR is expected to return the value desired for inclusion into the tree.
+.IP "\fBsetHashTree ($hash_tree)\fR" 4
+.IX Item "setHashTree ($hash_tree)"
+This method is used to set the \f(CW$hash_tree\fR that our Tree::Simple heirarchy will be constructed from. It must be in the following form:
+.Sp
+.Vb 9
+\& {
+\& Root => {
+\& Child1 => {
+\& GrandChild1 => {},
+\& GrandChild2 => {}
+\& },
+\& Child2 => {}
+\& }
+\& }
+.Ve
+.Sp
+Basically each key in the hash is considered a node, values are ignored unless it is a hash reference with at least one key in it, in which case it is interpreted as containing the children of the node created from the key.
+.Sp
+The tree is validated prior being accepted, if it fails validation an execption will be thrown. The rules are as follows;
+.RS 4
+.IP "The hash tree must not be empty." 4
+.IX Item "The hash tree must not be empty."
+It makes not sense to create a tree out of nothing, so it is assumed that this is a sign of something wrong.
+.IP "The hash tree must be a single rooted tree." 4
+.IX Item "The hash tree must be a single rooted tree."
+The hash tree should have only one key in it's first level, if it has more than one, then it is not a single rooted tree.
+.RE
+.RS 4
+.Sp
+\&\fB\s-1NOTE:\s0\fR Hash keys are sorted ascii-betically before being added to the tree, this results in a somewhat more predictable hierarchy.
+.RE
+.IP "\fBvisit ($tree)\fR" 4
+.IX Item "visit ($tree)"
+This is the method that is used by Tree::Simple's \f(CW\*(C`accept\*(C'\fR method. It can also be used on its own, it requires the \f(CW$tree\fR argument to be a Tree::Simple object (or derived from a Tree::Simple object), and will throw and exception otherwise.
+.SH "BUGS"
+.IX Header "BUGS"
+None that I am aware of. Of course, if you find a bug, let me know, and I will be sure to fix it.
+.SH "CODE COVERAGE"
+.IX Header "CODE COVERAGE"
+See the \fB\s-1CODE\s0 \s-1COVERAGE\s0\fR section in Tree::Simple::VisitorFactory for more inforamtion.
+.SH "SEE ALSO"
+.IX Header "SEE ALSO"
+These Visitor classes are all subclasses of \fBTree::Simple::Visitor\fR, which can be found in the \fBTree::Simple\fR module, you should refer to that module for more information.
+.SH "AUTHOR"
+.IX Header "AUTHOR"
+stevan little, <stevan@iinteractive.com>
+.SH "COPYRIGHT AND LICENSE"
+.IX Header "COPYRIGHT AND LICENSE"
+Copyright 2004, 2005 by Infinity Interactive, Inc.
+.PP
+<http://www.iinteractive.com>
+.PP
+This library is free software; you can redistribute it and/or modify
+it under the same terms as Perl itself.
projects / catagits/Gitalist.git / blobdiff