1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
|
# More complex dependency trees
use strict;
BEGIN {
$| = 1;
$^W = 1;
}
use Test::More tests => 170;
use File::Spec::Functions ':ALL';
use Algorithm::Dependency;
use Algorithm::Dependency::Source::File;
# Where is the test data located
my $TESTDATA = catdir( 't', 'data' );
ok( -d $TESTDATA, 'Found test data directory' );
# Load the data/complex.txt file in as a source file
my $file = File::Spec->catfile( $TESTDATA, 'complex.txt' );
my $Source = Algorithm::Dependency::Source::File->new( $file );
ok( $Source, "Complex source created" );
ok( eval {$Source->load;}, "Complex source loads" );
# Try it's unordere dependency with nothing selected
my $Dep = Algorithm::Dependency->new( source => $Source );
ok( $Dep, "Algorithm::Dependency->new returns true" );
ok( ref $Dep, "Algorithm::Dependency->new returns reference" );
isa_ok( $Dep, 'Algorithm::Dependency');
# Test each of the dependencies
foreach my $data ( [
['A'], [], ['A'] ], [
['B'], ['C'], [qw{B C}] ], [
['C'], [], ['C'] ], [
['D'], [qw{E F}], [qw{D E F}] ], [
['E'], ['F'], [qw{E F}] ], [
['F'], [], ['F'] ], [
['G'], [qw{H I J}], [qw{G H I J}] ], [
['H'], [qw{I J}], [qw{H I J}] ], [
['I'], ['J'], [qw{I J}] ], [
['J'], [], ['J'] ], [
['K'], [qw{L M}], [qw{K L M}] ], [
['L'], ['M'], [qw{L M}] ], [
['M'], [], ['M'] ], [
['N'], [], ['N'] ], [
['O'], ['N'], [qw{N O}] ], [
['P'], ['N'], [qw{N P}] ], [
['Q'], [qw{N O}], [qw{N O Q}] ], [
['R'], [qw{N P}], [qw{N P R}] ], [
['S'], [qw{N O P Q R}], [qw{N O P Q R S}] ], [
['T'], [qw{A D E F K L M N P R}], [qw{A D E F K L M N P R T}] ]
) {
my $args = join( ', ', map { "'$_'" } @{ $data->[0] } );
my $rv = $Dep->depends( @{ $data->[0] } );
ok( $rv, "Dependency->depends($args) returns something" );
is_deeply( $rv, $data->[1], "Dependency->depends($args) returns expected values" );
$rv = $Dep->schedule( @{ $data->[0] } );
ok( $rv, "Dependency->schedule($args) returns something" );
is_deeply( $rv, $data->[2], "Dependency->schedule($args) returns expected values" );
}
# Try an unordered dependency with half a dozen random things selected
$Dep = Algorithm::Dependency->new( source => $Source, selected => [qw{F H J N R P}] );
ok( $Dep, "Algorithm::Dependency->new returns true" );
ok( ref $Dep, "Algorithm::Dependency->new returns reference" );
isa_ok( $Dep, 'Algorithm::Dependency');
# Test each of the dependencies
foreach my $data ( [
['A'], [], ['A'] ], [
['B'], ['C'], [qw{B C}] ], [
['C'], [], ['C'] ], [
['D'], ['E'], [qw{D E}] ], [
['E'], [], ['E'] ], [
['F'], [], [] ], [
['G'], ['I'], [qw{G I}] ], [
['H'], ['I'], ['I'] ], [
['I'], [], ['I'] ], [
['J'], [], [] ], [
['K'], [qw{L M}], [qw{K L M}] ], [
['L'], ['M'], [qw{L M}] ], [
['M'], [], ['M'] ], [
['N'], [], [] ], [
['O'], [], ['O'] ], [
['P'], [], [] ], [
['Q'], ['O'], [qw{O Q}] ], [
['R'], [], [] ], [
['S'], [qw{O Q}], [qw{O Q S}] ], [
['T'], [qw{A D E K L M}], [qw{A D E K L M T}] ]
) {
my $args = join( ', ', map { "'$_'" } @{ $data->[0] } );
my $rv = $Dep->depends( @{ $data->[0] } );
ok( $rv, "Dependency->depends($args) returns something" );
is_deeply( $rv, $data->[1], "Dependency->depends($args) returns expected values" );
$rv = $Dep->schedule( @{ $data->[0] } );
ok( $rv, "Dependency->schedule($args) returns something" );
is_deeply( $rv, $data->[2], "Dependency->schedule($args) returns expected values" );
}
# Do a quick check of the missing_dependencies methods
is( $Source->missing_dependencies, 0, "->missing_dependencies returns as expected" );
1;
|
