Checking if your kit is complete... Looks good Writing Makefile for Graph::ModularDecomposition Microsoft (R) Program Maintenance Utility Version 7.10.3077 Copyright (C) Microsoft Corporation. All rights reserved. cp ModularDecomposition.pm blib\lib\Graph\ModularDecomposition.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/01..............1..5 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:28 2007 # Current time GMT: Sun Dec 23 00:12:28 2007 # Using Test.pm version 1.25 Turning on Graph::ModularDecomposition debugging, level 1 at t/01.t line 16 ok 1 ok 2 Turning off Graph::ModularDecomposition debugging at t/01.t line 22 ok 3 ok 4 ok 5 ok t/02..............1..57 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:28 2007 # Current time GMT: Sun Dec 23 00:12:28 2007 # Using Test.pm version 1.25 ok 1 ok 2 Turning on Graph::ModularDecomposition debugging, level 3 at t/02.t line 29 aa?0 ab?0 aa?0 ba?0= ab?0ok 3 ac?1 ba?0 ca?0=1 ca?0 cb?0 ac?1 bc?ok 4 0=1 ba?0 bc?0 ab?0 cb?ok 5 0= ok 6 Turning off Graph::ModularDecomposition debugging at t/02.t line 36 ok 7 ok 8 ok 9 ok 10 ok 11 ok 12 ok 13 ok 14 Turning on Graph::ModularDecomposition debugging, level 3 at t/02.t line 51 G([a-c,a-d,b-d], d) =... X=b Y=a ba?0 bd?1 ab?0 db?0=1 Y=c bc?0 bd?1 cb?0 db?0=1 X=a Y=b ab?0 ad?1 ba?0 da?0=1 Y=c ac?1 ad?1 ca?0 da?0= X=c Y=b cb?0 cd?0 bc?0 dc?0= Y=a ca?0 cd?0 ac?1 dc?0=1 ...G()=a-b,b-a,b-c,c-a ok 15 Turning off Graph::ModularDecomposition debugging at t/02.t line 53 ok 16 ok 17 ok 18 Turning on Graph::ModularDecomposition debugging, level 3 at t/02.t line 58 partition# G = a-c,a-d,b-d, v = d setminus# bdac - d = bac partition# @S = bac partition# L{S}[0] = d partition# ZS = d p..n_subsets# @S = bac, w = d p..n_subsets# xw = bd C = b p..n_subsets# xw = ad C = ba p..n_subsets# xw = cd D = c partition# W = ba setminus# bac - ba = c setminus# d - d = setunion# c U = c partition# tempset = c partition# W = c setminus# bac - c = ba setminus# d - d = setunion# ba U = ba partition# tempset = ab partition# ZS = c p..n_subsets# @S = ba, w = c p..n_subsets# xw = bc D = b p..n_subsets# xw = ac C = a partition# W = a setminus# ba - a = b setminus# c - c = setunion# b U = b partition# tempset = b partition# W = b setminus# ba - b = a setminus# c - c = setunion# a U = a partition# tempset = a partition# ZS = ab p..n_subsets# @S = c, w = a p..n_subsets# xw = ca B = c partition# W = c setminus# c - c = setminus# ab - a = b setunion# U b = b partition# tempset = b partition# ZS = b p..n_subsets# @S = a, w = b p..n_subsets# xw = ab D = a partition# W = a setminus# a - a = setminus# b - b = setunion# U = partition# ZS = a p..n_subsets# @S = b, w = a p..n_subsets# xw = ba D = b partition# W = b setminus# b - b = setminus# a - a = setunion# U = partition# ZS = b p..n_subsets# @S = c, w = b p..n_subsets# xw = cb D = c partition# W = c setminus# c - c = setminus# b - b = setunion# U = ok 19 Turning off Graph::ModularDecomposition debugging at t/02.t line 60 ok 20 ok 21 ok 22 ok 23 ok 24 ok 25 ok 26 ok 27 ok 28 ok 29 ok 30 ok 31 ok 32 ok 33 ok 34 ok 35 ok 36 ok 37 ok 38 ok 39 ok 40 ok 41 ok 42 ok 43 ok 44 ok 45 ok 46 ok 47 ok 48 ok 49 ok 50 ok 51 ok 52 ok 53 ok 54 ok 55 Turning on Graph::ModularDecomposition debugging, level 3 at t/02.t line 120 partition# G = a-c,a-d,b-d,c-a,e-b,e-d,e-g,f-d,f-g,g-d, v = a setminus# febdacg - a = febdcg partition# @S = febdcg partition# L{S}[0] = a partition# ZS = a p..n_subsets# @S = febdcg, w = a p..n_subsets# xw = fa D = f p..n_subsets# xw = ea D = fe p..n_subsets# xw = ba D = feb p..n_subsets# xw = da B = d p..n_subsets# xw = ca A = c p..n_subsets# xw = ga D = febg partition# W = c setminus# febdcg - c = febdg setminus# a - a = setunion# febdg U = febdg partition# tempset = bdefg partition# W = d setminus# febdcg - d = febcg setminus# a - a = setunion# febcg U = febcg partition# tempset = bcefg partition# W = febg setminus# febdcg - febg = dc setminus# a - a = setunion# dc U = dc partition# tempset = cd partition# ZS = bdefg p..n_subsets# @S = c, w = b p..n_subsets# xw = cb D = c partition# W = c setminus# c - c = setminus# bdefg - b = defg setunion# U defg = defg partition# tempset = defg partition# ZS = bcefg p..n_subsets# @S = d, w = b p..n_subsets# xw = db B = d partition# W = d setminus# d - d = setminus# bcefg - b = cefg setunion# U cefg = cefg partition# tempset = cefg partition# ZS = cd p..n_subsets# @S = febg, w = c p..n_subsets# xw = fc D = f p..n_subsets# xw = ec D = fe p..n_subsets# xw = bc D = feb p..n_subsets# xw = gc D = febg partition# W = febg setminus# febg - febg = setminus# cd - c = d setunion# U d = d partition# tempset = d partition# ZS = defg p..n_subsets# @S = c, w = d p..n_subsets# xw = cd D = c partition# W = c setminus# c - c = setminus# defg - d = efg setunion# U efg = efg partition# tempset = efg partition# ZS = cefg p..n_subsets# @S = d, w = c p..n_subsets# xw = dc D = d partition# W = d setminus# d - d = setminus# cefg - c = efg setunion# U efg = efg partition# tempset = efg partition# ZS = d p..n_subsets# @S = febg, w = d p..n_subsets# xw = fd C = f p..n_subsets# xw = ed C = fe p..n_subsets# xw = bd C = feb p..n_subsets# xw = gd C = febg partition# W = febg setminus# febg - febg = setminus# d - d = setunion# U = partition# ZS = efg p..n_subsets# @S = c, w = e p..n_subsets# xw = ce D = c partition# W = c setminus# c - c = setminus# efg - e = fg setunion# U fg = fg partition# tempset = fg partition# ZS = efg p..n_subsets# @S = d, w = e p..n_subsets# xw = de B = d partition# W = d setminus# d - d = setminus# efg - e = fg setunion# U fg = fg partition# tempset = fg partition# ZS = fg p..n_subsets# @S = c, w = f p..n_subsets# xw = cf D = c partition# W = c setminus# c - c = setminus# fg - f = g setunion# U g = g partition# tempset = g partition# ZS = fg p..n_subsets# @S = d, w = f p..n_subsets# xw = df B = d partition# W = d setminus# d - d = setminus# fg - f = g setunion# U g = g partition# tempset = g partition# ZS = g p..n_subsets# @S = c, w = g p..n_subsets# xw = cg D = c partition# W = c setminus# c - c = setminus# g - g = setunion# U = partition# ZS = g p..n_subsets# @S = d, w = g p..n_subsets# xw = dg B = d partition# W = d setminus# d - d = setminus# g - g = setunion# U = ok 56 Turning off Graph::ModularDecomposition debugging at t/02.t line 122 ok 57 ok t/03..............1..12 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:29 2007 # Current time GMT: Sun Dec 23 00:12:29 2007 # Using Test.pm version 1.25 Turning on Graph::ModularDecomposition debugging, level 3 at t/03.t line 33 p=a, q=c p=a, q=d p=b, q=d p=e, q=g p=e, q=h p=f, q=h p=c, q=e p=c, q=f p=d, q=e p=d, q=f p=c, q=g p=c, q=h p=d, q=g p=d, q=h p=a, q=g p=a, q=h p=b, q=g p=b, q=h ok 1 Turning off Graph::ModularDecomposition debugging at t/03.t line 36 ok 2 ok 3 Turning on Graph::ModularDecomposition debugging, level 3 at t/03.t line 53 p=a, q=c p=a, q=d p=b, q=d p=e, q=g p=e, q=h p=f, q=h p=c, q=e p=c, q=f p=d, q=e p=d, q=f p=c, q=g p=c, q=h p=d, q=g p=d, q=h p=a, q=g p=a, q=h p=b, q=g p=b, q=h gdct: a-c,a-d,a-g,a-h,b-d,b-g,b-h,c-e,c-f,c-g,c-h,d-e,d-f,d-g,d-h,e-g,e-h,f-h vs. a-c,a-d,a-e,a-f,a-g,a-h,b-d,b-e,b-f,b-g,b-h,c-e,c-f,c-g,c-h,d-e,d-f,d-g,d-h,e-g,e-h,f-h ok 4 Turning off Graph::ModularDecomposition debugging at t/03.t line 56 ok 5 ok 6 Turning on Graph::ModularDecomposition debugging, level 3 at t/03.t line 72 p=a, q=c p=a, q=d p=b, q=d p=e, q=g p=e, q=h p=f, q=h p=c, q=e p=c, q=f p=d, q=e p=d, q=f p=c, q=g p=c, q=h p=d, q=g p=d, q=h p=a, q=g p=a, q=h p=b, q=g p=b, q=h restriction(Graph::ModularDecomposition) setminus# hecbafdg - abcd = hefg restriction(a-c,a-d,a-g,a-h,b-d,b-g,b-h,c-e,c-f,c-g,c-h,d-e,d-f,d-g,d-h,e-g,e-h,f-h|a+b+c+d) = a-c,a-d,b-d ok 7 Turning off Graph::ModularDecomposition debugging at t/03.t line 75 ok 8 ok 9 Turning on Graph::ModularDecomposition debugging, level 3 at t/03.t line 91 p=a, q=c p=a, q=d p=b, q=d p=e, q=g p=e, q=h p=f, q=h p=c, q=e p=c, q=f p=d, q=e p=d, q=f p=c, q=g p=c, q=h p=d, q=g p=d, q=h p=a, q=g p=a, q=h p=b, q=g p=b, q=h factor# X = ARRAY(0x1eaeb2c) factor# @X = a b factor# newnode = a|b factor# representative node a factor# successor g factor# successor h factor# successor d factor# successor c factor# X = ARRAY(0x1eaa07c) factor# @X = c d e f factor# newnode = c|d|e|f factor# representative node c factor# predecessor a|b factor# successor g factor# successor h factor# successor e factor# successor f factor# X = ARRAY(0x1ea41fc) factor# @X = g h factor# newnode = g|h factor# representative node g factor# predecessor a|b factor# predecessor c|d|e|f ok 10 Turning off Graph::ModularDecomposition debugging at t/03.t line 96 ok 11 ok 12 ok t/04..............1..3 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:29 2007 # Current time GMT: Sun Dec 23 00:12:29 2007 # Using Test.pm version 1.25 ok 1 ok 2 ok 3 ok t/05..............1..13 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:29 2007 # Current time GMT: Sun Dec 23 00:12:29 2007 # Using Test.pm version 1.25 ok 1 ok 2 ok 3 ok 4 ok 5 ok 6 ok 7 ok 8 ok 9 ok 10 ok 11 ok 12 ok 13 ok t/06..............1..6 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:30 2007 # Current time GMT: Sun Dec 23 00:12:30 2007 # Using Test.pm version 1.25 ok 1 ok 2 ok 3 ok 4 ok 5 ok 6 ok t/07..............1..1 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:30 2007 # Current time GMT: Sun Dec 23 00:12:30 2007 # Using Test.pm version 1.25 test7 ok 1 ok t/08..............1..5 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:30 2007 # Current time GMT: Sun Dec 23 00:12:30 2007 # Using Test.pm version 1.25 ok 1 ok 2 ok 3 ok 4 ok 5 ok t/09..............1..1 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:30 2007 # Current time GMT: Sun Dec 23 00:12:30 2007 # Using Test.pm version 1.25 ok 1 ok t/10..............1..4 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:30 2007 # Current time GMT: Sun Dec 23 00:12:30 2007 # Using Test.pm version 1.25 ok 1 ok 2 ok 3 ok 4 ok t/11..............1..3 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:31 2007 # Current time GMT: Sun Dec 23 00:12:31 2007 # Using Test.pm version 1.25 ok 1 ok 2 ok 3 ok t/12..............1..6 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:31 2007 # Current time GMT: Sun Dec 23 00:12:31 2007 # Using Test.pm version 1.25 ok 1 ok 2 Turning on Graph::ModularDecomposition debugging, level 3 at t/12.t line 20 MD()=... v=undef ...MD= ok 3 Turning off Graph::ModularDecomposition debugging at t/12.t line 22 ok 4 ok 5 Turning on Graph::ModularDecomposition debugging, level 1 at t/12.t line 33 MD(a-c,a-d,b-d)=... v=c gd = a-c,a-d,b-d G([a-c,a-d,b-d], c) =... ...G()=a-b,b-d,d-a,d-b Gdd = [a+b+d], 1 @f=[a+b+d] @F=a b d u = primitive[abcd]([c]) MD(a)=... v=a ...MD=[a] MD(b)=... v=b ...MD=[b] MD(d)=... v=d ...MD=[d] ...MD=primitive[abcd]([c];[a];[b];[d]) ok 6 ok t/13..............1..7 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:31 2007 # Current time GMT: Sun Dec 23 00:12:31 2007 # Using Test.pm version 1.25 ok 1 ok 2 ok 3 ok 4 ok 5 Turning on Graph::ModularDecomposition debugging, level 1 at t/13.t line 33 gdct: a-b,a-c,b-c vs. a-b,a-c,b-c MD(a-b,a-c,b-c)=... v=b gd = a-b,a-c,b-c G([a-b,a-c,b-c], b) =... ...G()=a,c Gdd = [a,c], 2 @f=[a c] @F=a c u = linear[bac]([b]) MD(a)=... v=a ...MD=[a] MD(c)=... v=c ...MD=[c] ...MD=linear[bac]([b];[a];[c]) ok 6 gdct: vs. MD()=... v=undef ...MD= ok 7 Turning off Graph::ModularDecomposition debugging at t/13.t line 38 ok t/14..............1..15 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:32 2007 # Current time GMT: Sun Dec 23 00:12:32 2007 # Using Test.pm version 1.25 ok 1 ok 2 ok 3 ok 4 ok 5 ok 6 ok 7 ok 8 ok 9 ok 10 ok 11 ok 12 ok 13 ok 14 ok 15 ok t/15..............1..3 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:32 2007 # Current time GMT: Sun Dec 23 00:12:32 2007 # Using Test.pm version 1.25 Turning on Graph::ModularDecomposition debugging, level 3 at t/15.t line 28 ok 1 # skip Turning off Graph::ModularDecomposition debugging at t/15.t line 30 ok 2 # skip ok 3 # skip ok 3/3 skipped: various reasons t/16..............1..6 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:32 2007 # Current time GMT: Sun Dec 23 00:12:32 2007 # Using Test.pm version 1.25 ok 1 ok 2 ok 3 ok 4 ok 5 ok 6 ok t/17..............1..8 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:33 2007 # Current time GMT: Sun Dec 23 00:12:33 2007 # Using Test.pm version 1.25 ok 1 ok 2 ok 3 ok 4 ok 5 ok 6 ok 7 ok 8 ok t/18..............1..13 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:33 2007 # Current time GMT: Sun Dec 23 00:12:33 2007 # Using Test.pm version 1.25 ok 1 ok 2 ok 3 ok 4 ok 5 ok 6 ok 7 ok 8 ok 9 ok 10 ok 11 ok 12 ok 13 ok t/19..............1..2 # Running under perl version 5.010000 for MSWin32 # Win32::BuildNumber 1001 # Current time local: Sat Dec 22 16:12:33 2007 # Current time GMT: Sun Dec 23 00:12:33 2007 # Using Test.pm version 1.25 ok 1 ok 2 ok t/pod-coverage....1..0 # Skip Test::Pod::Coverage 1.00 required for testing POD coverage skipped all skipped: Test::Pod::Coverage 1.00 required for testing POD coverage t/pod.............1..1 ok 1 - blib\lib\Graph\ModularDecomposition.pm ok All tests successful, 1 test and 3 subtests skipped. Files=21, Tests=171, 6 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\Graph\ModularDecomposition.html Installing C:\cpanrun\build\5-10-0\site\lib\Graph\ModularDecomposition.pm Appending installation info to C:\cpanrun\build\5-10-0\lib/perllocal.pod