Checking if your kit is complete... Looks good Writing Makefile for Tree::RB Microsoft (R) Program Maintenance Utility Version 7.10.3077 Copyright (C) Microsoft Corporation. All rights reserved. cp lib/Tree/RB/Node/_Constants.pm blib\lib\Tree\RB\Node\_Constants.pm cp lib/Tree/RB/Node.pm blib\lib\Tree\RB\Node.pm cp lib/Tree/RB.pm blib\lib\Tree\RB.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/00.load..............1..3 ok 1 - use Tree::RB; ok 2 - use Tree::RB::Node; ok 3 - use Tree::RB::Node::_Constants; ok t/01.node..............1..27 # Testing Tree::RB::Node 0.1 ok 1 - use Tree::RB::Node; ok 2 - Tree::RB::Node->can('new') ok 3 - Tree::RB::Node->can('key') ok 4 - Tree::RB::Node->can('val') ok 5 - Tree::RB::Node->can('color') ok 6 - Tree::RB::Node->can('parent') ok 7 - Tree::RB::Node->can('left') ok 8 - Tree::RB::Node->can('right') ok 9 - Tree::RB::Node->can('min') ok 10 - Tree::RB::Node->can('max') ok 11 - Tree::RB::Node->can('successor') ok 12 - Tree::RB::Node->can('predecessor') ok 13 - The object isa Tree::RB::Node ok 14 - key retrieved after new ok 15 - value retrieved after new ok 16 - key retrieved after set ok 17 - value retrieved after set ok 18 - color retrieved after set ok 19 - left retrieved after set ok 20 - right retrieved after set ok 21 - parent retrieved after set ok 22 - min ok 23 - max ok 24 - successor ok 25 - predecessor ok 26 - leaf ok 27 - strip ok t/01.node_constants....1..9 # Testing Tree::RB::Node::_Constants 0.1 ok 1 - use Tree::RB::Node::_Constants; ok 2 - Tree::RB::Node::_Constants->can('_PARENT') ok 3 - Tree::RB::Node::_Constants->can('_LEFT') ok 4 - Tree::RB::Node::_Constants->can('_RIGHT') ok 5 - Tree::RB::Node::_Constants->can('_COLOR') ok 6 - Tree::RB::Node::_Constants->can('_KEY') ok 7 - Tree::RB::Node::_Constants->can('_VAL') ok 8 - Tree::RB::Node::_Constants->can('BLACK') ok 9 - Tree::RB::Node::_Constants->can('RED') ok t/02.tree..............1..29 # Testing Tree::RB 0.1 ok 1 - use Tree::RB; ok 2 - Tree::RB->can('new') ok 3 - Tree::RB->can('put') ok 4 - Tree::RB->can('iter') ok 5 - Tree::RB->can('rev_iter') ok 6 - Tree::RB->can('size') ok 7 - The object isa Tree::RB ok 8 - New tree has size zero ok 9 - size check after inserts ok 10 - min ok 11 - max ok 12 - The object isa Tree::RB::Iterator ok 13 - Tree::RB::Iterator->can('next') ok 14 - iterator check ok 15 - iterator check ok 16 - iterator check ok 17 - iterator check ok 18 - iterator check ok 19 - iterator check ok 20 - iterator check - no more items ok 21 - The object isa Tree::RB::Iterator ok 22 - Tree::RB::Iterator->can('next') ok 23 - iterator check ok 24 - iterator check ok 25 - iterator check ok 26 - iterator check ok 27 - iterator check ok 28 - iterator check ok 29 - iterator check - no more items ok t/03.delete............1..7 # Testing deletion in Tree::RB 0.1 ok 1 - size goes down by one on removing a node ok 2 - lookup deleted node ok 3 - lookup deleted node's value ok 4 - new min after deleting current min ok 5 - max not changed after deleting current min ok 6 - new max after deleting current max ok 7 - min not changed after deleting current max ok t/04.lookup............1..9 # Testing lookup in Tree::RB 0.1 ok 1 - lookup ok 2 - lookup LUGTEQ: left ok 3 - lookup LUGTEQ: right ok 4 - lookup LULTEQ: node exists ok 5 - lookup LULTEQ: no lt node ok 6 - lookup LULTEQ: right ok 7 - lookup LULTEQ: left ok 8 - lookup LUGREAT: left ok 9 - lookup LUGREAT: right ok t/06.tie...............1..24 # Testing tied hash interface in Tree::RB 0.1 ok 1 - The object isa Tree::RB ok 2 - Empty hash - no keys ok 3 - exists on empty hash ok 4 - exists after insert ok 5 - STORE and FETCH work ok 6 - Size check after deleting sole element ok 7 - The object isa Tree::RB::Node ok 8 - check deleted node ok 9 - Size check (keys) after inserts ok 10 - Size check (scalar) after inserts ok 11 - check keys list ok 12 - check values list ok 13 - each check ok 14 - each check ok 15 - each check ok 16 - each check ok 17 - each check ok 18 - each check ok 19 - each check - no more keys ok 20 - no keys after clearing hash ok 21 - size zero after clearing hash ok 22 - underlying array is empty after untie ok 23 - The object isa Tree::RB ok 24 - check keys list (reverse sort) ok All tests successful. Files=7, Tests=108, 1 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\RB.html Installing C:\cpanrun\build\5-10-0\html\site\lib\Tree\RB\Node.html Installing C:\cpanrun\build\5-10-0\html\site\lib\Tree\RB\Node\_Constants.html Installing C:\cpanrun\build\5-10-0\site\lib\Tree\RB.pm Installing C:\cpanrun\build\5-10-0\site\lib\Tree\RB\Node.pm Installing C:\cpanrun\build\5-10-0\site\lib\Tree\RB\Node\_Constants.pm Appending installation info to C:\cpanrun\build\5-10-0\lib/perllocal.pod