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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
|
# perl
#$Id$
# 50_lcf_subset.t
use strict;
use Test::More tests => 52;
use List::Compare;
my @a0 = ( qw| alpha | );
my @a1 = ( qw| alpha beta | );
my @a2 = ( qw| alpha beta gamma | );
my @a3 = ( qw| gamma | );
my ($lc, $LR, $RL);
$lc = List::Compare->new( [], [] );
$LR = $lc->is_LsubsetR();
ok($LR, "simple: empty array is subset of itself");
$lc = List::Compare->new( [], [] );
$RL = $lc->is_RsubsetL();
ok($RL, "simple: empty array is subset of itself");
$lc = List::Compare->new( \@a0, \@a0 );
$LR = $lc->is_LsubsetR();
ok($LR, "simple: array is subset of itself");
$lc = List::Compare->new( \@a0, \@a0 );
$RL = $lc->is_RsubsetL();
ok($RL, "simple: array is subset of itself");
$lc = List::Compare->new( \@a0, \@a3 );
$LR = $lc->is_LsubsetR();
ok(! $LR, "simple: disjoint are not subsets");
$lc = List::Compare->new( \@a0, \@a3 );
$RL = $lc->is_RsubsetL();
ok(! $RL, "simple: disjoint are not subsets");
$lc = List::Compare->new( \@a0, \@a1 );
$LR = $lc->is_LsubsetR();
ok($LR, "simple: left is subset of right");
$LR = $lc->is_AsubsetB();
ok($LR, "simple: left is subset of right");
$RL = $lc->is_RsubsetL();
ok(! $RL, "simple: right is not subset of left");
$RL = $lc->is_BsubsetA();
ok(! $RL, "simple: right is not subset of left");
$lc = List::Compare->new( '-u', \@a0, \@a1 );
$LR = $lc->is_LsubsetR();
ok($LR, "simple unsorted: left is subset of right");
$LR = $lc->is_AsubsetB();
ok($LR, "simple unsorted: left is subset of right");
$RL = $lc->is_RsubsetL();
ok(! $RL, "simple unsorted: right is not subset of left");
$RL = $lc->is_BsubsetA();
ok(! $RL, "simple unsorted: right is not subset of left");
$lc = List::Compare->new( '--unsorted', \@a0, \@a1 );
$LR = $lc->is_LsubsetR();
ok($LR, "simple unsorted long: left is subset of right");
$LR = $lc->is_AsubsetB();
ok($LR, "simple unsorted long: left is subset of right");
$RL = $lc->is_RsubsetL();
ok(! $RL, "simple unsorted long: right is not subset of left");
$RL = $lc->is_BsubsetA();
ok(! $RL, "simple unsorted long: right is not subset of left");
$lc = List::Compare->new( { lists => [ [], [] ] } );
$LR = $lc->is_LsubsetR();
ok($LR, "lists: empty array is subset of itself");
$lc = List::Compare->new( { lists => [ [], [] ] } );
$RL = $lc->is_RsubsetL();
ok($LR, "lists: empty array is subset of itself");
$lc = List::Compare->new( { lists => [ \@a0, \@a0 ] } );
$LR = $lc->is_LsubsetR();
ok($LR, "lists: array is subset of itself");
$lc = List::Compare->new( { lists => [ \@a0, \@a0 ] } );
$RL = $lc->is_RsubsetL();
ok($RL, "lists: array is subset of itself");
$lc = List::Compare->new( { lists => [ \@a0, \@a3 ] } );
$LR = $lc->is_LsubsetR();
ok(! $LR, "lists: disjoint are not subsets");
$lc = List::Compare->new( { lists => [ \@a0, \@a3 ] } );
$RL = $lc->is_RsubsetL();
ok(! $RL, "lists: disjoint are not subsets");
$lc = List::Compare->new( { lists => [ \@a0, \@a1 ] } );
$LR = $lc->is_LsubsetR();
ok($LR, "lists: left is subset of right");
$LR = $lc->is_AsubsetB();
ok($LR, "lists: left is subset of right");
$RL = $lc->is_RsubsetL();
ok(! $RL, "lists: right is not subset of left");
$RL = $lc->is_BsubsetA();
ok(! $RL, "lists: right is not subset of left");
$lc = List::Compare->new( { lists => [ \@a0, \@a1 ], unsorted => 1 } );
$LR = $lc->is_LsubsetR();
ok($LR, "lists: left is subset of right");
$LR = $lc->is_AsubsetB();
ok($LR, "lists: left is subset of right");
$RL = $lc->is_RsubsetL();
ok(! $RL, "lists: right is not subset of left");
$RL = $lc->is_BsubsetA();
ok(! $RL, "lists: right is not subset of left");
$lc = List::Compare->new( '-a', \@a0, \@a1 );
$LR = $lc->is_LsubsetR();
ok($LR, "simple accelerated: left is subset of right");
$LR = $lc->is_AsubsetB();
ok($LR, "simple accelerated: left is subset of right");
$RL = $lc->is_RsubsetL();
ok(! $RL, "simple accelerated: right is not subset of left");
$RL = $lc->is_BsubsetA();
ok(! $RL, "simple accelerated: right is not subset of left");
$lc = List::Compare->new( '--accelerated', \@a0, \@a1 );
$LR = $lc->is_LsubsetR();
ok($LR, "simple accelerated long: left is subset of right");
$LR = $lc->is_AsubsetB();
ok($LR, "simple accelerated long: left is subset of right");
$RL = $lc->is_RsubsetL();
ok(! $RL, "simple accelerated long: right is not subset of left");
$RL = $lc->is_BsubsetA();
ok(! $RL, "simple accelerated long: right is not subset of left");
$lc = List::Compare->new( { lists => [ \@a0, \@a1 ], accelerated => 1 } );
$LR = $lc->is_LsubsetR();
ok($LR, "lists: left is subset of right");
$LR = $lc->is_AsubsetB();
ok($LR, "lists: left is subset of right");
$RL = $lc->is_RsubsetL();
ok(! $RL, "lists: right is not subset of left");
$RL = $lc->is_BsubsetA();
ok(! $RL, "lists: right is not subset of left");
$lc = List::Compare->new( \@a0, \@a1, \@a2 );
$LR = $lc->is_LsubsetR();
ok($LR, "multiple: left is subset of right");
$LR = $lc->is_LsubsetR(0,1);
ok($LR, "multiple: left is subset of right");
$LR = $lc->is_LsubsetR(1,2);
ok($LR, "multiple: left is subset of right");
$LR = $lc->is_LsubsetR(0,2);
ok($LR, "multiple: left is subset of right");
$LR = $lc->is_AsubsetB();
ok($LR, "multiple: left is subset of right");
$LR = $lc->is_AsubsetB(0,1);
ok($LR, "multiple: left is subset of right");
$LR = $lc->is_AsubsetB(1,2);
ok($LR, "multiple: left is subset of right");
$LR = $lc->is_AsubsetB(0,2);
ok($LR, "multiple: left is subset of right");
|
