-
Notifications
You must be signed in to change notification settings - Fork 15
/
Copy pathIntrusiveDeque.mpl
353 lines (314 loc) · 8.07 KB
/
IntrusiveDeque.mpl
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
# Copyright (C) Matway Burkow
#
# This repository and all its contents belong to Matway Burkow (referred here and below as "the owner").
# The content is for demonstration purposes only.
# It is forbidden to use the content or any part of it for any purpose without explicit permission from the owner.
# By contributing to the repository, contributors acknowledge that ownership of their work transfers to the owner.
"control.Ref" use
"control.assert" use
"control.dup" use
"control.ensure" use
"control.nil?" use
"control.when" use
"control.while" use
# Intrusive doubly linked list
# Requires item objects to have fields 'prev' and 'next' of type '[Item] Mref'
IntrusiveDeque: [
Item:;
{
SCHEMA_NAME: "IntrusiveDeque<" @Item schemaName & ">" & virtual;
INIT: [clear];
DIE: [];
empty?: [@first nil?];
append: [
item:;
@last @item.@prev.set
@Item @item.@next.set
@last nil? [
[@first nil?] "invalid linked list state" assert
@item !first
] [
[@last.next nil?] "invalid linked list state" assert
@item @last.@next.set
] if
@item !last
];
appendAll: [
other:;
otherFirst: @other.@first;
@otherFirst nil? ~ [
@last nil? [
[@first nil?] "invalid linked list state" assert
@otherFirst !first
] [
[@otherFirst.prev nil?] "invalid linked list state" assert
@last @otherFirst.@prev.set
[@last.next nil?] "invalid linked list state" assert
@otherFirst @last.@next.set
] if
[other.@last nil? ~] "invalid linked list state" assert
@other.@last !last
@Item @other.!first
@Item @other.!last
] when
];
clear: [
@Item !first
@Item !last
];
cut: [
item:;
prev: @item.prev;
next: @item.next;
@prev nil? [
[@first @item is] "invalid linked list state" assert
@next !first
] [
[@prev.next @item is] "invalid linked list state" assert
@next @prev.@next.set
] if
@next nil? [
[@last @item is] "invalid linked list state" assert
@prev !last
] [
[@next.prev @item is] "invalid linked list state" assert
@prev @next.@prev.set
] if
];
cutAllIf: [
body:;
count: 0;
empty? ~ [
item: @first;
skip: FALSE;
@item @body call [
[
count 1 + !count
prev: @item;
@item.next !item
@item nil? [
@Item !first
[@last @prev is] "invalid linked list state" assert
@Item !last
TRUE !skip
FALSE
] [
@item @body call dup ~ [
@item !first
[@item.prev @prev is] "invalid linked list state" assert
@Item @item.@prev.set
] when
] if
] loop
] when
[skip ~] [
lastToKeep: @item;
[
@item.next !item
@item nil? [
TRUE !skip
FALSE
] [
@item @body call ~ dup [
@item !lastToKeep
] when
] if
] loop
skip ~ [
[
count 1 + !count
prev: @item;
@item.next !item
@item nil? [
@Item @lastToKeep.@next.set
[@last @prev is] "invalid linked list state" assert
@lastToKeep !last
TRUE !skip
FALSE
] [
@item @body call dup ~ [
@item @lastToKeep.@next.set
[@item.prev @prev is] "invalid linked list state" assert
@lastToKeep @item.@prev.set
] when
] if
] loop
] when
] while
] when
count
];
cutFirst: [
[empty? ~] "deque is empty" assert
item: @first;
@item.next !first
@first nil? [
[@last @item is] "invalid linked list state" assert
@Item !last
] [
[@first.prev @item is] "invalid linked list state" assert
@Item @first.@prev.set
] if
];
cutIf: [
body:;
count: 0;
empty? ~ [
item: @first;
@item @body call [
1 !count
cutFirst
] [
[
prev: @item;
@item.next !item
@item nil? [FALSE] [
@item @body call ~ dup ~ [
1 !count
next: @item.next;
@next @prev.@next.set
@next nil? [
[@last @item is] "invalid linked list state" assert
@prev !last
] [
[@next.prev @item is] "invalid linked list state" assert
@prev @next.@prev.set
] if
] when
] if
] loop
] if
] when
count
];
cutLast: [
[empty? ~] "deque is empty" assert
prev: @last.prev;
@prev nil? [
[@first @last is] "invalid linked list state" assert
@Item !first
] [
[@prev.next @last is] "invalid linked list state" assert
@Item @prev.@next.set
] if
@prev !last
];
cutLastIf: [
body:;
count: 0;
empty? ~ [
item: @last;
@item @body call [
1 !count
cutLast
] [
[
next: @item;
@item.prev !item
@item nil? [FALSE] [
@item @body call ~ dup ~ [
1 !count
prev: @item.prev;
@prev nil? [
[@first @item is] "invalid linked list state" assert
@next !first
] [
[@prev.next @item is] "invalid linked list state" assert
@next @prev.@next.set
] if
@prev @next.@prev.set
] when
] if
] loop
] if
] when
count
];
iter: [{
Item: virtual @Item Ref;
item: @first;
next: [
@item nil? [@Item FALSE] [
@item
@item.next !item
TRUE
] if
];
}];
popFirst: [
[empty? ~] "deque is empty" assert
@first
cutFirst
];
popLast: [
[empty? ~] "deque is empty" assert
@last
cutLast
];
prepend: [
item:;
next: @first;
@Item @item.@prev.set
@next @item.@next.set
@item !first
@next nil? [
[@last nil?] "invalid linked list state" assert
@item !last
] [
[@next.prev nil?] "invalid linked list state" assert
@item @next.@prev.set
] if
];
reverse: [
empty? ~ [
item: @first.next;
@item nil? ~ [
prev: @first;
[@prev.prev @Item is] "invalid linked list state" assert
@item @prev.@prev.set
@Item @prev.@next.set
[
next: @item.next;
[@item.prev @prev is] "invalid linked list state" assert
@next @item.@prev.set
@prev @item.@next.set
@next nil? ~ dup [
@item !prev
@next !item
] when
] loop
firstItem: @first;
@item !first
[@last @item is] "invalid linked list state" assert
@firstItem !last
] when
] when
];
reverseIter: [{
Item: virtual @Item Ref;
item: @last;
next: [
@item nil? [@Item FALSE] [
@item
@item.prev !item
TRUE
] if
];
}];
validate: [
DEBUG [
item: @Item;
next: @first;
[@next nil? ~] [
[@next.prev @item is] "invalid linked list state" ensure
@next !item
@next.next !next
] while
[@last @item is] "invalid linked list state" ensure
] when
];
Item: @Item Ref virtual;
first: @Item;
last: @Item;
}
];