-
-
Notifications
You must be signed in to change notification settings - Fork 373
/
List.pm
601 lines (536 loc) Β· 18.2 KB
/
List.pm
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
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
# for our tantrums
my class X::TypeCheck { ... }
my class List does Positional { # declared in BOOTSTRAP
# class List is Iterable is Cool
# has Mu $!items; # VM's array of our reified elements
# has Mu $!flattens; # true if this list flattens its parcels
# has Mu $!nextiter; # iterator for generating remaining elements
method new(|) {
my Mu $args := nqp::p6argvmarray();
nqp::shift($args);
nqp::p6list($args, self.WHAT, Mu);
}
method Bool() { self.gimme(1).Bool }
method Int() { self.elems }
method end() { self.elems - 1 }
multi method Numeric(List:D:) { self.elems }
multi method Str(List:D:) { self.join(' ') }
method fmt($format = '%s', $separator = ' ') {
self.map({ .fmt($format) }).join($separator);
}
method flat() { self.flattens
?? self
!! nqp::p6list(nqp::list(self), List, Bool::True)
}
method list() { self }
method lol() {
self.gimme(0);
my Mu $rpa := nqp::clone($!items);
nqp::push($rpa, $!nextiter) if $!nextiter.defined;
nqp::p6list($rpa, LoL, Mu);
}
method flattens() { $!flattens }
my &itemify = { .elems == 1 ?? $_ !! [.list] };
proto method tree(|) {*}
multi method tree(List:U:) { self }
multi method tree(List:D:) {
MapIter.new(self, &itemify, Mu).list;
}
multi method tree(List:D: Cool $count as Int) {
$count <= 0 ?? self
!! $count == 1 ?? self.tree
!! MapIter.new(
self,
{.elems == 1 ?? $_ !! [.tree($count - 1)]},
Mu
).list;
}
multi method tree(List:D: &c) {
MapIter.new(self, &c, Mu).list;
}
# uncommenting causes "Circularity detected in multi sub types"
# multi method tree(List:D: *@ [$first, *@rest] where {.elems >= 2 }) {
# MapIter.new(:list(self), :block(*.list(|@rest))).list.tree($first)
# }
method Capture() {
self.gimme(*);
my $cap := nqp::create(Capture);
nqp::bindattr($cap, Capture, '$!list', $!items);
$cap
}
method Parcel() {
my Mu $rpa := nqp::clone(nqp::p6listitems(self));
nqp::push($rpa, $!nextiter) if $!nextiter.defined;
nqp::p6parcel($rpa, Any);
}
multi method at_pos(List:D: $pos is copy) is rw {
$pos = $pos.Int;
self.exists_pos($pos)
?? nqp::atpos($!items, nqp::unbox_i($pos))
!! Nil;
}
multi method at_pos(List:D: int $pos) is rw {
self.exists_pos($pos)
?? nqp::atpos($!items, $pos)
!! Nil;
}
method eager() { self.gimme(*); self }
method elems() {
return 0 unless self.DEFINITE;
# Get as many elements as we can. If gimme stops before
# reaching the end of the list, assume the list is infinite.
my $n = self.gimme(*);
$!nextiter.defined ?? $Inf !! $n
}
method exists (\pos) { # is DEPRECATED doesn't work in settings
once DEPRECATED("Method 'List.exists'","the :exists adverb");
self.exists_pos(pos);
}
method exists_pos(\pos) {
return False if !self.DEFINITE || pos < 0;
self.gimme(pos + 1);
nqp::p6bool( !nqp::isnull(nqp::atpos($!items, nqp::unbox_i(pos))) );
}
method gimme($n, :$sink) {
return unless self.DEFINITE;
# loop through iterators until we have at least $n elements
my int $count = nqp::elems(nqp::p6listitems(self));
my $eager = nqp::p6bool(nqp::istype($n, Whatever) || $n == $Inf);
while $!nextiter.defined && ($eager
?? !$!nextiter.infinite
!! ($count < $n)) {
$!nextiter.reify($eager ?? Whatever !! $n - $count, :$sink);
$count = nqp::elems($!items);
}
# return the number of elements we have now
$count
}
method infinite() {
self.DEFINITE && $!nextiter.defined && $!nextiter.infinite;
}
method iterator() {
# Return a reified ListIter containing our currently reified elements
# and any subsequent iterator.
my $iter := nqp::create(ListIter);
nqp::bindattr($iter, ListIter, '$!nextiter', $!nextiter);
nqp::bindattr($iter, ListIter, '$!reified', self.Parcel());
$iter;
}
method munch($n is copy) {
$n = 0 if $n < 0;
$n = self.gimme($n) if nqp::not_i(nqp::istype($n, Int))
|| nqp::not_i(nqp::islist($!items))
|| nqp::islt_i(nqp::elems($!items), nqp::unbox_i($n));
nqp::p6parcel(
nqp::p6shiftpush(nqp::list(), $!items, nqp::unbox_i($n)),
Any
)
}
method pick($n is copy = 1) {
fail "Cannot .pick from infinite list" if self.infinite; #MMD?
## We use a version of Fisher-Yates shuffle here to
## replace picked elements with elements from the end
## of the list, resulting in an O(n) algorithm.
my $elems = self.elems;
return unless $elems;
$n = +$Inf if nqp::istype($n, Whatever);
$n = $elems if $n > $elems;
return self.at_pos($elems.rand.floor) if $n == 1;
my Mu $rpa := nqp::clone($!items);
my $i;
my Mu $v;
gather while $n > 0 {
$i = nqp::rand_I(nqp::decont($elems), Int);
$elems--; $n--;
$v := nqp::atpos($rpa, nqp::unbox_i($i));
# replace selected element with last unpicked one
nqp::bindpos($rpa, nqp::unbox_i($i),
nqp::atpos($rpa, nqp::unbox_i($elems)));
take-rw $v;
}
}
method pop() is parcel {
my $elems = self.gimme(*);
fail 'Cannot .pop from an infinite list' if $!nextiter.defined;
$elems > 0
?? nqp::pop($!items)
!! fail 'Element popped from empty list';
}
method shift() is parcel {
# make sure we have at least one item, then shift+return it
nqp::islist($!items) && nqp::existspos($!items, 0) || self.gimme(1)
?? nqp::shift($!items)
!! fail 'Element shifted from empty list';
}
multi method push(List:D: *@values) {
fail 'Cannot .push an infinite list' if @values.infinite;
self.gimme(*);
fail 'Cannot .push to an infinite list' if $!nextiter.defined;
nqp::p6listitems(self);
# don't bother with type checks
if ( self.of =:= Mu ) {
nqp::push( $!items, @values.shift ) while @values.gimme(1);
}
# we must check types
else {
my $of = self.of;
while @values.gimme(1) {
my $value := @values.shift;
if $value ~~ $of {
nqp::push( $!items, $value );
}
# huh?
else {
X::TypeCheck.new(
operation => '.push',
expected => $of,
got => $value,
).throw;
}
}
}
self;
}
multi method unshift(List:D: *@values) {
fail 'Cannot .unshift an infinite list' if @values.infinite;
nqp::p6listitems(self);
# don't bother with type checks
if ( self.of =:= Mu ) {
nqp::unshift($!items, @values.pop) while @values;
}
# we must check types
else {
my $of = self.of;
while @values {
my $value := @values.pop;
if $value ~~ $of {
nqp::unshift($!items, $value);
}
# huh?
else {
X::TypeCheck.new(
operation => '.unshift',
expected => $of,
got => $value,
).throw;
}
}
}
self
}
method roll($n is copy = 1) {
my $elems = self.gimme(*);
fail 'Cannot .roll from an infinite list' if $!nextiter.defined;
return unless $elems;
$n = +$Inf if nqp::istype($n, Whatever);
return self.at_pos($elems.rand.floor) if $n == 1;
gather while $n > 0 {
take nqp::atpos($!items, nqp::unbox_i($elems.rand.floor.Int));
$n--;
}
}
method reverse() {
self.gimme(*);
fail 'Cannot .reverse from an infinite list' if $!nextiter.defined;
my Mu $rev := nqp::list();
my Mu $orig := nqp::clone($!items);
nqp::push($rev, nqp::pop($orig)) while $orig;
my $rlist := nqp::create(self.WHAT);
nqp::bindattr($rlist, List, '$!items', $rev);
$rlist;
}
method rotate(Int $n is copy = 1) {
self.gimme(*);
fail 'Cannot .rotate an infinite list' if $!nextiter.defined;
my Mu $res := nqp::clone($!items);
$n %= nqp::p6box_i(nqp::elems($!items));
if $n > 0 {
nqp::push($res, nqp::shift($res)) while $n--;
}
elsif $n < 0 {
nqp::unshift($res, nqp::pop($res)) while $n++;
}
my $rlist := nqp::create(self.WHAT);
nqp::bindattr($rlist, List, '$!items', $res);
$rlist;
}
method splice($offset = 0, $size?, *@values) {
self.gimme(*);
my $o = $offset;
my $s = $size;
my $elems = self.elems;
$o = $o($elems) if nqp::istype($o, Callable);
X::OutOfRange.new(
what => 'offset argument to List.splice',
got => $offset,
range => (0..^self.elems),
).fail if $o < 0;
$s //= self.elems - ($o min $elems);
$s = $s(self.elems - $o) if nqp::istype($s, Callable);
X::OutOfRange.new(
what => 'size argument to List.splice',
got => $size,
range => (0..^(self.elems - $o)),
).fail if $s < 0;
my @ret = self[$o..($o + $s - 1)];
nqp::splice($!items,
nqp::getattr(@values.eager, List, '$!items'),
$o.Int, $s.Int);
@ret;
}
method sort($by = &infix:<cmp>) {
fail 'Cannot .sort an infinite list' if self.infinite; #MMD?
# We defer to Parrot's ResizablePMCArray.sort method here.
# Instead of sorting elements directly, we sort a Parcel of
# indices from 0..^$list.elems, then use that Parcel as
# a slice into self.
# Range is currently optimized for fast Parcel construction.
my $index := Range.new(0, self.elems, :excludes_max).reify(*);
my Mu $index_rpa := nqp::getattr($index, Parcel, '$!storage');
# if $by.arity < 2, then we apply the block to the elements
# for sorting.
if ($by.?count // 2) < 2 {
my $list = self.map($by).eager;
nqp::p6sort($index_rpa, -> $a, $b { $list[$a] cmp $list[$b] || $a <=> $b });
}
else {
my $list = self.eager;
nqp::p6sort($index_rpa, -> $a, $b { $by($list[$a],$list[$b]) || $a <=> $b });
}
self[$index];
}
multi method ACCEPTS(List:D: $topic) {
my $sseq = self;
my $tseq = $topic.list;
my $spos = 0;
my $tpos = 0;
while $spos < +$sseq {
# if the next element is Whatever
if $sseq[$spos] ~~ Whatever {
# skip over all of the Whatevers
$spos++ while $spos <= +$sseq && $sseq[$spos] ~~ Whatever;
# if nothing left, we're done
return True if !($spos < +$sseq);
# find a target matching our new target
$tpos++ while ($tpos < +$tseq) && $tseq[$tpos] !== $sseq[$spos];
# return false if we ran out
return False if !($tpos < +$tseq);
}
elsif $tpos >= +$tseq || $tseq[$tpos] !=== $sseq[$spos] {
return False;
}
# skip matching elements
$spos++;
$tpos++;
}
# If nothing left to match, we're successful.
$tpos >= +$tseq;
}
proto method uniq(|) {*}
multi method uniq() {
my $seen := nqp::hash();
my str $target;
map {
$target = nqp::unbox_s($_.WHICH);
if nqp::existskey($seen, $target) {
Nil;
}
else {
nqp::bindkey($seen, $target, 1);
$_;
}
}, @.list;
}
multi method uniq( :&as!, :&with! ) {
my @seen; # should be Mu, but doesn't work in settings :-(
my Mu $target;
map {
$target = &as($_);
if first( { with($target,$_) }, @seen ) =:= Nil {
@seen.push($target);
$_;
}
else {
Nil;
}
}, @.list;
}
multi method uniq( :&as! ) {
my $seen := nqp::hash();
my str $target;
map {
$target = &as($_).WHICH;
if nqp::existskey($seen, $target) {
Nil;
}
else {
nqp::bindkey($seen, $target, 1);
$_;
}
}, @.list;
}
multi method uniq( :&with! ) {
nextwith() if &with === &[===]; # use optimized version
my @seen; # should be Mu, but doesn't work in settings :-(
my Mu $target;
map {
$target := $_;
if first( { with($target,$_) }, @seen ) =:= Nil {
@seen.push($target);
$_;
}
else {
Nil;
}
}, @.list;
}
my @secret;
proto method squish(|) {*}
multi method squish( :&as!, :&with = &[===] ) {
my $last = @secret;
my str $which;
map {
$which = &as($_).Str;
if with($which,$last) {
Nil;
}
else {
$last = $which;
$_;
}
}, @.list;
}
multi method squish( :&with = &[===] ) {
my $last = @secret;
map {
if with($_,$last) {
Nil;
}
else {
$last = $_;
$_;
}
}, @.list;
}
multi method gist(List:D:) { join ' ', map { $_.gist }, @(self) }
multi method perl(List:D \SELF:) {
self.gimme(*);
self.Parcel.perl ~ '.list'
~ (nqp::iscont(SELF) ?? '.item' !! '')
}
method REIFY(Parcel \parcel, Mu \nextiter) {
nqp::splice($!items, nqp::getattr(parcel, Parcel, '$!storage'),
nqp::elems($!items), 0);
nqp::bindattr(self, List, '$!nextiter', nextiter);
parcel
}
method FLATTENABLE_LIST() { self.gimme(*); $!items }
method FLATTENABLE_HASH() { nqp::hash() }
multi method DUMP(List:D: :$indent-step = 4, :%ctx?) {
return DUMP(self, :$indent-step) unless %ctx;
my $flags := ("\x221e" if self.infinite);
my Mu $attrs := nqp::list();
nqp::push($attrs, '$!flattens');
nqp::push($attrs, $!flattens );
nqp::push($attrs, '$!items' );
nqp::push($attrs, $!items );
nqp::push($attrs, '$!nextiter');
nqp::push($attrs, $!nextiter );
self.DUMP-OBJECT-ATTRS($attrs, :$indent-step, :%ctx, :$flags);
}
method keys(List:) {
return unless self.DEFINITE;
(0..self.end).list;
}
method values(List:) {
return unless self.DEFINITE;
my Mu $rpa := nqp::clone(nqp::p6listitems(self));
nqp::push($rpa, $!nextiter) if $!nextiter.defined;
nqp::p6list($rpa, List, self.flattens);
}
method pairs(List:) {
return unless self.DEFINITE;
self.keys.map: {; $_ => self.at_pos($_) };
}
method kv(List:) {
self.keys.map: { ($_, self.at_pos($_)) };
}
method reduce(List: &with) {
fail('can only reduce with arity 2')
unless &with.arity <= 2 <= &with.count;
return unless self.DEFINITE;
my Mu $val;
for self.keys {
if $_ == 0 {
$val = self.at_pos(0);
next;
}
$val = with($val, self.at_pos($_));
}
$val;
}
method sink() {
self.gimme(*, :sink) if self.defined;
Nil;
}
# this is a remnant of a previous implementation of .push(), which
# apparently is used by LoL. Please remove when no longer necessary.
method STORE_AT_POS(Int \pos, Mu \v) is rw {
nqp::bindpos($!items, nqp::unbox_i(pos), v)
}
my sub combinations(Int $n, Int $k) {
return [] if $k == 0;
return () if $k > $n;
gather {
take [0, (1..^$n)[@$_]] for combinations($n-1, $k-1);
take [(1..^$n)[@$_]] for combinations($n-1, $k );
}
}
proto method combinations($) {*}
multi method combinations( Int $of ) {
gather take self[@$_] for combinations self.elems, $of
}
multi method combinations( Range $of = 0 .. * ) {
X::NYI.new.throw;
}
my sub permutations(Int $n) {
$n == 1 ?? ( [0,] ) !!
gather for ^$n -> $i {
my @i = grep none($i), ^$n;
take [$i, @i[@$_]] for permutations($n - 1);
}
}
method permutations() {
gather take self[@$_] for permutations self.elems;
}
}
sub eager(|) {
nqp::p6parcel(nqp::p6argvmarray(), Any).eager
}
sub flat(|) {
nqp::p6list(nqp::p6argvmarray(), List, Bool::True)
}
sub list(|) {
nqp::p6list(nqp::p6argvmarray(), List, Mu)
}
proto infix:<xx>(|) { * }
multi infix:<xx>() { fail "No zero-arg meaning for infix:<xx>" }
multi infix:<xx>(Mu \x) {x }
multi infix:<xx>(Mu \x, $n is copy, :$thunked) {
$n = nqp::p6bool(nqp::istype($n, Whatever)) ?? $Inf !! $n.Int;
GatherIter.new({ take ($thunked ?? x.() !! x) while $n-- > 0; }, :infinite($n == $Inf)).list
}
proto sub pop(@) {*}
multi sub pop(@a) { @a.pop }
proto sub shift(@) {*}
multi sub shift(@a) { @a.shift }
proto sub unshift(|) {*}
multi sub unshift(\a, *@elems) { a.unshift: @elems }
proto sub push(|) {*}
multi sub push(\a, *@elems) { a.push: @elems }
sub reverse(*@a) { @a.reverse }
sub rotate(@a, Int $n = 1) { @a.rotate($n) }
sub reduce (&with, *@list) { @list.reduce(&with) }
sub splice(@arr, $offset = 0, $size?, *@values) {
@arr.splice($offset, $size, @values)
}