Checking if your kit is complete... Looks good Writing Makefile for Tree::Binary Microsoft (R) Program Maintenance Utility Version 7.10.3077 Copyright (C) Microsoft Corporation. All rights reserved. cp lib/Tree/Binary/Visitor/BreadthFirstTraversal.pm blib\lib\Tree\Binary\Visitor\BreadthFirstTraversal.pm cp lib/Tree/Binary/Visitor/PostOrderTraversal.pm blib\lib\Tree\Binary\Visitor\PostOrderTraversal.pm cp lib/Tree/Binary/Visitor/PreOrderTraversal.pm blib\lib\Tree\Binary\Visitor\PreOrderTraversal.pm cp lib/Tree/Binary/Search/Node.pm blib\lib\Tree\Binary\Search\Node.pm cp lib/Tree/Binary/Search.pm blib\lib\Tree\Binary\Search.pm cp lib/Tree/Binary/Visitor/InOrderTraversal.pm blib\lib\Tree\Binary\Visitor\InOrderTraversal.pm cp lib/Tree/Binary.pm blib\lib\Tree\Binary.pm cp lib/Tree/Binary/Visitor/Base.pm blib\lib\Tree\Binary\Visitor\Base.pm cp lib/Tree/Binary/VisitorFactory.pm blib\lib\Tree\Binary\VisitorFactory.pm Microsoft (R) Program Maintenance Utility Version 7.10.3077 Copyright (C) Microsoft Corporation. All rights reserved. C:\cpanrun\build\5-10-0\bin\perl.exe "-MExtUtils::Command::MM" "-e" "test_harness(1, 'blib\lib', 'blib\arch')" t/*.t t/10_Tree_Binary_test......................1..61 ok 1 - use Tree::Binary; ok 2 - Tree::Binary->can('new') ok 3 - Tree::Binary->can('setLeft') ok 4 - Tree::Binary->can('setRight') ok 5 - The object isa Tree::Binary ok 6 - Tree::Binary->can('isRoot') ok 7 - ... this is the root ok 8 - Tree::Binary->can('isLeaf') ok 9 - ... this is not a leaf node ok 10 - ... this is a leaf node ok 11 - Tree::Binary->can('hasLeft') ok 12 - ... this has a left node ok 13 - Tree::Binary->can('hasRight') ok 14 - ... this has a right node ok 15 - Tree::Binary->can('getUID') ok 16 - ... our UID is derived from the stringified object ok 17 - Tree::Binary->can('getNodeValue') ok 18 - ... got what we expected ok 19 - Tree::Binary->can('getLeft') ok 20 - The object isa Tree::Binary ok 21 - ... got what we expected ok 22 - Tree::Binary->can('getParent') ok 23 - The object isa Tree::Binary ok 24 - .. got what we expected ok 25 - Tree::Binary->can('getRight') ok 26 - The object isa Tree::Binary ok 27 - ... got what we expected ok 28 - Tree::Binary->can('getParent') ok 29 - The object isa Tree::Binary ok 30 - .. got what we expected ok 31 - Tree::Binary->can('setUID') ok 32 - ... our UID is not what we expected ok 33 - Tree::Binary->can('setNodeValue') ok 34 - ... got what we expected ok 35 - Tree::Binary->can('removeLeft') ok 36 - The object isa Tree::Binary ok 37 - ... we dont have a left node anymore ok 38 - ... and we are not a leaf node ok 39 - ... we have our left node again ok 40 - ... and it is what we told it to be ok 41 - The object isa Tree::Binary ok 42 - ... our left leaf is a leaf ok 43 - ... we dont have a left leaf node anymore ok 44 - ... we have our left leaf node again ok 45 - ... and it is what we told it to be ok 46 - Tree::Binary->can('removeRight') ok 47 - The object isa Tree::Binary ok 48 - ... we dont have a right node anymore ok 49 - ... and we are not a leaf node ok 50 - ... we have our right node again ok 51 - ... and it is what we told it to be ok 52 - The object isa Tree::Binary ok 53 - ... our right leaf is a leaf ok 54 - ... we dont have a right leaf node anymore ok 55 - ... we have our right leaf node again ok 56 - ... and it is what we told it to be ok 57 - The object isa Tree::Binary ok 58 - Tree::Binary->can('size') ok 59 - ... we have 14 nodes in the tree ok 60 - Tree::Binary->can('height') ok 61 - ... the tree is 6 nodes tall ok t/11_Tree_Binary_exceptions_test...........1..22 ok 1 - use Tree::Binary; ok 2 - The object isa Tree::Binary ok 3 - ... this should die ok 4 - ... this should die ok 5 - ... this should die ok 6 - ... this should die ok 7 - ... this should die ok 8 - ... this should die ok 9 - ... this should die ok 10 - ... this should die ok 11 - ... this should die ok 12 - ... this should die ok 13 - ... this should die ok 14 - ... this should die ok 15 - ... this should die ok 16 - ... this should die ok 17 - ... this should die ok 18 - ... this should die ok 19 - ... this should die ok 20 - ... this should die ok 21 - ... this should die ok 22 - ... but, this should live ok t/12_Tree_Binary_clone_test................1..47 ok 1 - use Tree::Binary; ok 2 - ... the clones parent is not defined ok 3 - ... these should be refs ok 4 - ... these should be the same value ok 5 - ... the parentage should be correct ok 6 - ... these should be scalar refs ok 7 - ... these should be scalar refs ok 8 - ... these should be different scalar refs ok 9 - ... these should be the same value ok 10 - ... the parentage should be correct ok 11 - ... these should be array refs ok 12 - ... these should be array refs ok 13 - ... these should be different array refs ok 14 - ... these should have the same contents ok 15 - ... the parentage should be correct ok 16 - ... these should be hash refs ok 17 - ... these should be hash refs ok 18 - ... these should be different hash refs ok 19 - ... these should have the same contents ok 20 - ... the parentage should be correct ok 21 - ... these should be code refs ok 22 - ... these should be code refs ok 23 - ... these should be the same code refs ok 24 - ... this is equal ok 25 - ... the parentage should be correct ok 26 - ... these should be reg-ex refs ok 27 - ... these should be reg-ex refs ok 28 - ... these should be the same reg-ex refs ok 29 - ... the parentage should be correct ok 30 - ... these should be misc object refs ok 31 - ... these should be misc object refs ok 32 - ... these should be the same misc object refs ok 33 - ... the parentage should be correct ok 34 - ... these should be ref to ref refs ok 35 - ... these should be ref to ref refs ok 36 - ... these should be the same REF refs ok 37 - ... these should be the same REF refs ok 38 - ... the parentage should be correct ok 39 - ... these should be Tree::Binary ok 40 - ... these should be Tree::Binary ok 41 - ... these should be different Tree::Binary objects ok 42 - ... these should have the same contents ok 43 - ... the parentage should be correct ok 44 - ... these should be refs ok 45 - ... the children are the same ok 46 - ... these should be different Tree::Binary objects ok 47 - ... these should have the same contents ok t/13_Tree_Binary_mirror_test...............1..10 ok 1 - use Tree::Binary; ok 2 - use Tree::Binary::Visitor::InOrderTraversal; ok 3 - The object isa Tree::Binary ok 4 - The object isa Tree::Binary::Visitor::InOrderTraversal ok 5 - ... check that our tree starts out correctly ok 6 - Tree::Binary->can('mirror') ok 7 - ... check that our tree ends up correctly ok 8 - The object isa Tree::Binary ok 9 - The object isa Tree::Binary::Visitor::InOrderTraversal ok 10 - ... this should be the reverse of the original ok t/14_Tree_Binary_leak_test.................1..0 # Skip Test::Memory::Cycle required for testing memory leaks skipped all skipped: Test::Memory::Cycle required for testing memory leaks t/20_Tree_Binary_Search_test...............1..43 ok 1 - use Tree::Binary::Search; ok 2 - Tree::Binary::Search->can('new') ok 3 - The object isa Tree::Binary::Search ok 4 - Tree::Binary::Search->can('insert') ok 5 - Tree::Binary::Search->can('select') ok 6 - Tree::Binary::Search->can('update') ok 7 - Tree::Binary::Search->can('exists') ok 8 - Tree::Binary::Search->can('max_key') ok 9 - Tree::Binary::Search->can('min_key') ok 10 - Tree::Binary::Search->can('max') ok 11 - Tree::Binary::Search->can('min') ok 12 - Tree::Binary::Search->can('size') ok 13 - Tree::Binary::Search->can('height') ok 14 - Tree::Binary::Search->can('useNumericComparison') ok 15 - ... no keys yet exist ok 16 - ... this should die ok 17 - ... this key exists ok 18 - ... this key does not exists ok 19 - ... this key does not exists ok 20 - ... found what we were looking for ok 21 - ... found what we were looking for ok 22 - ... found what we were looking for ok 23 - ... found what we were looking for ok 24 - ... found what we were looking for ok 25 - ... found what we were looking for ok 26 - ... found what we were looking for ok 27 - ... found what we were looking for ok 28 - ... found what we were looking for ok 29 - ... found what we were looking for ok 30 - ... found what we were looking for ok 31 - ... this should die ok 32 - ... found what we were looking for ok 33 - ... found what we were looking for ok 34 - ... got the max key ok 35 - ... got the min key ok 36 - ... got the max value ok 37 - ... got the min value ok 38 - ... we have 12 nodes in the tree ok 39 - ... the tree is 6 nodes tall ok 40 - The object isa Tree::Binary::Search ok 41 - Tree::Binary::Search->can('useStringComparison') ok 42 - The object isa BinaryTreeNode ok 43 - The object isa Tree::Binary::Search::Node ok t/21_Tree_Binary_Search_delete_test........1..40 ok 1 - use Tree::Binary::Search; ok 2 - use Tree::Binary::Visitor::InOrderTraversal; ok 3 - The object isa Tree::Binary::Search ok 4 - ... tree is as expected ok 5 - ... the node was successfully deleted ok 6 - ... tree is as expected ok 7 - ... the node was successfully deleted ok 8 - ... tree is as expected ok 9 - ... the node was successfully deleted ok 10 - ... tree is as expected ok 11 - ... the node was successfully deleted ok 12 - ... tree is as expected ok 13 - ... the node was successfully deleted ok 14 - ... tree is as expected ok 15 - ... the node was successfully deleted ok 16 - ... tree is as expected ok 17 - ... the node was successfully deleted ok 18 - ... tree is as expected ok 19 - ... the node was successfully deleted ok 20 - ... tree is as expected ok 21 - ... the node was successfully deleted ok 22 - ... our tree is now empty ok 23 - The object isa Tree::Binary::Search ok 24 - ... tree is as expected ok 25 - ... the node was successfully deleted ok 26 - ... tree is as expected ok 27 - ... the node was successfully deleted ok 28 - ... tree is as expected ok 29 - ... the node was successfully deleted ok 30 - ... tree is as expected ok 31 - The object isa Tree::Binary::Search ok 32 - ... tree is as expected ok 33 - ... the node was successfully deleted ok 34 - ... tree is as expected ok 35 - ... the node was successfully deleted ok 36 - ... tree is as expected ok 37 - ... the node was successfully deleted ok 38 - ... tree is as expected ok 39 - ... the node was successfully deleted ok 40 - ... tree is as expected ok t/22_Tree_Binary_Search_exceptions_test....1..31 ok 1 - use Tree::Binary::Search; ok 2 - The object isa Tree::Binary::Search ok 3 - ... this should die ok 4 - ... this should die ok 5 - ... this should die ok 6 - ... this should die ok 7 - ... this should die ok 8 - ... this should die ok 9 - ... this should die ok 10 - ... this should die ok 11 - ... this should die ok 12 - ... this should die ok 13 - ... this should die ok 14 - ... this should die ok 15 - ... this should die ok 16 - ... this should die ok 17 - ... this should die ok 18 - ... this should die ok 19 - ... this should die ok 20 - ... this should die ok 21 - ... this should die ok 22 - ... this should die ok 23 - ... this should die ok 24 - ... this should die ok 25 - ... this should die ok 26 - ... this should die ok 27 - ... this should die ok 28 - ... this should die ok 29 - ... this should die ok 30 - ... this should die ok 31 - ... this should die ok t/25_Tree_Binary_Search_Node_test..........1..9 ok 1 - use Tree::Binary::Search::Node; ok 2 - Tree::Binary::Search::Node->can('new') ok 3 - The object isa Tree::Binary::Search::Node ok 4 - The object isa Tree::Binary ok 5 - ... this should die ok 6 - ... this should die ok 7 - Tree::Binary::Search::Node->can('clone') ok 8 - ... the keys are the same ok 9 - Tree::Binary::Search::Node->can('makeRoot') ok t/30_Tree_Binary_Visitors_test.............1..43 ok 1 - use Tree::Binary; ok 2 - use Tree::Binary::Visitor::PreOrderTraversal; ok 3 - use Tree::Binary::Visitor::PostOrderTraversal; ok 4 - use Tree::Binary::Visitor::InOrderTraversal; ok 5 - use Tree::Binary::Visitor::BreadthFirstTraversal; ok 6 - The object isa Tree::Binary ok 7 - Tree::Binary->can('accept') ok 8 - Tree::Binary::Visitor::PreOrderTraversal->can('new') ok 9 - The object isa Tree::Binary::Visitor::PreOrderTraversal ok 10 - The object isa Tree::Binary::Visitor::Base ok 11 - Tree::Binary::Visitor::PreOrderTraversal->can('visit') ok 12 - Tree::Binary::Visitor::PreOrderTraversal->can('getResults') ok 13 - ... our PreOrder Traversal works ok 14 - The object isa Tree::Binary::Visitor::PreOrderTraversal ok 15 - Tree::Binary::Visitor::PreOrderTraversal->can('setNodeFilter') ok 16 - ... our PreOrder Traversal works ok 17 - Tree::Binary::Visitor::PostOrderTraversal->can('new') ok 18 - The object isa Tree::Binary::Visitor::PostOrderTraversal ok 19 - The object isa Tree::Binary::Visitor::Base ok 20 - Tree::Binary::Visitor::PostOrderTraversal->can('visit') ok 21 - Tree::Binary::Visitor::PostOrderTraversal->can('getResults') ok 22 - ... our PostOrder Traversal works ok 23 - The object isa Tree::Binary::Visitor::PostOrderTraversal ok 24 - Tree::Binary::Visitor::PostOrderTraversal->can('setNodeFilter') ok 25 - ... our PostOrder Traversal works ok 26 - Tree::Binary::Visitor::InOrderTraversal->can('new') ok 27 - The object isa Tree::Binary::Visitor::InOrderTraversal ok 28 - The object isa Tree::Binary::Visitor::Base ok 29 - Tree::Binary::Visitor::InOrderTraversal->can('visit') ok 30 - Tree::Binary::Visitor::InOrderTraversal->can('getResults') ok 31 - ... our InOrder Traversal works ok 32 - The object isa Tree::Binary::Visitor::InOrderTraversal ok 33 - Tree::Binary::Visitor::InOrderTraversal->can('setNodeFilter') ok 34 - ... our InOrder Traversal works ok 35 - Tree::Binary::Visitor::BreadthFirstTraversal->can('new') ok 36 - The object isa Tree::Binary::Visitor::BreadthFirstTraversal ok 37 - The object isa Tree::Binary::Visitor::Base ok 38 - Tree::Binary::Visitor::BreadthFirstTraversal->can('visit') ok 39 - Tree::Binary::Visitor::BreadthFirstTraversal->can('getResults') ok 40 - ... our PreOrder Traversal works ok 41 - The object isa Tree::Binary::Visitor::BreadthFirstTraversal ok 42 - Tree::Binary::Visitor::BreadthFirstTraversal->can('setNodeFilter') ok 43 - ... our PreOrder Traversal works ok t/31_Tree_Binary_Visitors_misc_test........1..39 ok 1 - use Tree::Binary::Visitor::Base; ok 2 - use Tree::Binary::VisitorFactory; ok 3 - use Tree::Binary::Visitor::PreOrderTraversal; ok 4 - use Tree::Binary::Visitor::PostOrderTraversal; ok 5 - use Tree::Binary::Visitor::InOrderTraversal; ok 6 - use Tree::Binary::Visitor::BreadthFirstTraversal; ok 7 - Tree::Binary::Visitor::Base->can('new') ok 8 - The object isa Tree::Binary::Visitor::Base ok 9 - Tree::Binary::Visitor::Base->can('visit') ok 10 - ... this should die ok 11 - Tree::Binary::Visitor::Base->can('setNodeFilter') ok 12 - Tree::Binary::Visitor::Base->can('getNodeFilter') ok 13 - Tree::Binary::Visitor::Base->can('clearNodeFilter') ok 14 - ... this should die ok 15 - ... this should die ok 16 - ... this should die ok 17 - ... we have the right node filter ok 18 - ... we have the right node filter ok 19 - ... our node filter is now undefined ok 20 - Tree::Binary::VisitorFactory->can('new') ok 21 - The object isa Tree::Binary::VisitorFactory ok 22 - ... this should die ok 23 - ... this should die ok 24 - ... this should die ok 25 - ... this should die ok 26 - ... this should die ok 27 - ... this should die ok 28 - ... this should die ok 29 - ... this should die ok 30 - ... this should die ok 31 - ... this should die ok 32 - ... this should die ok 33 - ... this should die ok 34 - ... this should die ok 35 - ... this should die ok 36 - ... this should die ok 37 - ... this should die ok 38 - ... this should die ok 39 - ... this should die ok t/50_Tree_Binary_Theorem_Proofs_test.......1..140 ok 1 - ... mirror(mirror(t)) = t ok 2 - ... size(mirror(t)) = size(t) ok 3 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 4 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 5 - ... reverse(inorder(mirror(t))) = inorder(t) ok 6 - ... size(t) <= 2 ** height(t) - 1 ok 7 - ... length(preorder(t)) = size(t) ok 8 - ... mirror(mirror(t)) = t ok 9 - ... size(mirror(t)) = size(t) ok 10 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 11 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 12 - ... reverse(inorder(mirror(t))) = inorder(t) ok 13 - ... size(t) <= 2 ** height(t) - 1 ok 14 - ... length(preorder(t)) = size(t) ok 15 - ... mirror(mirror(t)) = t ok 16 - ... size(mirror(t)) = size(t) ok 17 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 18 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 19 - ... reverse(inorder(mirror(t))) = inorder(t) ok 20 - ... size(t) <= 2 ** height(t) - 1 ok 21 - ... length(preorder(t)) = size(t) ok 22 - ... mirror(mirror(t)) = t ok 23 - ... size(mirror(t)) = size(t) ok 24 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 25 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 26 - ... reverse(inorder(mirror(t))) = inorder(t) ok 27 - ... size(t) <= 2 ** height(t) - 1 ok 28 - ... length(preorder(t)) = size(t) ok 29 - ... mirror(mirror(t)) = t ok 30 - ... size(mirror(t)) = size(t) ok 31 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 32 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 33 - ... reverse(inorder(mirror(t))) = inorder(t) ok 34 - ... size(t) <= 2 ** height(t) - 1 ok 35 - ... length(preorder(t)) = size(t) ok 36 - ... mirror(mirror(t)) = t ok 37 - ... size(mirror(t)) = size(t) ok 38 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 39 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 40 - ... reverse(inorder(mirror(t))) = inorder(t) ok 41 - ... size(t) <= 2 ** height(t) - 1 ok 42 - ... length(preorder(t)) = size(t) ok 43 - ... mirror(mirror(t)) = t ok 44 - ... size(mirror(t)) = size(t) ok 45 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 46 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 47 - ... reverse(inorder(mirror(t))) = inorder(t) ok 48 - ... size(t) <= 2 ** height(t) - 1 ok 49 - ... length(preorder(t)) = size(t) ok 50 - ... mirror(mirror(t)) = t ok 51 - ... size(mirror(t)) = size(t) ok 52 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 53 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 54 - ... reverse(inorder(mirror(t))) = inorder(t) ok 55 - ... size(t) <= 2 ** height(t) - 1 ok 56 - ... length(preorder(t)) = size(t) ok 57 - ... mirror(mirror(t)) = t ok 58 - ... size(mirror(t)) = size(t) ok 59 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 60 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 61 - ... reverse(inorder(mirror(t))) = inorder(t) ok 62 - ... size(t) <= 2 ** height(t) - 1 ok 63 - ... length(preorder(t)) = size(t) ok 64 - ... mirror(mirror(t)) = t ok 65 - ... size(mirror(t)) = size(t) ok 66 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 67 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 68 - ... reverse(inorder(mirror(t))) = inorder(t) ok 69 - ... size(t) <= 2 ** height(t) - 1 ok 70 - ... length(preorder(t)) = size(t) ok 71 - ... mirror(mirror(t)) = t ok 72 - ... size(mirror(t)) = size(t) ok 73 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 74 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 75 - ... reverse(inorder(mirror(t))) = inorder(t) ok 76 - ... size(t) <= 2 ** height(t) - 1 ok 77 - ... length(preorder(t)) = size(t) ok 78 - ... mirror(mirror(t)) = t ok 79 - ... size(mirror(t)) = size(t) ok 80 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 81 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 82 - ... reverse(inorder(mirror(t))) = inorder(t) ok 83 - ... size(t) <= 2 ** height(t) - 1 ok 84 - ... length(preorder(t)) = size(t) ok 85 - ... mirror(mirror(t)) = t ok 86 - ... size(mirror(t)) = size(t) ok 87 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 88 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 89 - ... reverse(inorder(mirror(t))) = inorder(t) ok 90 - ... size(t) <= 2 ** height(t) - 1 ok 91 - ... length(preorder(t)) = size(t) ok 92 - ... mirror(mirror(t)) = t ok 93 - ... size(mirror(t)) = size(t) ok 94 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 95 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 96 - ... reverse(inorder(mirror(t))) = inorder(t) ok 97 - ... size(t) <= 2 ** height(t) - 1 ok 98 - ... length(preorder(t)) = size(t) ok 99 - ... mirror(mirror(t)) = t ok 100 - ... size(mirror(t)) = size(t) ok 101 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 102 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 103 - ... reverse(inorder(mirror(t))) = inorder(t) ok 104 - ... size(t) <= 2 ** height(t) - 1 ok 105 - ... length(preorder(t)) = size(t) ok 106 - ... mirror(mirror(t)) = t ok 107 - ... size(mirror(t)) = size(t) ok 108 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 109 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 110 - ... reverse(inorder(mirror(t))) = inorder(t) ok 111 - ... size(t) <= 2 ** height(t) - 1 ok 112 - ... length(preorder(t)) = size(t) ok 113 - ... mirror(mirror(t)) = t ok 114 - ... size(mirror(t)) = size(t) ok 115 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 116 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 117 - ... reverse(inorder(mirror(t))) = inorder(t) ok 118 - ... size(t) <= 2 ** height(t) - 1 ok 119 - ... length(preorder(t)) = size(t) ok 120 - ... mirror(mirror(t)) = t ok 121 - ... size(mirror(t)) = size(t) ok 122 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 123 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 124 - ... reverse(inorder(mirror(t))) = inorder(t) ok 125 - ... size(t) <= 2 ** height(t) - 1 ok 126 - ... length(preorder(t)) = size(t) ok 127 - ... mirror(mirror(t)) = t ok 128 - ... size(mirror(t)) = size(t) ok 129 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 130 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 131 - ... reverse(inorder(mirror(t))) = inorder(t) ok 132 - ... size(t) <= 2 ** height(t) - 1 ok 133 - ... length(preorder(t)) = size(t) ok 134 - ... mirror(mirror(t)) = t ok 135 - ... size(mirror(t)) = size(t) ok 136 - ... postorder(mirror(t)) = reverse(preorder(t)) ok 137 - ... inorder(mirror(t)) = reverse(inorder(t)) ok 138 - ... reverse(inorder(mirror(t))) = inorder(t) ok 139 - ... size(t) <= 2 ** height(t) - 1 ok 140 - ... length(preorder(t)) = size(t) ok t/pod......................................1..9 ok 1 - blib\lib\Tree\Binary.pm ok 2 - blib\lib\Tree\Binary\Search.pm ok 3 - blib\lib\Tree\Binary\VisitorFactory.pm ok 4 - blib\lib\Tree\Binary\Search\Node.pm ok 5 - blib\lib\Tree\Binary\Visitor\Base.pm ok 6 - blib\lib\Tree\Binary\Visitor\BreadthFirstTraversal.pm ok 7 - blib\lib\Tree\Binary\Visitor\InOrderTraversal.pm ok 8 - blib\lib\Tree\Binary\Visitor\PostOrderTraversal.pm ok 9 - blib\lib\Tree\Binary\Visitor\PreOrderTraversal.pm ok t/pod_coverage.............................1..0 # Skip Test::Pod::Coverage 1.04 required for testing POD coverage skipped all skipped: Test::Pod::Coverage 1.04 required for testing POD coverage All tests successful, 2 tests skipped. Files=14, Tests=494, 4 wallclock secs ( 0.00 cusr + 0.00 csys = 0.00 CPU) Microsoft (R) Program Maintenance Utility Version 7.10.3077 Copyright (C) Microsoft Corporation. All rights reserved. Installing C:\cpanrun\build\5-10-0\html\site\lib\Tree\Binary.html Installing C:\cpanrun\build\5-10-0\html\site\lib\Tree\Binary\Search.html Installing C:\cpanrun\build\5-10-0\html\site\lib\Tree\Binary\VisitorFactory.html Installing C:\cpanrun\build\5-10-0\html\site\lib\Tree\Binary\Search\Node.html Installing C:\cpanrun\build\5-10-0\html\site\lib\Tree\Binary\Visitor\Base.html Installing C:\cpanrun\build\5-10-0\html\site\lib\Tree\Binary\Visitor\BreadthFirstTraversal.html Installing C:\cpanrun\build\5-10-0\html\site\lib\Tree\Binary\Visitor\InOrderTraversal.html Installing C:\cpanrun\build\5-10-0\html\site\lib\Tree\Binary\Visitor\PostOrderTraversal.html Installing C:\cpanrun\build\5-10-0\html\site\lib\Tree\Binary\Visitor\PreOrderTraversal.html Installing C:\cpanrun\build\5-10-0\site\lib\Tree\Binary.pm Installing C:\cpanrun\build\5-10-0\site\lib\Tree\Binary\Search.pm Installing C:\cpanrun\build\5-10-0\site\lib\Tree\Binary\VisitorFactory.pm Installing C:\cpanrun\build\5-10-0\site\lib\Tree\Binary\Search\Node.pm Installing C:\cpanrun\build\5-10-0\site\lib\Tree\Binary\Visitor\Base.pm Installing C:\cpanrun\build\5-10-0\site\lib\Tree\Binary\Visitor\BreadthFirstTraversal.pm Installing C:\cpanrun\build\5-10-0\site\lib\Tree\Binary\Visitor\InOrderTraversal.pm Installing C:\cpanrun\build\5-10-0\site\lib\Tree\Binary\Visitor\PostOrderTraversal.pm Installing C:\cpanrun\build\5-10-0\site\lib\Tree\Binary\Visitor\PreOrderTraversal.pm Appending installation info to C:\cpanrun\build\5-10-0\lib/perllocal.pod