| /macosx-10.10/CPANInternal-159.1/Tree-Simple-VisitorFactory-0.10/t/ |
| H A D | 30_Tree_Simple_Visitor_FindByPath_test.t | 67 my @results = $visitor->getResults();
81 my @results = $visitor->getResults();
94 my @results = $visitor->getResults();
106 my @results = $visitor->getResults();
120 my @results = $visitor->getResults();
138 my @results = $visitor->getResults();
150 my @results = $visitor->getResults();
|
| H A D | 96_Tree_Simple_Visitor_VariableDepthClone_test.t | 65 [ $checker->getResults() ],
86 [ $checker->getResults() ],
104 [ $checker->getResults() ],
122 [ $checker->getResults() ],
140 [ $checker->getResults() ],
158 [ $checker->getResults() ],
176 [ $checker->getResults() ],
201 [ $checker->getResults() ],
220 [ $checker->getResults() ],
239 [ $checker->getResults() ],
[all...] |
| H A D | 92_Tree_Simple_Visitor_ToNestedHash_test.t | 34 can_ok($visitor, 'getResults');
37 is_deeply($visitor->getResults(),
49 can_ok($visitor, 'getResults');
53 is_deeply($visitor->getResults(),
64 can_ok($visitor, 'getResults');
72 is_deeply($visitor->getResults(),
84 can_ok($visitor, 'getResults');
92 is_deeply($visitor->getResults(),
|
| H A D | 93_Tree_Simple_Visitor_ToNestedArray_test.t | 35 can_ok($visitor, 'getResults');
39 is_deeply($visitor->getResults(),
50 can_ok($visitor, 'getResults');
53 is_deeply($visitor->getResults(),
64 can_ok($visitor, 'getResults');
72 is_deeply($visitor->getResults(),
84 can_ok($visitor, 'getResults');
93 is_deeply($visitor->getResults(),
|
| H A D | 50_Tree_Simple_Visitor_BreadthFirstTraversal_test.t | 52 can_ok($visitor, 'getResults');
56 [ $visitor->getResults() ],
68 [ $visitor->getResults() ],
|
| H A D | 60_Tree_Simple_Visitor_PostOrderTraversal_test.t | 52 can_ok($visitor, 'getResults');
56 [ $visitor->getResults() ],
68 [ $visitor->getResults() ],
|
| H A D | 65_Tree_Simple_Visitor_PreOrederTraversal_test.t | 52 can_ok($visitor, 'getResults');
56 [ $visitor->getResults() ],
|
| H A D | 70_Tree_Simple_Visitor_LoadDirectoryTree_test.t | 99 [ sort $visitor_check->getResults() ],
178 [ $visitor_check->getResults() ],
258 [ $visitor_check->getResults() ],
|
| /macosx-10.10/JavaScriptCore-7600.1.17/tests/mozilla/ecma_3/RegExp/ |
| H A D | regress-103087.js | 135 getResults();
139 getResults();
143 getResults();
150 function getResults() function
|
| /macosx-10.10/CPANInternal-159.1/Tree-Simple-VisitorFactory-0.10/lib/Tree/Simple/Visitor/ |
| H A D | ToNestedArray.pm | 83 my $array_tree = $visitor->getResults();
98 my $array_tree = $visitor->getResults();
132 =item B<getResults>
|
| H A D | BreadthFirstTraversal.pm | 84 print join ", " => $visitor->getResults();
122 =item B<getResults>
|
| H A D | FindByPath.pm | 127 return $self->getResults()->[-1];
192 =item B<getResults>
|
| H A D | GetAllDescendents.pm | 66 return $self->getResults();
125 This method will give back and array of descendents in depth-first order (pre-order) or in the order specified by the C<setTraversalMethod>. If called in scalar context it will give an array reference, in list context it will return a regular array. This method is the same as calling C<getResults>.
|
| H A D | PathToRoot.pm | 50 return $self->getResults();
56 return join $delimiter => $self->getResults();
|
| H A D | PostOrderTraversal.pm | 77 print join ", " => $visitor->getResults();
115 =item B<getResults>
|
| H A D | PreOrderTraversal.pm | 39 print join ", " => $visitor->getResults();
77 =item B<getResults>
|
| H A D | ToNestedHash.pm | 81 my $array_tree = $visitor->getResults();
118 =item B<getResults>
|
| H A D | FindByNodeValue.pm | 124 return $self->getResults()->[0];
|
| H A D | VariableDepthClone.pm | 37 return $self->getResults()->[0];
|
| H A D | FindByUID.pm | 124 return $self->getResults()->[0];
|
| /macosx-10.10/CPANInternal-159.1/Tree-Simple-1.18/t/ |
| H A D | 20_Tree_Simple_Visitor_test.t | 45 can_ok($visitor, 'getResults');
47 [ $visitor->getResults() ],
63 scalar $visitor->getResults(),
|
| /macosx-10.10/CPANInternal-159.1/Tree-Simple-1.18/lib/Tree/Simple/ |
| H A D | Visitor.pm | 81 sub getResults { subroutine
152 print join ", ", $visitor->getResults(); # prints "1.0, 2.0, 2.1.0, 3.0"
187 print join ", ", $visitor->getResults(); # prints "1.0, 2.0, 2.1.0, 3.0"
219 =item B<getResults>
229 The C<visit> method accepts a B<Tree::Simple> and applies the function set in C<new> or C<setNodeFilter> appropriately. The results of this application can be retrieved with C<getResults>
|