/
keyset.t
287 lines (228 loc) · 9.98 KB
/
keyset.t
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
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
use v6;
use Test;
plan 122;
# L<S02/Mutable types/"KeyHash of Bool">
# A KeySet is a KeyHash of Bool, i.e. the values are Bool
sub showset($s) { $s.keys.sort.join(' ') }
# L<S02/Immutable types/'the set listop'>
{
my $s = KeySet.new(<a b foo>);
isa_ok $s, KeySet, 'KeySet.new produces a KeySet';
is showset($s), 'a b foo', '...with the right elements';
is $s.default, False, "Default value is false";
is $s<a>, True, 'Single-key subscript (existing element)';
isa_ok $s<a>, Bool, 'Single-key subscript has correct type (existing element)';
is $s<santa>, False, 'Single-key subscript (nonexistent element)';
isa_ok $s<santa>, Bool, 'Single-key subscript has correct type (nonexistent element)';
is $s.exists('a'), True, '.exists with existing element';
is $s.exists('santa'), False, '.exists with nonexistent element';
ok ?$s, "Bool returns True if there is something in the KeySet";
nok ?Set.new(), "Bool returns False if there is nothing in the KeySet";
my $hash;
lives_ok { $hash = $s.hash }, ".hash doesn't die";
isa_ok $hash, Hash, "...and it returned a Hash";
is showset($hash), 'a b foo', '...with the right elements';
is $hash.values.grep({ ($_ ~~ Bool) && $_ }).elems, 3, "...and values";
dies_ok { $s.keys = <c d> }, "Can't assign to .keys";
dies_ok { $s.values = <True False> }, "Can't assign to .values";
is ($s<a b>).grep(?*).elems, 2, 'Multiple-element access';
is ($s<a santa b easterbunny>).grep(?*).elems, 2, 'Multiple-element access (with nonexistent elements)';
is $s.elems, 3, '.elems gives number of keys';
is +$s, 3, '+$set gives number of keys';
$s<baz> = True;
lives_ok { $s<baz> = True }, 'can set an item to True';
is showset($s), 'a b baz foo', '...and it adds it to the KeySet';
lives_ok { $s<baz> = True }, 'can set the same item to True';
is showset($s), 'a b baz foo', '...and it does nothing';
lives_ok { $s<baz> = False }, 'can set an item to False';
is showset($s), 'a b foo', 'and it removes it';
lives_ok { $s<baz> = False }, 'can set an item which does not exist to False';
is showset($s), 'a b foo', '... and it is not added to the set';
lives_ok { $s<foo> = False }, 'can set an item to False';
is $s.elems, 2, '... and an item is gone';
is showset($s), 'a b', '... and the right one is gone';
lives_ok { $s<foo>++ }, 'can ++ an item';
is showset($s), 'a b foo', '++ on an item reinstates it';
lives_ok { $s<foo>++ }, 'can ++ an item';
is showset($s), 'a b foo', '++ on an existing item does nothing';
lives_ok { $s<b>-- }, 'can -- an item';
is showset($s), 'a foo', '-- on an item removes it';
lives_ok { $s<bar>-- }, 'can -- an item';
is showset($s), 'a foo', '... but only if they were there to start with';
}
#?rakudo skip ".Set NYI"
{
isa_ok "a".KeySet, KeySet, "Str.KeySet makes a KeySet";
is showset("a".KeySet), 'a', "'a'.KeySet is set a";
isa_ok (a => 1).KeySet, KeySet, "Pair.KeySet makes a KeySet";
is showset((a => 1).KeySet), 'a', "(a => 1).KeySet is set a";
is showset((a => 0).KeySet), '', "(a => 0).KeySet is the empty set";
isa_ok <a b c>.KeySet, KeySet, "<a b c>.KeySet makes a KeySet";
is showset(<a b c a>.KeySet), 'a b c', "<a b c a>.KeySet makes the set a b c";
is showset(["a", "b", "c", "a"].KeySet), 'a b c', "[a b c a].KeySet makes the set a b c";
is showset([a => 3, b => 0, 'c', 'a'].KeySet), 'a c', "[a => 3, b => 0, 'c', 'a'].KeySet makes the set a c";
isa_ok {a => 2, b => 4, c => 0}.KeySet, KeySet, "{a => 2, b => 4, c => 0}.KeySet makes a KeySet";
is showset({a => 2, b => 4, c => 0}.KeySet), 'a b', "{a => 2, b => 4, c => 0}.KeySet makes the set a b";
}
{
my $s = KeySet.new(<a b foo>);
is $s<a>:exists, True, ':exists with existing element';
is $s<santa>:exists, False, ':exists with nonexistent element';
#?rakudo 2 skip ':delete NYI'
is $s<a>:delete, True, ':delete returns current value on set';
is showset($s), 'b foo', '...and actually deletes';
}
{
my %h := KeySet.new(<a c>);
is +%h.elems, 2, 'Inititalization worked';
lives_ok { %h<c> = False }, 'can set an item to False';
is %h.elems, 1, '... and an item is gone';
is ~%h.keys, 'a', '... and the right one is gone';
%h<c>++;
is %h.keys.sort.join, 'ac', '++ on an item reinstates it';
%h<c>++;
is %h.keys.sort.join, 'ac', '++ on an existing item does nothing';
%h<a>--;
is ~%h.keys, 'c', '-- removes items';
%h<b>--;
is ~%h.keys, 'c', '... but only if they were there from the beginning';
# lives_ok { %h = set <Q P R> }, 'Assigning a Set to a KeySet';
# is %h.keys.sort.join, 'PQR', '... works as expected';
}
{
my $s = KeySet.new(<foo bar foo bar baz foo>);
is showset($s), 'bar baz foo', 'KeySet.new discards duplicates';
}
{
my $b = KeySet.new([ foo => 10, bar => 17, baz => 42 ]);
isa_ok $b, KeySet, 'KeySet.new given an array of pairs produces a KeySet';
is showset($b), 'bar baz foo', '... with the right elements';
}
{
my $b = KeySet.new({ foo => 10, bar => 17, baz => 42 }.hash);
isa_ok $b, KeySet, 'KeySet.new given a Hash produces a KeySet';
is showset($b), 'bar baz foo', '... with the right elements';
}
{
my $b = KeySet.new({ foo => 10, bar => 17, baz => 42 });
isa_ok $b, KeySet, 'KeySet.new given a Hash produces a KeySet';
is showset($b), 'bar baz foo', '... with the right elements';
}
{
my $b = KeySet.new(set <foo bar foo bar baz foo>);
isa_ok $b, KeySet, 'KeySet.new given a Set produces a KeySet';
is showset($b), 'bar baz foo', '... with the right elements';
}
{
my $b = KeySet.new(KeySet.new(<foo bar foo bar baz foo>));
isa_ok $b, KeySet, 'KeySet.new given a KeySet produces a KeySet';
is showset($b), 'bar baz foo', '... with the right elements';
}
{
my $b = KeySet.new(KeyBag.new(<foo bar foo bar baz foo>));
isa_ok $b, KeySet, 'KeySet.new given a KeyBag produces a KeySet';
is showset($b), 'bar baz foo', '... with the right elements';
}
{
my $b = KeySet.new(bag <foo bar foo bar baz foo>);
isa_ok $b, KeySet, 'KeySet given a Bag produces a KeySet';
is showset($b), 'bar baz foo', '... with the right elements';
}
{
my $s = KeySet.new(<foo bar baz>);
isa_ok $s.list.elems, 3, ".list returns 3 things";
is $s.list.grep(Str).elems, 3, "... all of which are Str";
is $s.iterator.grep(Str).elems, 3, ".iterator yields three Strs";
}
{
my $s = KeySet.new(<foo bar baz>);
my $str;
my $c;
lives_ok { $str = $s.perl }, ".perl lives";
isa_ok $str, Str, "... and produces a string";
lives_ok { $c = eval $str }, ".perl.eval lives";
isa_ok $c, KeySet, "... and produces a KeySet";
is showset($c), showset($s), "... and it has the correct values";
}
{
my $s = KeySet.new(<foo bar baz>);
lives_ok { $s = $s.Str }, ".Str lives";
isa_ok $s, Str, "... and produces a string";
is $s.split(" ").sort.join(" "), "bar baz foo", "... which only contains bar baz and foo separated by spaces";
}
{
my $s = KeySet.new(<foo bar baz>);
lives_ok { $s = $s.gist }, ".gist lives";
isa_ok $s, Str, "... and produces a string";
ok $s ~~ /foo/, "... which mentions foo";
ok $s ~~ /bar/, "... which mentions bar";
ok $s ~~ /baz/, "... which mentions baz";
}
# L<S02/Names and Variables/'C<%x> may be bound to'>
{
my %s := KeySet.new(<a b c b>);
isa_ok %s, KeySet, 'A KeySet bound to a %var is a KeySet';
is showset(%s), 'a b c', '...with the right elements';
is %s<a>, True, 'Single-key subscript (existing element)';
is %s<santa>, False, 'Single-key subscript (nonexistent element)';
lives_ok { %s<a> = True }, "Can assign to an element (KeySets are immutable)";
}
# L<S32::Containers/KeySet/roll>
{
my $s = KeySet.new(<a b c>);
my $a = $s.roll;
ok $a eq "a" || $a eq "b" || $a eq "c", "We got one of the three choices";
my @a = $s.roll(2);
is +@a, 2, '.roll(2) returns the right number of items';
is @a.grep(* eq 'a' | 'b' | 'c').elems, 2, '.roll(2) returned "a"s, "b"s, and "c"s';
@a = $s.roll: 100;
is +@a, 100, '.roll(100) returns 100 items';
is @a.grep(* eq 'a' | 'b' | 'c').elems, 100, '.roll(100) returned "a"s, "b"s, and "c"s';
}
# L<S32::Containers/KeySet/pick>
{
my $s = KeySet.new(<a b c d e f g h>);
my @a = $s.pick: *;
is @a.sort.join, 'abcdefgh', 'KeySet.pick(*) gets all elements';
isnt @a.join, 'abcdefgh', 'KeySet.pick(*) returns elements in a random order';
# There's only a 1/40_320 chance of that test failing by chance alone.
}
{
my $s = KeySet.new(<a b c>);
my $a = $s.pick;
ok $a eq "a" || $a eq "b" || $a eq "c", "We got one of the three choices";
my @a = $s.pick(2);
is +@a, 2, '.pick(2) returns the right number of items';
is @a.grep(* eq 'a' | 'b' | 'c').elems, 2, '.pick(2) returned "a"s, "b"s, and "c"s';
ok @a.grep(* eq 'a').elems <= 1, '.pick(2) returned at most one "a"';
ok @a.grep(* eq 'b').elems <= 1, '.pick(2) returned at most one "b"';
ok @a.grep(* eq 'c').elems <= 1, '.pick(2) returned at most one "c"';
}
#?niecza skip "is KeySet doesn't work yet"
{
my %h is KeySet = a => True, b => False, c => True;
#?rakudo todo 'todo'
is +%h.elems, 2, 'Inititalization worked';
lives_ok { %h<c> = False }, 'can set an item to False';
#?rakudo todo 'todo'
is %h.elems, 1, '... and an item is gone';
#?rakudo todo 'todo'
is ~%h.keys, 'a', '... and the right one is gone';
%h<c>++;
#?rakudo todo 'todo'
is %h.keys.sort.join, 'ac', '++ on an item reinstates it';
%h<c>++;
#?rakudo todo 'todo'
is %h.keys.sort.join, 'ac', '++ on an existing item does nothing';
%h<a>--;
#?rakudo todo 'todo'
is ~%h.keys, 'c', '-- removes items';
%h<b>--;
#?rakudo todo 'todo'
is ~%h.keys, 'c', '... but only if they were there from the beginning';
#?rakudo todo 'todo'
lives_ok { %h = set <Q P R> }, 'Assigning a Set to a KeySet';
#?rakudo todo 'todo'
is %h.keys.sort.join, 'PQR', '... works as expected';
}
# vim: ft=perl6