Checking if your kit is complete...
Looks good
Writing Makefile for Tree::Simple
cp lib/Tree/Simple.pm blib/lib/Tree/Simple.pm
cp lib/Tree/Simple/Visitor.pm blib/lib/Tree/Simple/Visitor.pm
Manifying blib/man3/Tree::Simple::Visitor.3
Manifying blib/man3/Tree::Simple.3
PERL_DL_NONLAZY=1 /Users/cpanrun/build/5.10.0/bin/perl "-MExtUtils::Command::MM" "-e" "test_harness(1, 'blib/lib', 'blib/arch')" t/*.t
t/10_Tree_Simple_test...............1..292
ok 1 - use Tree::Simple;
ok 2 - Tree::Simple->can('new')
ok 3 - Tree::Simple->can('ROOT')
ok 4 - The object isa Tree::Simple
ok 5 - Tree::Simple->can('_init')
ok 6 - Tree::Simple->can('_setParent')
ok 7 - Tree::Simple->can('isRoot')
ok 8 - Tree::Simple->can('isLeaf')
ok 9 - Tree::Simple->can('setNodeValue')
ok 10 - Tree::Simple->can('getNodeValue')
ok 11 - Tree::Simple->can('getDepth')
ok 12 - Tree::Simple->can('fixDepth')
ok 13 - Tree::Simple->can('getParent')
ok 14 - Tree::Simple->can('getChildCount')
ok 15 - Tree::Simple->can('addChild')
ok 16 - Tree::Simple->can('addChildren')
ok 17 - Tree::Simple->can('insertChild')
ok 18 - Tree::Simple->can('insertChildren')
ok 19 - Tree::Simple->can('removeChildAt')
ok 20 - Tree::Simple->can('removeChild')
ok 21 - Tree::Simple->can('getChild')
ok 22 - Tree::Simple->can('getAllChildren')
ok 23 - Tree::Simple->can('addSibling')
ok 24 - Tree::Simple->can('addSiblings')
ok 25 - Tree::Simple->can('insertSibling')
ok 26 - Tree::Simple->can('insertSiblings')
ok 27 - Tree::Simple->can('getSibling')
ok 28 - Tree::Simple->can('getAllSiblings')
ok 29 - Tree::Simple->can('traverse')
ok 30 - Tree::Simple->can('accept')
ok 31 - Tree::Simple->can('clone')
ok 32 - Tree::Simple->can('cloneShallow')
ok 33 - Tree::Simple->can('DESTROY')
ok 34
ok 35
ok 36 - ... this tree is a root
ok 37 - ... we have no children yet
ok 38 - ... we have no depth yet
ok 39 - ... root trees have no index
ok 40 - Tree::Simple->can('getUID')
ok 41 - ... UIDs match for the same object
ok 42 - ... our UID is derived from our hex address
ok 43 - Tree::Simple->can('setUID')
ok 44 - ... UIDs match what we have set it to
ok 45 - ... our UID is no longer derived from our hex address
ok 46 - The object isa Tree::Simple
ok 47 - ... this tree is 1.0
ok 48
ok 49
ok 50
ok 51
ok 52 - ... depth should be 0 now
ok 53 - ... index should be 0 now
ok 54 - ... we should have 1 children now
ok 55 - ... make sure our sub_tree is fetchable
ok 56 - ... make sure our sub_tree parent is tree
ok 57 - The object isa Tree::Simple
ok 58 - ... this tree is 2.0
ok 59
ok 60
ok 61
ok 62 - ... depth should be 0 now
ok 63 - ... index should be 1
ok 64 - ... we should have 2 children now
ok 65 - ... make sure our sub_tree is fetchable
ok 66 - ... make sure our sub_tree_2 parent is tree
ok 67 - ... this tree is 4.0
ok 68
ok 69 - ... depth should be 0 now
ok 70 - ... index should be 2 now
ok 71
ok 72 - ... we should have 3 children now
ok 73 - ... make sure our sub_tree is fetchable
ok 74 - ... make sure our sub_tree_4 parent is tree
ok 75 - ... this tree is 3.0
ok 76
ok 77
ok 78
ok 79 - ... depth should be 0 now
ok 80 - ... index should be 2 now
ok 81 - ... index should be 3 now
ok 82 - ... we should have 4 children now
ok 83 - ... make sure our sub_tree is fetchable
ok 84 - ... make sure our sub_tree is fetchable
ok 85 - ... make sure our sub_tree_3 parent is tree
ok 86
ok 87
ok 88
ok 89
ok 90
ok 91
ok 92
ok 93
ok 94
ok 95
ok 96
ok 97
ok 98
ok 99 - ... they at least have "1." followed by a digit
ok 100 - ... depth should be -1
ok 101
ok 102
ok 103 - ... they at least have "1." followed by a digit
ok 104 - ... depth should be -1
ok 105
ok 106
ok 107 - ... they at least have "1." followed by a digit
ok 108 - ... depth should be -1
ok 109
ok 110 - ... we should have 3 children now
ok 111
ok 112
ok 113
ok 114 - ... their parent is the sub_tree
ok 115 - ... depth should be 1
ok 116
ok 117
ok 118
ok 119 - ... their parent is the sub_tree
ok 120 - ... depth should be 1
ok 121
ok 122
ok 123
ok 124 - ... their parent is the sub_tree
ok 125 - ... depth should be 1
ok 126
ok 127
ok 128
ok 129 - ... they at least have "1." followed by a digit
ok 130 - ... depth should be -1
ok 131
ok 132
ok 133 - ... they at least have "1." followed by a digit
ok 134 - ... depth should be -1
ok 135
ok 136
ok 137 - ... they at least have "1." followed by a digit
ok 138 - ... depth should be -1
ok 139 - ... we should have 6 children now
ok 140
ok 141
ok 142
ok 143 - ... their parent is the sub_tree
ok 144 - ... depth should be 1
ok 145
ok 146
ok 147
ok 148 - ... their parent is the sub_tree
ok 149 - ... depth should be 1
ok 150
ok 151
ok 152
ok 153 - ... their parent is the sub_tree
ok 154 - ... depth should be 1
ok 155
ok 156
ok 157
ok 158 - ... they at least have digit followed by ".0"
ok 159 - ... depth should be -1
ok 160
ok 161
ok 162 - ... they at least have digit followed by ".0"
ok 163 - ... depth should be -1
ok 164 - ... we should have 6 children now
ok 165 - ... they are the same
ok 166 - ... they are the same
ok 167
ok 168
ok 169 - ... their parent is the tree
ok 170 - ... depth should be 0
ok 171
ok 172
ok 173
ok 174 - ... their parent is the tree
ok 175 - ... depth should be 0
ok 176
ok 177
ok 178
ok 179 - ... node value should be 6.0
ok 180 - ... depth should be -1
ok 181 - ... we should have 7 children now
ok 182 - ... they are the same
ok 183 - ... they are the same
ok 184 - ... they are the same
ok 185
ok 186
ok 187 - ... their parent is the tree
ok 188 - ... depth should be 0
ok 189
ok 190
ok 191
ok 192 - ... they at least have digit followed by ".0"
ok 193 - ... depth should be -1
ok 194
ok 195
ok 196 - ... they at least have digit followed by ".0"
ok 197 - ... depth should be -1
ok 198 - ... we should have 6 children now
ok 199 - ... they are the same
ok 200 - ... they are the same
ok 201 - ... they are the same
ok 202 - ... they are the same
ok 203 - ... they are the same
ok 204
ok 205
ok 206 - ... their parent is the tree
ok 207 - ... depth should be 0
ok 208
ok 209
ok 210
ok 211 - ... their parent is the tree
ok 212 - ... depth should be 0
ok 213
ok 214 - ... siblings are the same as children
ok 215 - ... siblings are the same as children
ok 216 - ... siblings are the same as children
ok 217 - ... siblings are the same as children
ok 218 - ... siblings are the same as children
ok 219 - ... siblings are the same as children
ok 220 - ... siblings are the same as children
ok 221 - ... siblings are the same as children
ok 222 - ... siblings are the same as children
ok 223 - ... siblings are the same as children
ok 224 - The object isa Tree::Simple
ok 225
ok 226
ok 227 - ... should be the same
ok 228 - ... we should have 1 child here
ok 229 - ... we should have 2 children here
ok 230
ok 231
ok 232 - ... their parent is the tree
ok 233 - ... depth should be 0
ok 234
ok 235
ok 236
ok 237 - ... their parent is the tree
ok 238 - ... depth should be 0
ok 239
ok 240 - The object isa Tree::Simple
ok 241
ok 242
ok 243 - ... should be the same
ok 244 - ... we should have 1 child here
ok 245 - ... we should have 1 child here
ok 246
ok 247
ok 248 - ... their parent is the tree
ok 249 - ... depth should be 0
ok 250
ok 251
ok 252 - ... the depth should be -1
ok 253 - ... the depth should be 0
ok 254
ok 255 - ... the depth should be 1
ok 256 - ... the depth should be 2
ok 257 - ... these tree should be equal
ok 258 - ... these tree should be equal
ok 259
ok 260 - ... the depth should be -1
ok 261 - ... the depth should be 0
ok 262
ok 263 - ... the depth should be -1
ok 264 - ... the depth should be 0
ok 265
ok 266 - ... the depth should be 1
ok 267 - ... the depth should be 2
ok 268 - ... these tree should be equal
ok 269 - ... these tree should be equal
ok 270
ok 271 - ... the depth should be -1
ok 272 - ... the depth should be 0
ok 273
ok 274 - ... the depth should be -1
ok 275
ok 276 - ... the depth should be 1
ok 277 - ... these tree should be equal
ok 278 - ... these tree should be equal
ok 279
ok 280 - ... the depth should be -1
ok 281 - ... these tree should be equal
ok 282 - ... these tree should be equal
ok 283 - ... these tree should be equal
ok 284 - ... these tree should be equal
ok 285 - ... our nodes match our control nodes
ok 286 - ... our nodes match our control nodes for post traverse method
ok 287 - ... our size is as we expect it to be
ok 288 - ... our height is as we expect it to be
ok 289
ok 290
ok 291
ok 292
ok
t/11_Tree_Simple_fixDepth_test......1..46
ok 1 - ... our tree is a root
ok 2 - ... and it is not a leaf
ok 3 - ... our depth should be -1
ok 4 - ... we have 3 children
ok 5 - ... our subtree is not a root
ok 6 - ... however it is a leaf
ok 7 - ... these should both be equal
ok 8 - ... our depth should be 0
ok 9 - ... our siblings are the same
ok 10 - ... our subtree is not a root
ok 11 - ... however it is a leaf
ok 12 - ... these should both be equal
ok 13 - ... our depth should be 0
ok 14 - ... our siblings are the same
ok 15 - ... our subtree is not a root
ok 16 - ... however it is a leaf
ok 17 - ... these should both be equal
ok 18 - ... our depth should be 0
ok 19 - ... our siblings are the same
ok 20 - ... our parent tree is a root
ok 21 - ... our parent tree is a leaf
ok 22 - ... our depth should be -1
ok 23 - ... we have 2 children
ok 24 - ... the sub tree is not a root
ok 25 - ... but it is a leaf
ok 26 - ... these should both be equal
ok 27 - ... our depth should be 0
ok 28 - ... the siblings are the same as the children
ok 29 - ... the sub tree is not a root
ok 30 - ... but it is a leaf
ok 31 - ... these should both be equal
ok 32 - ... our depth should be 0
ok 33 - ... the siblings are the same as the children
ok 34 - ... our tree is not longer a root
ok 35 - ... our depth should be 1
ok 36 - ... these should both be equal
ok 37 - ... our depth should be 2
ok 38 - ... our depth should be 2
ok 39 - ... our depth should be 2
ok 40 - ... we got the same tree
ok 41 - ... our tree is a root again
ok 42 - ... and it is not a leaf
ok 43 - ... our depth should be corrected to be -1
ok 44 - ... our depth should be corrected to be 0
ok 45 - ... our depth should be corrected to be 0
ok 46 - ... our depth should be corrected to be 0
ok
t/12_Tree_Simple_exceptions_test....1..52
ok 1 - ... this should die
ok 2 - ... this should die
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 - ... these should be the same
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 40 - ... this should die
ok 41 - ... this should die
ok 42 - ... this should die
ok 43 - ... this should die
ok 44 - ... this should die
ok 45 - ... this should die
ok 46 - ... this should die
ok 47 - ... but, this should live
ok 48 - ... this should croak
ok 49 - ... this should croak
ok 50 - ... this should croak
ok 51 - ... this should croak
ok 52 - ... this should croak
ok
t/13_Tree_Simple_clone_test.........1..48
ok 1 - The object isa Tree::Simple
ok 2 - The object isa Tree::Simple
ok 3 - ... the clones parent is a root
ok 4 - ... the clones childrens parent should be our clone
ok 5 - ... the clones childrens parent should be our clone
ok 6 - ... the clones childrens parent should be our clone
ok 7 - ... the clones childrens parent should be our clone
ok 8 - ... the clones childrens parent should be our clone
ok 9 - ... the clones childrens parent should be our clone
ok 10 - ... the clones childrens parent should be our clone
ok 11 - ... the clones childrens parent should be our clone
ok 12 - ... the clones childrens parent should be our clone
ok 13 - ... these should be refs
ok 14 - ... these should be the same value
ok 15 - ... these should be scalar refs
ok 16 - ... these should be scalar refs
ok 17 - ... these should be different scalar refs
ok 18 - ... these should be the same value
ok 19 - ... these should be array refs
ok 20 - ... these should be array refs
ok 21 - ... these should be different array refs
ok 22 - ... these should have the same contents
ok 23 - ... these should be hash refs
ok 24 - ... these should be hash refs
ok 25 - ... these should be different hash refs
ok 26 - ... these should have the same contents
ok 27 - ... these should be code refs
ok 28 - ... these should be code refs
ok 29 - ... these should be the same code refs
ok 30 - ... this is equal
ok 31 - ... these should be reg-ex refs
ok 32 - ... these should be reg-ex refs
ok 33 - ... these should be the same reg-ex refs
ok 34 - ... these should be misc object refs
ok 35 - ... these should be misc object refs
ok 36 - ... these should be the same misc object refs
ok 37 - ... these should be Tree::Simple
ok 38 - ... these should be Tree::Simple
ok 39 - ... these should be different Tree::Simple objects
ok 40 - ... these should have the same contents
ok 41 - ... these should be refs of refs
ok 42 - ... these should be refs of refs
ok 43 - ... these should be different scalar refs
ok 44 - ... these should be the same value
ok 45 - ... these should be refs
ok 46 - ... the children are the same
ok 47 - ... these should be different Tree::Simple objects
ok 48 - ... these should have the same contents
ok
t/14_Tree_Simple_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/14a_Tree_Simple_weak_refs_test....1..0 # Skip Test::Memory::Cycle required for testing memory leaks
skipped
        all skipped: Test::Memory::Cycle required for testing memory leaks
t/15_Tree_Simple_height_test........1..67
ok 1 - use Tree::Simple;
ok 2 - The object isa Tree::Simple
ok 3 - The object isa Tree::Simple
ok 4 - ... D has a height of 1
ok 5 - The object isa Tree::Simple
ok 6 - ... D has a height of 2
ok 7 - ... E has a height of 1
ok 8 - The object isa Tree::Simple
ok 9 - ... D has a height of 3
ok 10 - ... E has a height of 2
ok 11 - ... F has a height of 1
ok 12 - The object isa Tree::Simple
ok 13 - ... D has a height of 3
ok 14 - ... E has a height of 2
ok 15 - ... F has a height of 1
ok 16 - ... C has a height of 1
ok 17 - The object isa Tree::Simple
ok 18 - ... D has a height of 3
ok 19 - ... E has a height of 2
ok 20 - ... F has a height of 1
ok 21 - ... C has a height of 2
ok 22 - ... B has a height of 1
ok 23 - The object isa Tree::Simple
ok 24 - ... D has a height of 4
ok 25 - ... E has a height of 2
ok 26 - ... F has a height of 1
ok 27 - ... C has a height of 3
ok 28 - ... B has a height of 2
ok 29 - ... A has a height of 1
ok 30 - The object isa Tree::Simple
ok 31 - ... D has a height of 4
ok 32 - ... E has a height of 2
ok 33 - ... F has a height of 1
ok 34 - ... G has a height of 1
ok 35 - ... C has a height of 3
ok 36 - ... B has a height of 2
ok 37 - ... A has a height of 1
ok 38 - The object isa Tree::Simple
ok 39 - ... D has a height of 4
ok 40 - ... E has a height of 3
ok 41 - ... F has a height of 1
ok 42 - ... G has a height of 2
ok 43 - ... H has a height of 1
ok 44 - ... C has a height of 3
ok 45 - ... B has a height of 2
ok 46 - ... A has a height of 1
ok 47 - ... removed A subtree from B tree
ok 48 - ... D has a height of 4
ok 49 - ... E has a height of 3
ok 50 - ... F has a height of 1
ok 51 - ... G has a height of 2
ok 52 - ... H has a height of 1
ok 53 - ... C has a height of 2
ok 54 - ... B has a height of 1
ok 55 - ... A has a height of 1
ok 56 - ... removed E subtree from D tree
ok 57 - ... D has a height of 3
ok 58 - ... C has a height of 2
ok 59 - ... B has a height of 1
ok 60 - ... E has a height of 3
ok 61 - ... F has a height of 1
ok 62 - ... G has a height of 2
ok 63 - ... H has a height of 1
ok 64 - ... removed C subtree from D tree
ok 65 - ... D has a height of 1
ok 66 - ... C has a height of 2
ok 67 - ... B has a height of 1
ok
t/16_Tree_Simple_width_test.........1..77
ok 1 - use Tree::Simple;
ok 2 - The object isa Tree::Simple
ok 3 - The object isa Tree::Simple
ok 4 - ... D has a width of 1
ok 5 - The object isa Tree::Simple
ok 6 - ... D has a width of 1
ok 7 - ... E has a width of 1
ok 8 - The object isa Tree::Simple
ok 9 - ... D has a width of 1
ok 10 - ... E has a width of 1
ok 11 - ... F has a width of 1
ok 12 - The object isa Tree::Simple
ok 13 - ... D has a width of 2
ok 14 - ... E has a width of 1
ok 15 - ... F has a width of 1
ok 16 - ... C has a width of 1
ok 17 - The object isa Tree::Simple
ok 18 - ... D has a width of 3
ok 19 - ... E has a width of 1
ok 20 - ... F has a width of 1
ok 21 - ... C has a width of 1
ok 22 - ... B has a width of 1
ok 23 - The object isa Tree::Simple
ok 24 - ... D has a width of 4
ok 25 - ... E has a width of 2
ok 26 - ... F has a width of 1
ok 27 - ... C has a width of 1
ok 28 - ... B has a width of 1
ok 29 - ... A has a width of 1
ok 30 - The object isa Tree::Simple
ok 31 - ... D has a width of 5
ok 32 - ... E has a width of 3
ok 33 - ... F has a width of 1
ok 34 - ... G has a width of 1
ok 35 - ... C has a width of 1
ok 36 - ... B has a width of 1
ok 37 - ... A has a width of 1
ok 38 - The object isa Tree::Simple
ok 39 - ... D has a width of 5
ok 40 - ... E has a width of 3
ok 41 - ... F has a width of 1
ok 42 - ... G has a width of 1
ok 43 - ... H has a width of 1
ok 44 - ... C has a width of 1
ok 45 - ... B has a width of 1
ok 46 - ... A has a width of 1
ok 47 - The object isa Tree::Simple
ok 48 - ... D has a width of 6
ok 49 - ... E has a width of 4
ok 50 - ... F has a width of 1
ok 51 - ... G has a width of 2
ok 52 - ... H has a width of 1
ok 53 - ... I has a width of 1
ok 54 - ... C has a width of 1
ok 55 - ... B has a width of 1
ok 56 - ... A has a width of 1
ok 57 - ... removed A subtree from B tree
ok 58 - ... D has a width of 5
ok 59 - ... E has a width of 3
ok 60 - ... F has a width of 1
ok 61 - ... G has a width of 2
ok 62 - ... H has a width of 1
ok 63 - ... C has a width of 2
ok 64 - ... B has a width of 1
ok 65 - ... A has a width of 1
ok 66 - ... removed E subtree from D tree
ok 67 - ... D has a width of 2
ok 68 - ... C has a width of 1
ok 69 - ... B has a width of 1
ok 70 - ... E has a width of 3
ok 71 - ... F has a width of 1
ok 72 - ... G has a width of 2
ok 73 - ... H has a width of 1
ok 74 - ... removed C subtree from D tree
ok 75 - ... D has a width of 1
ok 76 - ... B has a width of 1
ok 77 - ... C has a width of 1
ok
t/20_Tree_Simple_Visitor_test.......1..37
ok 1 - use Tree::Simple::Visitor;
ok 2 - Tree::Simple::Visitor->can('new')
ok 3 - The object isa Tree::Simple::Visitor
ok 4 - The object isa Tree::Simple
ok 5 - Tree::Simple::Visitor->can('getResults')
ok 6 - ... got what we expected
ok 7 - Tree::Simple::Visitor->can('setNodeFilter')
ok 8 - Tree::Simple::Visitor->can('getNodeFilter')
ok 9 - ... got back what we put in
ok 10 - ... got what we expected
ok 11 - ... this should die
ok 12 - ... this should die
ok 13 - Tree::Simple::Visitor->can('RECURSIVE')
ok 14 - Tree::Simple::Visitor->can('CHILDREN_ONLY')
ok 15 - The object isa Tree::Simple::Visitor
ok 16 - The object isa Tree::Simple::Visitor
ok 17 - The object isa Tree::Simple::Visitor
ok 18 - ... we are expecting this error
ok 19 - ... we are expecting this error
ok 20 - ... we are expecting this error
ok 21 - ... we are expecting this error
ok 22 - Tree::Simple::Visitor->can('visit')
ok 23 - ... we are expecting this error
ok 24 - ... we are expecting this error
ok 25 - ... we are expecting this error
ok 26 - ... we are expecting this error
ok 27 - The object isa Tree::Simple
ok 28 - ... there are 3 children here
ok 29 - .. this passes fine
ok 30 - .. this passes fine
ok 31 - .. this passes fine
ok 32 - ... this should be false right now
ok 33 - ... this should be true now
ok 34 - ... this should be true still
ok 35 - ... this should be false again
ok 36 - our node filter is set correctly
ok 37 - ... our node filter has now been undefined
ok
t/pod...............................1..2
ok 1 - blib/lib/Tree/Simple.pm
ok 2 - blib/lib/Tree/Simple/Visitor.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, 3 tests skipped.
Files=11, Tests=621,  1 wallclock secs ( 1.15 cusr +  0.25 csys =  1.40 CPU)
make: *** [htmlifypods] Hangup