hi Frederic,
I'm testing the Tree-Nary module for CPAN Testers, but the
output from the test suite is confusing. it doesn't follow
the standard ok/not ok convention, so I'm not sure if it's
a PASS or a FAIL. this is the output from 'make test':
depth and max height of root node are OK
node_B is child of root node
node_F is the next child of root node
root height = 1
height of tree is 4
node_G->{children}->{next} == 4
7 leaves
4 internal nodes
11 nodes
node F max height is 3
node G has 4 children
Found node_F
Undefined node found
Found node_J
node(0)->data = C
node(1)->data = D
node(2)->data = E
PASSED.
PASSED.
PASSED.
PASSED.
Check is_ancestor F->G (should be true) :1.
Check is_ancestor G->F (should be false):0.
tstring is ABCDEFGHIJK
tstring is CDEBHIJKGFA
tstring is CBDEAHGIJKF
tstring is ABFCDEGHIJK
tstring is CDEHIJK
tstring is ABFG
tstring is ABFEDCGKJIH
Max height from root node > 100
There are 2049 nodes
before I submit a report, can you please confirm that the
above output means a successful test? and for future releases,
please change your test script to output something more
immediate (the classical ok/not ok report is fine).
PS. I'm testing this on the MSWin32-x86-multi-thread platform,
with perl 5.6.0 and on Windows 2000 Advanced Server...
cheers,
Aldo
__END__
$_=q,just perl,,s, , another ,,s,$, hacker,,print;
