Microsoft (R) Program Maintenance Utility   Version 6.00.8168.0
Copyright (C) Microsoft Corp 1988-1998. All rights reserved.

Files found in blib\arch: installing files in blib\lib into architecture dependent library tree
Installing C:\cpanrun-5.8\build\5-8-0\site\lib\auto\Devel\Size\Size.bs
Installing C:\cpanrun-5.8\build\5-8-0\site\lib\auto\Devel\Size\Size.dll
Installing C:\cpanrun-5.8\build\5-8-0\site\lib\auto\Devel\Size\Size.exp
Installing C:\cpanrun-5.8\build\5-8-0\site\lib\auto\Devel\Size\Size.lib
Installing C:\cpanrun-5.8\build\5-8-0\site\lib\auto\Devel\Size\Size.pdb
Installing C:\cpanrun-5.8\build\5-8-0\site\lib\Devel\Size.pm
Writing C:\cpanrun-5.8\build\5-8-0\site\lib\auto\Devel\Size\.packlist
Appending installation info to C:\cpanrun-5.8\build\5-8-0\lib/perllocal.pod
k
t/recurse....1..54
ok 1 - use Devel::Size;
ok 2 - Devel::Size->can(...)
ok 3 - VERSION MATCHES
ok 4 - 4 pointers are dividable by 4
ok 5 - 4 pointers are not zero
ok 6
ok 7 - element < hash with one element
ok 8 - PVNV + [] > [] alone
ok 9 - [] vs. []
ok 10 - properly recurses into PVNV
ok 11 - properly recurses into PVNV
ok 12 - hash element vs. array
ok 13 - [0..size] vs PVNV
ok 14 - [0..size] vs. PVNV
# full_hash = 343
# hash_size = 115
# array size: 136
# element size: 228
# ref_size = 16
# pvnv_size: 96
ok 15 - properly recurses into PVNV
# full_hash = 383
# hash_size = 115
# array size: 168
# element size: 268
# ref_size = 16
# pvnv_size: 96
ok 16 - properly recurses into PVNV
ok 17 - computed right size if full array
# full_hash = 371
# hash_size = 115
# array size: 156
# element size: 256
# ref_size = 16
# pvnv_size: 96
ok 18 - properly handles undef/non-undef inside arrays
ok 19 - element < hash with one element
ok 20 - PVNV + [] > [] alone
ok 21 - [] vs. []
ok 22 - properly recurses into PVNV
ok 23 - properly recurses into PVNV
ok 24 - hash element vs. array
ok 25 - [0..size] vs PVNV
ok 26 - [0..size] vs. PVNV
# full_hash = 367
# hash_size = 115
# array size: 156
# element size: 252
# ref_size = 16
# pvnv_size: 96
ok 27 - properly recurses into PVNV
# full_hash = 407
# hash_size = 115
# array size: 188
# element size: 292
# ref_size = 16
# pvnv_size: 96
ok 28 - properly recurses into PVNV
ok 29 - computed right size if full array
# full_hash = 395
# hash_size = 115
# array size: 176
# element size: 280
# ref_size = 16
# pvnv_size: 96
ok 30 - properly handles undef/non-undef inside arrays
ok 31 - element < hash with one element
ok 32 - PVNV + [] > [] alone
ok 33 - [] vs. []
ok 34 - properly recurses into PVNV
ok 35 - properly recurses into PVNV
ok 36 - hash element vs. array
ok 37 - [0..size] vs PVNV
ok 38 - [0..size] vs. PVNV
# full_hash = 463
# hash_size = 115
# array size: 236
# element size: 348
# ref_size = 16
# pvnv_size: 96
ok 39 - properly recurses into PVNV
# full_hash = 503
# hash_size = 115
# array size: 268
# element size: 388
# ref_size = 16
# pvnv_size: 96
ok 40 - properly recurses into PVNV
ok 41 - computed right size if full array
# full_hash = 491
# hash_size = 115
# array size: 256
# element size: 376
# ref_size = 16
# pvnv_size: 96
ok 42 - properly handles undef/non-undef inside arrays
ok 43 - element < hash with one element
ok 44 - PVNV + [] > [] alone
ok 45 - [] vs. []
ok 46 - properly recurses into PVNV
ok 47 - properly recurses into PVNV
ok 48 - hash element vs. array
ok 49 - [0..size] vs PVNV
ok 50 - [0..size] vs. PVNV
# full_hash = 2695
# hash_size = 115
# array size: 2096
# element size: 2580
# ref_size = 16
# pvnv_size: 96
ok 51 - properly recurses into PVNV
# full_hash = 2735
# hash_size = 115
# array size: 2128
# element size: 2620
# ref_size = 16
# pvnv_size: 96
ok 52 - properly recurses into PVNV
ok 53 - computed right size if full array
# full_hash = 2723
# hash_size = 115
# array size: 2116
# element size: 2608
# ref_size = 16
# pvnv_size: 96
ok 54 - properly handles undef/non-undef inside arrays
ok
All tests successful.
Files=4, Tests=69,  1 wallclock secs ( 0.00 cusr +  0.00 csys =  0.00 CPU)