-
-
Notifications
You must be signed in to change notification settings - Fork 411
/
list.pony
635 lines (552 loc) · 13 KB
/
list.pony
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
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
class List[A] is Seq[A]
"""
A doubly linked list.
"""
var _head: (ListNode[A] | None) = None
var _tail: (ListNode[A] | None) = None
var _size: USize = 0
new create(len: USize = 0) =>
"""
Do nothing, but be compatible with Seq.
"""
None
new unit(a: A) =>
"""
Builds a new list from an element.
"""
push(consume a)
new from(seq: Array[A^]) =>
"""
Builds a new list from the sequence passed in.
"""
for value in seq.values() do
push(consume value)
end
fun ref reserve(len: USize) =>
"""
Do nothing, but be compatible with Seq.
"""
None
fun size(): USize =>
"""
Returns the number of items in the list.
"""
_size
fun apply(i: USize = 0): this->A ? =>
"""
Get the i-th element, raising an error if the index is out of bounds.
"""
index(i)?()?
fun ref update(i: USize, value: A): A^ ? =>
"""
Change the i-th element, raising an error if the index is out of bounds.
Returns the previous value, which may be None if the node has been popped
but left on the list.
"""
index(i)?()? = consume value
fun index(i: USize): this->ListNode[A] ? =>
"""
Gets the i-th node, raising an error if the index is out of bounds.
"""
if i >= _size then
error
end
var node = _head as this->ListNode[A]
var j = USize(0)
while j < i do
node = node.next() as this->ListNode[A]
j = j + 1
end
node
fun ref remove(i: USize): ListNode[A] ? =>
"""
Remove the i-th node, raising an error if the index is out of bounds.
The removed node is returned.
"""
index(i)? .> remove()
fun ref clear() =>
"""
Empties the list.
"""
_head = None
_tail = None
_size = 0
fun head(): this->ListNode[A] ? =>
"""
Get the head of the list.
"""
_head as this->ListNode[A]
fun tail(): this->ListNode[A] ? =>
"""
Get the tail of the list.
"""
_tail as this->ListNode[A]
fun ref prepend_node(node: ListNode[A]) =>
"""
Adds a node to the head of the list.
"""
match _head
| let head': ListNode[A] =>
head'.prepend(node)
else
_set_both(node)
end
fun ref append_node(node: ListNode[A]) =>
"""
Adds a node to the tail of the list.
"""
match _tail
| let tail': ListNode[A] =>
tail'.append(node)
else
_set_both(node)
end
fun ref append_list(that: List[A]) =>
"""
Remove all nodes from that and append them to this.
"""
if this isnt that then
while that._size > 0 do
try append_node(that.head()?) end
end
end
fun ref prepend_list(that: List[A]) =>
"""
Remove all nodes from that and prepend them to this.
"""
if this isnt that then
while that._size > 0 do
try prepend_node(that.tail()?) end
end
end
fun ref push(a: A) =>
"""
Adds a value to the tail of the list.
"""
append_node(ListNode[A](consume a))
fun ref pop(): A^ ? =>
"""
Removes a value from the tail of the list.
"""
tail()? .> remove().pop()?
fun ref unshift(a: A) =>
"""
Adds a value to the head of the list.
"""
prepend_node(ListNode[A](consume a))
fun ref shift(): A^ ? =>
"""
Removes a value from the head of the list.
"""
head()? .> remove().pop()?
fun ref append(
seq: (ReadSeq[A] & ReadElement[A^]),
offset: USize = 0,
len: USize = -1)
=>
"""
Append len elements from a sequence, starting from the given offset.
"""
if offset >= seq.size() then
return
end
let copy_len = len.min(seq.size() - offset)
reserve(_size + copy_len)
let cap = copy_len + offset
var i = offset
try
while i < cap do
push(seq(i)?)
i = i + 1
end
end
fun ref concat(iter: Iterator[A^], offset: USize = 0, len: USize = -1) =>
"""
Add len iterated elements to the end of the list, starting from the given
offset.
"""
try
for i in Range(0, offset) do
if iter.has_next() then
iter.next()?
else
return
end
end
for i in Range(0, len) do
if iter.has_next() then
push(iter.next()?)
else
return
end
end
end
fun ref truncate(len: USize) =>
"""
Truncate the list to the given length, discarding excess elements.
If the list is already smaller than len, do nothing.
"""
try
while _size > len do
pop()?
end
end
fun clone(): List[this->A!]^ =>
"""
Clone the list.
"""
let out = List[this->A!]
for v in values() do
out.push(v)
end
out
fun map[B](f: {(this->A!): B^} box): List[B]^ =>
"""
Builds a new list by applying a function to every member of the list.
"""
try
_map[B](head()?, f, List[B])
else
List[B]
end
fun _map[B](
ln: this->ListNode[A],
f: {(this->A!): B^} box,
acc: List[B])
: List[B]^
=>
"""
Private helper for map, recursively working with ListNodes.
"""
try acc.push(f(ln()?)) end
try
_map[B](ln.next() as this->ListNode[A], f, acc)
else
acc
end
fun flat_map[B](f: {(this->A!): List[B]} box): List[B]^ =>
"""
Builds a new list by applying a function to every member of the list and
using the elements of the resulting lists.
"""
try
_flat_map[B](head()?, f, List[B])
else
List[B]
end
fun _flat_map[B](
ln: this->ListNode[A],
f: {(this->A!): List[B]} box,
acc: List[B]): List[B]^
=>
"""
Private helper for flat_map, recursively working with ListNodes.
"""
try acc.append_list(f(ln()?)) end
try
_flat_map[B](ln.next() as this->ListNode[A], f, acc)
else
acc
end
fun filter(f: {(this->A!): Bool} box): List[this->A!]^ =>
"""
Builds a new list with those elements that satisfy a provided predicate.
"""
try
_filter(head()?, f, List[this->A!])
else
List[this->A!]
end
fun _filter(
ln: this->ListNode[A],
f: {(this->A!): Bool} box,
acc: List[this->A!]): List[this->A!]
=>
"""
Private helper for filter, recursively working with ListNodes.
"""
try
let cur = ln()?
if f(cur) then acc.push(cur) end
end
try
_filter(ln.next() as this->ListNode[A], f, acc)
else
acc
end
fun fold[B](f: {(B!, this->A!): B^} box, acc: B): B =>
"""
Folds the elements of the list using the supplied function.
"""
let h = try
head()?
else
return acc
end
_fold[B](h, f, consume acc)
fun _fold[B](
ln: this->ListNode[A],
f: {(B!, this->A!): B^} box,
acc: B)
: B
=>
"""
Private helper for fold, recursively working with ListNodes.
"""
let nextAcc: B = try f(acc, ln()?) else consume acc end
let h = try
ln.next() as this->ListNode[A]
else
return nextAcc
end
_fold[B](h, f, consume nextAcc)
fun every(f: {(this->A!): Bool} box): Bool =>
"""
Returns true if every element satisfies the provided predicate, false
otherwise.
"""
try
_every(head()?, f)
else
true
end
fun _every(ln: this->ListNode[A], f: {(this->A!): Bool} box): Bool =>
"""
Private helper for every, recursively working with ListNodes.
"""
try
if not(f(ln()?)) then
false
else
_every(ln.next() as this->ListNode[A], f)
end
else
true
end
fun exists(f: {(this->A!): Bool} box): Bool =>
"""
Returns true if at least one element satisfies the provided predicate,
false otherwise.
"""
try
_exists(head()?, f)
else
false
end
fun _exists(ln: this->ListNode[A], f: {(this->A!): Bool} box): Bool =>
"""
Private helper for exists, recursively working with ListNodes.
"""
try
if f(ln()?) then
true
else
_exists(ln.next() as this->ListNode[A], f)
end
else
false
end
fun partition(
f: {(this->A!): Bool} box)
: (List[this->A!]^, List[this->A!]^)
=>
"""
Builds a pair of lists, the first of which is made up of the elements
satisfying the supplied predicate and the second of which is made up of
those that do not.
"""
let l1 = List[this->A!]
let l2 = List[this->A!]
for item in values() do
if f(item) then l1.push(item) else l2.push(item) end
end
(l1, l2)
fun drop(n: USize): List[this->A!]^ =>
"""
Builds a list by dropping the first n elements.
"""
let l = List[this->A!]
if size() > n then
try
var node = index(n)?
for i in Range(n, size()) do
l.push(node()?)
node = node.next() as this->ListNode[A]
end
end
end
l
fun take(n: USize): List[this->A!] =>
"""
Builds a list of the first n elements.
"""
let l = List[this->A!]
if size() > 0 then
try
var node = head()?
for i in Range(0, n.min(size())) do
l.push(node()?)
node = node.next() as this->ListNode[A]
end
end
end
l
fun take_while(f: {(this->A!): Bool} box): List[this->A!]^ =>
"""
Builds a list of elements satisfying the provided predicate until one does
not.
"""
let l = List[this->A!]
if size() > 0 then
try
var node = head()?
for i in Range(0, size()) do
let item = node()?
if f(item) then l.push(item) else return l end
node = node.next() as this->ListNode[A]
end
end
end
l
fun reverse(): List[this->A!]^ =>
"""
Builds a new list by reversing the elements in the list.
"""
try
_reverse(head()?, List[this->A!])
else
List[this->A!]
end
fun _reverse(ln: this->ListNode[A], acc: List[this->A!]): List[this->A!]^ =>
"""
Private helper for reverse, recursively working with ListNodes.
"""
try acc.unshift(ln()?) end
try
_reverse(ln.next() as this->ListNode[A], acc)
else
acc
end
fun contains[B: (A & HasEq[A!] #read) = A](a: box->B): Bool =>
"""
Returns true if the list contains the provided element, false otherwise.
"""
try
_contains[B](head()?, a)
else
false
end
fun _contains[B: (A & HasEq[A!] #read) = A](
ln: this->ListNode[A],
a: box->B)
: Bool
=>
"""
Private helper for contains, recursively working with ListNodes.
"""
try
if a == ln()? then
true
else
_contains[B](ln.next() as this->ListNode[A], a)
end
else
false
end
fun nodes(): ListNodes[A, this->ListNode[A]]^ =>
"""
Return an iterator on the nodes in the list.
"""
ListNodes[A, this->ListNode[A]](_head)
fun rnodes(): ListNodes[A, this->ListNode[A]]^ =>
"""
Return an iterator on the nodes in the list.
"""
ListNodes[A, this->ListNode[A]](_head, true)
fun values(): ListValues[A, this->ListNode[A]]^ =>
"""
Return an iterator on the values in the list.
"""
ListValues[A, this->ListNode[A]](_head)
fun rvalues(): ListValues[A, this->ListNode[A]]^ =>
"""
Return an iterator on the values in the list.
"""
ListValues[A, this->ListNode[A]](_head, true)
fun ref _increment() =>
_size = _size + 1
fun ref _decrement() =>
_size = _size - 1
fun ref _set_head(head': (ListNode[A] | None)) =>
_head = head'
fun ref _set_tail(tail': (ListNode[A] | None)) =>
_tail = tail'
fun ref _set_both(node: ListNode[A]) =>
node._set_list(this)
_head = node
_tail = node
_size = 1
class ListNodes[A, N: ListNode[A] #read] is Iterator[N]
"""
Iterate over the nodes in a list.
"""
var _next: (N | None)
let _reverse: Bool
new create(head: (N | None), reverse: Bool = false) =>
"""
Keep the next list node to be examined.
"""
_next = head
_reverse = reverse
fun has_next(): Bool =>
"""
If we have a list node, we have more values.
"""
_next isnt None
fun ref next(): N ? =>
"""
Get the list node and replace it with the next one.
"""
match _next
| let next': N =>
if _reverse then
_next = next'.prev()
else
_next = next'.next()
end
next'
else
error
end
class ListValues[A, N: ListNode[A] #read] is Iterator[N->A]
"""
Iterate over the values in a list.
"""
var _next: (N | None)
let _reverse: Bool
new create(head: (N | None), reverse: Bool = false) =>
"""
Keep the next list node to be examined.
"""
_next = head
_reverse = reverse
fun has_next(): Bool =>
"""
If we have a list node, we have more values.
"""
_next isnt None
fun ref next(): N->A ? =>
"""
Get the value of the list node and replace it with the next one.
"""
match _next
| let next': N =>
if _reverse then
_next = next'.prev()
else
_next = next'.next()
end
next'()?
else
error
end