Searched refs:visitor (Results 1 - 25 of 220) sorted by relevance

123456789

/macosx-10.9.5/CPANInternal-140/Tree-Simple-VisitorFactory/t/
H A D92_Tree_Simple_Visitor_ToNestedHash_test.t29 my $visitor = Tree::Simple::Visitor::ToNestedHash->new();
30 isa_ok($visitor, 'Tree::Simple::Visitor::ToNestedHash');
31 isa_ok($visitor, 'Tree::Simple::Visitor');
33 can_ok($visitor, 'visit');
34 can_ok($visitor, 'getResults');
36 $tree->accept($visitor);
37 is_deeply($visitor->getResults(),
43 my $visitor = Tree::Simple::Visitor::ToNestedHash->new();
44 isa_ok($visitor, 'Tree::Simple::Visitor::ToNestedHash');
45 isa_ok($visitor, 'Tre
[all...]
H A D93_Tree_Simple_Visitor_ToNestedArray_test.t29 my $visitor = Tree::Simple::Visitor::ToNestedArray->new();
30 isa_ok($visitor, 'Tree::Simple::Visitor::ToNestedArray');
31 isa_ok($visitor, 'Tree::Simple::Visitor');
33 can_ok($visitor, 'includeTrunk');
34 can_ok($visitor, 'visit');
35 can_ok($visitor, 'getResults');
37 $visitor->includeTrunk(1);
38 $tree->accept($visitor);
39 is_deeply($visitor->getResults(),
45 my $visitor
[all...]
H A D32_Tree_Simple_Visitor_FindByNodeValue_test.t61 my $visitor = Tree::Simple::Visitor::FindByNodeValue->new();
62 isa_ok($visitor, 'Tree::Simple::Visitor::FindByNodeValue');
63 isa_ok($visitor, 'Tree::Simple::Visitor');
65 can_ok($visitor, 'searchForNodeValue');
66 can_ok($visitor, 'visit');
67 can_ok($visitor, 'getResult');
69 $visitor->searchForNodeValue($first_search_NodeValue);
70 $tree->accept($visitor);
72 my $match = $visitor->getResult();
79 my $visitor
[all...]
H A D35_Tree_Simple_Visitor_FindByUID_test.t60 my $visitor = Tree::Simple::Visitor::FindByUID->new();
61 isa_ok($visitor, 'Tree::Simple::Visitor::FindByUID');
62 isa_ok($visitor, 'Tree::Simple::Visitor');
64 can_ok($visitor, 'searchForUID');
65 can_ok($visitor, 'visit');
66 can_ok($visitor, 'getResult');
68 $visitor->searchForUID($first_search_UID);
69 $tree->accept($visitor);
71 my $match = $visitor->getResult();
78 my $visitor
[all...]
H A D30_Tree_Simple_Visitor_FindByPath_test.t53 my $visitor = Tree::Simple::Visitor::FindByPath->new();
54 isa_ok($visitor, 'Tree::Simple::Visitor::FindByPath');
55 isa_ok($visitor, 'Tree::Simple::Visitor');
57 can_ok($visitor, 'setSearchPath');
58 can_ok($visitor, 'visit');
59 can_ok($visitor, 'getResult');
62 $visitor->setSearchPath(qw(1 1.2 1.2.2));
63 $tree->accept($visitor);
64 is($visitor->getResult(), $first_search, '... this should be what we got back');
67 my @results = $visitor
[all...]
H A D96_Tree_Simple_Visitor_VariableDepthClone_test.t49 my $visitor = Tree::Simple::Visitor::VariableDepthClone->new();
50 isa_ok($visitor, 'Tree::Simple::Visitor::VariableDepthClone');
51 isa_ok($visitor, 'Tree::Simple::Visitor');
53 can_ok($visitor, 'setCloneDepth');
54 can_ok($visitor, 'getClone');
56 $visitor->setCloneDepth(2);
58 $tree->accept($visitor);
60 my $cloned = $visitor->getClone();
71 my $visitor = Tree::Simple::Visitor::VariableDepthClone->new();
72 isa_ok($visitor, 'Tre
[all...]
H A D91_Tree_Simple_Visitor_FromNestedArray_test.t29 my $visitor = Tree::Simple::Visitor::FromNestedArray->new();
30 isa_ok($visitor, 'Tree::Simple::Visitor::FromNestedArray');
31 isa_ok($visitor, 'Tree::Simple::Visitor');
33 can_ok($visitor, 'setArrayTree');
34 $visitor->setArrayTree($array_tree);
36 can_ok($visitor, 'visit');
39 $tree->accept($visitor);
61 my $visitor = Tree::Simple::Visitor::FromNestedArray->new();
62 isa_ok($visitor, 'Tree::Simple::Visitor::FromNestedArray');
63 isa_ok($visitor, 'Tre
[all...]
H A D90_Tree_Simple_Visitor_FromNestedHash_test.t28 my $visitor = Tree::Simple::Visitor::FromNestedHash->new();
29 isa_ok($visitor, 'Tree::Simple::Visitor::FromNestedHash');
30 isa_ok($visitor, 'Tree::Simple::Visitor');
32 can_ok($visitor, 'setHashTree');
33 $visitor->setHashTree($hash_tree);
35 can_ok($visitor, 'visit');
39 $tree->accept($visitor);
61 my $visitor = Tree::Simple::Visitor::FromNestedHash->new();
62 isa_ok($visitor, 'Tree::Simple::Visitor::FromNestedHash');
63 isa_ok($visitor, 'Tre
[all...]
H A D75_Tree_Simple_Visitor_CreateDirectoryTree_test.t36 my $visitor = Tree::Simple::Visitor::CreateDirectoryTree->new();
37 isa_ok($visitor, 'Tree::Simple::Visitor::CreateDirectoryTree');
38 isa_ok($visitor, 'Tree::Simple::Visitor');
40 can_ok($visitor, 'visit');
42 $dir_tree->accept($visitor);
86 my $visitor = Tree::Simple::Visitor::CreateDirectoryTree->new();
87 isa_ok($visitor, 'Tree::Simple::Visitor::CreateDirectoryTree');
88 isa_ok($visitor, 'Tree::Simple::Visitor');
90 can_ok($visitor, 'visit');
91 can_ok($visitor, 'setFileHandle
[all...]
H A D20_Tree_Simple_Visitor_PathToRoot_test.t55 my $visitor = Tree::Simple::Visitor::PathToRoot->new();
56 isa_ok($visitor, 'Tree::Simple::Visitor::PathToRoot');
57 isa_ok($visitor, 'Tree::Simple::Visitor');
59 can_ok($visitor, 'visit');
60 can_ok($visitor, 'getPathAsString');
61 can_ok($visitor, 'getPath');
63 $kind_of_deep->accept($visitor);
65 is($visitor->getPathAsString("/"), "2/2.2/2.2.1", '... our paths match');
67 [ $visitor->getPath() ],
71 can_ok($visitor, 'setNodeFilte
[all...]
H A D50_Tree_Simple_Visitor_BreadthFirstTraversal_test.t47 my $visitor = Tree::Simple::Visitor::BreadthFirstTraversal->new();
48 isa_ok($visitor, 'Tree::Simple::Visitor::BreadthFirstTraversal');
49 isa_ok($visitor, 'Tree::Simple::Visitor');
51 can_ok($visitor, 'visit');
52 can_ok($visitor, 'getResults');
54 $tree->accept($visitor);
56 [ $visitor->getResults() ],
60 can_ok($visitor, 'setNodeFilter');
61 $visitor->setNodeFilter(sub { "Tree_" . $_[0]->getNodeValue() });
63 can_ok($visitor, 'includeTrun
[all...]
H A D60_Tree_Simple_Visitor_PostOrderTraversal_test.t47 my $visitor = Tree::Simple::Visitor::PostOrderTraversal->new();
48 isa_ok($visitor, 'Tree::Simple::Visitor::PostOrderTraversal');
49 isa_ok($visitor, 'Tree::Simple::Visitor');
51 can_ok($visitor, 'visit');
52 can_ok($visitor, 'getResults');
54 $tree->accept($visitor);
56 [ $visitor->getResults() ],
60 can_ok($visitor, 'setNodeFilter');
61 $visitor->setNodeFilter(sub { "Tree_" . $_[0]->getNodeValue() });
63 can_ok($visitor, 'includeTrun
[all...]
/macosx-10.9.5/CPANInternal-140/Tree-Simple-VisitorFactory-0.10/t/
H A D92_Tree_Simple_Visitor_ToNestedHash_test.t29 my $visitor = Tree::Simple::Visitor::ToNestedHash->new();
30 isa_ok($visitor, 'Tree::Simple::Visitor::ToNestedHash');
31 isa_ok($visitor, 'Tree::Simple::Visitor');
33 can_ok($visitor, 'visit');
34 can_ok($visitor, 'getResults');
36 $tree->accept($visitor);
37 is_deeply($visitor->getResults(),
43 my $visitor = Tree::Simple::Visitor::ToNestedHash->new();
44 isa_ok($visitor, 'Tree::Simple::Visitor::ToNestedHash');
45 isa_ok($visitor, 'Tre
[all...]
H A D93_Tree_Simple_Visitor_ToNestedArray_test.t29 my $visitor = Tree::Simple::Visitor::ToNestedArray->new();
30 isa_ok($visitor, 'Tree::Simple::Visitor::ToNestedArray');
31 isa_ok($visitor, 'Tree::Simple::Visitor');
33 can_ok($visitor, 'includeTrunk');
34 can_ok($visitor, 'visit');
35 can_ok($visitor, 'getResults');
37 $visitor->includeTrunk(1);
38 $tree->accept($visitor);
39 is_deeply($visitor->getResults(),
45 my $visitor
[all...]
H A D32_Tree_Simple_Visitor_FindByNodeValue_test.t61 my $visitor = Tree::Simple::Visitor::FindByNodeValue->new();
62 isa_ok($visitor, 'Tree::Simple::Visitor::FindByNodeValue');
63 isa_ok($visitor, 'Tree::Simple::Visitor');
65 can_ok($visitor, 'searchForNodeValue');
66 can_ok($visitor, 'visit');
67 can_ok($visitor, 'getResult');
69 $visitor->searchForNodeValue($first_search_NodeValue);
70 $tree->accept($visitor);
72 my $match = $visitor->getResult();
79 my $visitor
[all...]
H A D35_Tree_Simple_Visitor_FindByUID_test.t60 my $visitor = Tree::Simple::Visitor::FindByUID->new();
61 isa_ok($visitor, 'Tree::Simple::Visitor::FindByUID');
62 isa_ok($visitor, 'Tree::Simple::Visitor');
64 can_ok($visitor, 'searchForUID');
65 can_ok($visitor, 'visit');
66 can_ok($visitor, 'getResult');
68 $visitor->searchForUID($first_search_UID);
69 $tree->accept($visitor);
71 my $match = $visitor->getResult();
78 my $visitor
[all...]
H A D30_Tree_Simple_Visitor_FindByPath_test.t53 my $visitor = Tree::Simple::Visitor::FindByPath->new();
54 isa_ok($visitor, 'Tree::Simple::Visitor::FindByPath');
55 isa_ok($visitor, 'Tree::Simple::Visitor');
57 can_ok($visitor, 'setSearchPath');
58 can_ok($visitor, 'visit');
59 can_ok($visitor, 'getResult');
62 $visitor->setSearchPath(qw(1 1.2 1.2.2));
63 $tree->accept($visitor);
64 is($visitor->getResult(), $first_search, '... this should be what we got back');
67 my @results = $visitor
[all...]
H A D96_Tree_Simple_Visitor_VariableDepthClone_test.t49 my $visitor = Tree::Simple::Visitor::VariableDepthClone->new();
50 isa_ok($visitor, 'Tree::Simple::Visitor::VariableDepthClone');
51 isa_ok($visitor, 'Tree::Simple::Visitor');
53 can_ok($visitor, 'setCloneDepth');
54 can_ok($visitor, 'getClone');
56 $visitor->setCloneDepth(2);
58 $tree->accept($visitor);
60 my $cloned = $visitor->getClone();
71 my $visitor = Tree::Simple::Visitor::VariableDepthClone->new();
72 isa_ok($visitor, 'Tre
[all...]
H A D91_Tree_Simple_Visitor_FromNestedArray_test.t29 my $visitor = Tree::Simple::Visitor::FromNestedArray->new();
30 isa_ok($visitor, 'Tree::Simple::Visitor::FromNestedArray');
31 isa_ok($visitor, 'Tree::Simple::Visitor');
33 can_ok($visitor, 'setArrayTree');
34 $visitor->setArrayTree($array_tree);
36 can_ok($visitor, 'visit');
39 $tree->accept($visitor);
61 my $visitor = Tree::Simple::Visitor::FromNestedArray->new();
62 isa_ok($visitor, 'Tree::Simple::Visitor::FromNestedArray');
63 isa_ok($visitor, 'Tre
[all...]
H A D90_Tree_Simple_Visitor_FromNestedHash_test.t28 my $visitor = Tree::Simple::Visitor::FromNestedHash->new();
29 isa_ok($visitor, 'Tree::Simple::Visitor::FromNestedHash');
30 isa_ok($visitor, 'Tree::Simple::Visitor');
32 can_ok($visitor, 'setHashTree');
33 $visitor->setHashTree($hash_tree);
35 can_ok($visitor, 'visit');
39 $tree->accept($visitor);
61 my $visitor = Tree::Simple::Visitor::FromNestedHash->new();
62 isa_ok($visitor, 'Tree::Simple::Visitor::FromNestedHash');
63 isa_ok($visitor, 'Tre
[all...]
H A D75_Tree_Simple_Visitor_CreateDirectoryTree_test.t36 my $visitor = Tree::Simple::Visitor::CreateDirectoryTree->new();
37 isa_ok($visitor, 'Tree::Simple::Visitor::CreateDirectoryTree');
38 isa_ok($visitor, 'Tree::Simple::Visitor');
40 can_ok($visitor, 'visit');
42 $dir_tree->accept($visitor);
86 my $visitor = Tree::Simple::Visitor::CreateDirectoryTree->new();
87 isa_ok($visitor, 'Tree::Simple::Visitor::CreateDirectoryTree');
88 isa_ok($visitor, 'Tree::Simple::Visitor');
90 can_ok($visitor, 'visit');
91 can_ok($visitor, 'setFileHandle
[all...]
H A D20_Tree_Simple_Visitor_PathToRoot_test.t55 my $visitor = Tree::Simple::Visitor::PathToRoot->new();
56 isa_ok($visitor, 'Tree::Simple::Visitor::PathToRoot');
57 isa_ok($visitor, 'Tree::Simple::Visitor');
59 can_ok($visitor, 'visit');
60 can_ok($visitor, 'getPathAsString');
61 can_ok($visitor, 'getPath');
63 $kind_of_deep->accept($visitor);
65 is($visitor->getPathAsString("/"), "2/2.2/2.2.1", '... our paths match');
67 [ $visitor->getPath() ],
71 can_ok($visitor, 'setNodeFilte
[all...]
H A D50_Tree_Simple_Visitor_BreadthFirstTraversal_test.t47 my $visitor = Tree::Simple::Visitor::BreadthFirstTraversal->new();
48 isa_ok($visitor, 'Tree::Simple::Visitor::BreadthFirstTraversal');
49 isa_ok($visitor, 'Tree::Simple::Visitor');
51 can_ok($visitor, 'visit');
52 can_ok($visitor, 'getResults');
54 $tree->accept($visitor);
56 [ $visitor->getResults() ],
60 can_ok($visitor, 'setNodeFilter');
61 $visitor->setNodeFilter(sub { "Tree_" . $_[0]->getNodeValue() });
63 can_ok($visitor, 'includeTrun
[all...]
H A D60_Tree_Simple_Visitor_PostOrderTraversal_test.t47 my $visitor = Tree::Simple::Visitor::PostOrderTraversal->new();
48 isa_ok($visitor, 'Tree::Simple::Visitor::PostOrderTraversal');
49 isa_ok($visitor, 'Tree::Simple::Visitor');
51 can_ok($visitor, 'visit');
52 can_ok($visitor, 'getResults');
54 $tree->accept($visitor);
56 [ $visitor->getResults() ],
60 can_ok($visitor, 'setNodeFilter');
61 $visitor->setNodeFilter(sub { "Tree_" . $_[0]->getNodeValue() });
63 can_ok($visitor, 'includeTrun
[all...]
/macosx-10.9.5/ruby-104/ruby/lib/rdoc/markup/
H A Dblock_quote.rb7 # Calls #accept_block_quote on +visitor+
9 def accept visitor
10 visitor.accept_block_quote self

Completed in 213 milliseconds

123456789