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
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01//EN" "http://www.w3.org/TR/html4/strict.dtd">
<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
<title>Mu - 064list.mu</title>
<meta name="Generator" content="Vim/7.4">
<meta name="plugin-version" content="vim7.4_v2">
<meta name="syntax" content="none">
<meta name="settings" content="use_css,pre_wrap,no_foldcolumn,expand_tabs,prevent_copy=">
<meta name="colorscheme" content="minimal">
<style type="text/css">
<!--
pre { white-space: pre-wrap; font-family: monospace; color: #eeeeee; background-color: #080808; }
body { font-size: 12pt; font-family: monospace; color: #eeeeee; background-color: #080808; }
* { font-size: 12pt; font-size: 1em; }
.muData { color: #ffff00; }
.muControl { color: #c0a020; }
.Delimiter { color: #800080; }
.Comment { color: #9090ff; }
.Constant { color: #00a0a0; }
.Special { color: #c00000; }
.muRecipe { color: #ff8700; }
.muScenario { color: #00af00; }
-->
</style>
<script type='text/javascript'>
<!--
-->
</script>
</head>
<body>
<pre id='vimCodeElement'>
<span class="Comment"># A list links up multiple objects together to make them easier to manage.</span>
<span class="Comment">#</span>
<span class="Comment"># The objects must be of the same type. If you want to store multiple types in</span>
<span class="Comment"># a single list, use an exclusive-container.</span>
<span class="muData">container</span> list:_elem [
value:_elem
next:&:list:_elem
]
<span class="muRecipe">def</span> push x:_elem, l:&:list:_elem<span class="muRecipe"> -> </span>l:&:list:_elem [
<span class="Constant">local-scope</span>
<span class="Constant">load-ingredients</span>
result:&:list:_elem <span class="Special"><-</span> new <span class="Delimiter">{</span>(list _elem): type<span class="Delimiter">}</span>
*result <span class="Special"><-</span> merge x, l
<span class="muControl">reply</span> result
]
<span class="muRecipe">def</span> first in:&:list:_elem<span class="muRecipe"> -> </span>result:_elem [
<span class="Constant">local-scope</span>
<span class="Constant">load-ingredients</span>
result <span class="Special"><-</span> get *in, <span class="Constant">value:offset</span>
]
<span class="muRecipe">def</span> rest in:&:list:_elem<span class="muRecipe"> -> </span>result:&:list:_elem/contained-in:in [
<span class="Constant">local-scope</span>
<span class="Constant">load-ingredients</span>
result <span class="Special"><-</span> get *in, <span class="Constant">next:offset</span>
]
<span class="muScenario">scenario</span> list-handling [
run [
<span class="Constant">local-scope</span>
x:&:list:num <span class="Special"><-</span> push<span class="Constant"> 3</span>,<span class="Constant"> 0</span>
x <span class="Special"><-</span> push<span class="Constant"> 4</span>, x
x <span class="Special"><-</span> push<span class="Constant"> 5</span>, x
10:num/<span class="Special">raw</span> <span class="Special"><-</span> first x
x <span class="Special"><-</span> rest x
11:num/<span class="Special">raw</span> <span class="Special"><-</span> first x
x <span class="Special"><-</span> rest x
12:num/<span class="Special">raw</span> <span class="Special"><-</span> first x
20:&:list:num/<span class="Special">raw</span> <span class="Special"><-</span> rest x
]
memory-should-contain [
<span class="Constant"> 10</span> <span class="Special"><-</span><span class="Constant"> 5</span>
<span class="Constant"> 11</span> <span class="Special"><-</span><span class="Constant"> 4</span>
<span class="Constant"> 12</span> <span class="Special"><-</span><span class="Constant"> 3</span>
<span class="Constant"> 20</span> <span class="Special"><-</span><span class="Constant"> 0</span> <span class="Comment"># nothing left</span>
]
]
<span class="muRecipe">def</span> length l:&:list:_elem<span class="muRecipe"> -> </span>result:num [
<span class="Constant">local-scope</span>
<span class="Constant">load-ingredients</span>
<span class="muControl">return-unless</span> l,<span class="Constant"> 0</span>
rest:&:list:_elem <span class="Special"><-</span> rest l
length-of-rest:num <span class="Special"><-</span> length rest
result <span class="Special"><-</span> add length-of-rest,<span class="Constant"> 1</span>
]
<span class="Comment"># insert 'x' after 'in'</span>
<span class="muRecipe">def</span> insert x:_elem, in:&:list:_elem<span class="muRecipe"> -> </span>in:&:list:_elem [
<span class="Constant">local-scope</span>
<span class="Constant">load-ingredients</span>
new-node:&:list:_elem <span class="Special"><-</span> new <span class="Delimiter">{</span>(list _elem): type<span class="Delimiter">}</span>
*new-node <span class="Special"><-</span> put *new-node, <span class="Constant">value:offset</span>, x
next-node:&:list:_elem <span class="Special"><-</span> get *in, <span class="Constant">next:offset</span>
*in <span class="Special"><-</span> put *in, <span class="Constant">next:offset</span>, new-node
*new-node <span class="Special"><-</span> put *new-node, <span class="Constant">next:offset</span>, next-node
]
<span class="muScenario">scenario</span> inserting-into-list [
<span class="Constant">local-scope</span>
list:&:list:char <span class="Special"><-</span> push<span class="Constant"> 3</span>,<span class="Constant"> 0</span>
list <span class="Special"><-</span> push<span class="Constant"> 4</span>, list
list <span class="Special"><-</span> push<span class="Constant"> 5</span>, list
run [
list2:&:list:char <span class="Special"><-</span> rest list <span class="Comment"># inside list</span>
list2 <span class="Special"><-</span> insert<span class="Constant"> 6</span>, list2
<span class="Comment"># check structure</span>
list2 <span class="Special"><-</span> copy list
10:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
list2 <span class="Special"><-</span> rest list2
11:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
list2 <span class="Special"><-</span> rest list2
12:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
list2 <span class="Special"><-</span> rest list2
13:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
]
memory-should-contain [
<span class="Constant"> 10</span> <span class="Special"><-</span><span class="Constant"> 5</span> <span class="Comment"># scanning next</span>
<span class="Constant"> 11</span> <span class="Special"><-</span><span class="Constant"> 4</span>
<span class="Constant"> 12</span> <span class="Special"><-</span><span class="Constant"> 6</span> <span class="Comment"># inserted element</span>
<span class="Constant"> 13</span> <span class="Special"><-</span><span class="Constant"> 3</span>
]
]
<span class="muScenario">scenario</span> inserting-at-end-of-list [
<span class="Constant">local-scope</span>
list:&:list:char <span class="Special"><-</span> push<span class="Constant"> 3</span>,<span class="Constant"> 0</span>
list <span class="Special"><-</span> push<span class="Constant"> 4</span>, list
list <span class="Special"><-</span> push<span class="Constant"> 5</span>, list
run [
list2:&:list:char <span class="Special"><-</span> rest list <span class="Comment"># inside list</span>
list2 <span class="Special"><-</span> rest list2 <span class="Comment"># now at end of list</span>
list2 <span class="Special"><-</span> insert<span class="Constant"> 6</span>, list2
<span class="Comment"># check structure like before</span>
list2 <span class="Special"><-</span> copy list
10:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
list2 <span class="Special"><-</span> rest list2
11:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
list2 <span class="Special"><-</span> rest list2
12:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
list2 <span class="Special"><-</span> rest list2
13:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
]
memory-should-contain [
<span class="Constant"> 10</span> <span class="Special"><-</span><span class="Constant"> 5</span> <span class="Comment"># scanning next</span>
<span class="Constant"> 11</span> <span class="Special"><-</span><span class="Constant"> 4</span>
<span class="Constant"> 12</span> <span class="Special"><-</span><span class="Constant"> 3</span>
<span class="Constant"> 13</span> <span class="Special"><-</span><span class="Constant"> 6</span> <span class="Comment"># inserted element</span>
]
]
<span class="muScenario">scenario</span> inserting-after-start-of-list [
<span class="Constant">local-scope</span>
list:&:list:char <span class="Special"><-</span> push<span class="Constant"> 3</span>,<span class="Constant"> 0</span>
list <span class="Special"><-</span> push<span class="Constant"> 4</span>, list
list <span class="Special"><-</span> push<span class="Constant"> 5</span>, list
run [
list <span class="Special"><-</span> insert<span class="Constant"> 6</span>, list
<span class="Comment"># check structure like before</span>
list2:&:list:char <span class="Special"><-</span> copy list
10:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
list2 <span class="Special"><-</span> rest list2
11:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
list2 <span class="Special"><-</span> rest list2
12:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
list2 <span class="Special"><-</span> rest list2
13:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
]
memory-should-contain [
<span class="Constant"> 10</span> <span class="Special"><-</span><span class="Constant"> 5</span> <span class="Comment"># scanning next</span>
<span class="Constant"> 11</span> <span class="Special"><-</span><span class="Constant"> 6</span> <span class="Comment"># inserted element</span>
<span class="Constant"> 12</span> <span class="Special"><-</span><span class="Constant"> 4</span>
<span class="Constant"> 13</span> <span class="Special"><-</span><span class="Constant"> 3</span>
]
]
<span class="Comment"># remove 'x' from its surrounding list 'in'</span>
<span class="Comment">#</span>
<span class="Comment"># Returns null if and only if list is empty. Beware: in that case any other</span>
<span class="Comment"># pointers to the head are now invalid.</span>
<span class="muRecipe">def</span> remove x:&:list:_elem/contained-in:in, in:&:list:_elem<span class="muRecipe"> -> </span>in:&:list:_elem [
<span class="Constant">local-scope</span>
<span class="Constant">load-ingredients</span>
<span class="Comment"># if 'x' is null, return</span>
<span class="muControl">return-unless</span> x
next-node:&:list:_elem <span class="Special"><-</span> rest x
<span class="Comment"># clear next pointer of 'x'</span>
*x <span class="Special"><-</span> put *x, <span class="Constant">next:offset</span>,<span class="Constant"> 0</span>
<span class="Comment"># if 'x' is at the head of 'in', return the new head</span>
at-head?:bool <span class="Special"><-</span> equal x, in
<span class="muControl">return-if</span> at-head?, next-node
<span class="Comment"># compute prev-node</span>
prev-node:&:list:_elem <span class="Special"><-</span> copy in
curr:&:list:_elem <span class="Special"><-</span> rest prev-node
<span class="Delimiter">{</span>
<span class="muControl">return-unless</span> curr
found?:bool <span class="Special"><-</span> equal curr, x
<span class="muControl">break-if</span> found?
prev-node <span class="Special"><-</span> copy curr
curr <span class="Special"><-</span> rest curr
<span class="Delimiter">}</span>
<span class="Comment"># set its next pointer to skip 'x'</span>
*prev-node <span class="Special"><-</span> put *prev-node, <span class="Constant">next:offset</span>, next-node
]
<span class="muScenario">scenario</span> removing-from-list [
<span class="Constant">local-scope</span>
list:&:list:char <span class="Special"><-</span> push<span class="Constant"> 3</span>,<span class="Constant"> 0</span>
list <span class="Special"><-</span> push<span class="Constant"> 4</span>, list
list <span class="Special"><-</span> push<span class="Constant"> 5</span>, list
run [
list2:&:list:char <span class="Special"><-</span> rest list <span class="Comment"># second element</span>
list <span class="Special"><-</span> remove list2, list
10:bool/<span class="Special">raw</span> <span class="Special"><-</span> equal list2,<span class="Constant"> 0</span>
<span class="Comment"># check structure like before</span>
list2 <span class="Special"><-</span> copy list
11:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
list2 <span class="Special"><-</span> rest list2
12:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
20:&:list:char/<span class="Special">raw</span> <span class="Special"><-</span> rest list2
]
memory-should-contain [
<span class="Constant"> 10</span> <span class="Special"><-</span><span class="Constant"> 0</span> <span class="Comment"># remove returned non-null</span>
<span class="Constant"> 11</span> <span class="Special"><-</span><span class="Constant"> 5</span> <span class="Comment"># scanning next, skipping deleted element</span>
<span class="Constant"> 12</span> <span class="Special"><-</span><span class="Constant"> 3</span>
<span class="Constant"> 20</span> <span class="Special"><-</span><span class="Constant"> 0</span> <span class="Comment"># no more elements</span>
]
]
<span class="muScenario">scenario</span> removing-from-start-of-list [
<span class="Constant">local-scope</span>
list:&:list:char <span class="Special"><-</span> push<span class="Constant"> 3</span>,<span class="Constant"> 0</span>
list <span class="Special"><-</span> push<span class="Constant"> 4</span>, list
list <span class="Special"><-</span> push<span class="Constant"> 5</span>, list
run [
list <span class="Special"><-</span> remove list, list
<span class="Comment"># check structure like before</span>
list2:&:list:char <span class="Special"><-</span> copy list
10:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
list2 <span class="Special"><-</span> rest list2
11:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
20:&:list:char/<span class="Special">raw</span> <span class="Special"><-</span> rest list2
]
memory-should-contain [
<span class="Constant"> 10</span> <span class="Special"><-</span><span class="Constant"> 4</span> <span class="Comment"># scanning next, skipping deleted element</span>
<span class="Constant"> 11</span> <span class="Special"><-</span><span class="Constant"> 3</span>
<span class="Constant"> 20</span> <span class="Special"><-</span><span class="Constant"> 0</span> <span class="Comment"># no more elements</span>
]
]
<span class="muScenario">scenario</span> removing-from-end-of-list [
<span class="Constant">local-scope</span>
list:&:list:char <span class="Special"><-</span> push<span class="Constant"> 3</span>,<span class="Constant"> 0</span>
list <span class="Special"><-</span> push<span class="Constant"> 4</span>, list
list <span class="Special"><-</span> push<span class="Constant"> 5</span>, list
run [
<span class="Comment"># delete last element</span>
list2:&:list:char <span class="Special"><-</span> rest list
list2 <span class="Special"><-</span> rest list2
list <span class="Special"><-</span> remove list2, list
10:bool/<span class="Special">raw</span> <span class="Special"><-</span> equal list2,<span class="Constant"> 0</span>
<span class="Comment"># check structure like before</span>
list2 <span class="Special"><-</span> copy list
11:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
list2 <span class="Special"><-</span> rest list2
12:char/<span class="Special">raw</span> <span class="Special"><-</span> first list2
20:&:list:char/<span class="Special">raw</span> <span class="Special"><-</span> rest list2
]
memory-should-contain [
<span class="Constant"> 10</span> <span class="Special"><-</span><span class="Constant"> 0</span> <span class="Comment"># remove returned non-null</span>
<span class="Constant"> 11</span> <span class="Special"><-</span><span class="Constant"> 5</span> <span class="Comment"># scanning next, skipping deleted element</span>
<span class="Constant"> 12</span> <span class="Special"><-</span><span class="Constant"> 4</span>
<span class="Constant"> 20</span> <span class="Special"><-</span><span class="Constant"> 0</span> <span class="Comment"># no more elements</span>
]
]
<span class="muScenario">scenario</span> removing-from-singleton-list [
<span class="Constant">local-scope</span>
list:&:list:char <span class="Special"><-</span> push<span class="Constant"> 3</span>,<span class="Constant"> 0</span>
run [
list <span class="Special"><-</span> remove list, list
1:num/<span class="Special">raw</span> <span class="Special"><-</span> copy list
]
memory-should-contain [
<span class="Constant"> 1</span> <span class="Special"><-</span><span class="Constant"> 0</span> <span class="Comment"># back to an empty list</span>
]
]
<span class="Comment"># reverse the elements of a list</span>
<span class="Comment"># (contributed by Caleb Couch)</span>
<span class="muRecipe">def</span> reverse list:&:list:_elem temp:&:list:_elem/contained-in:result<span class="muRecipe"> -> </span>result:&:list:_elem [
<span class="Constant">local-scope</span>
<span class="Constant">load-ingredients</span>
<span class="muControl">reply-unless</span> list, temp
object:_elem <span class="Special"><-</span> first, list
list <span class="Special"><-</span> rest list
temp <span class="Special"><-</span> push object, temp
result <span class="Special"><-</span> reverse list, temp
]
<span class="muScenario">scenario</span> reverse-list [
<span class="Constant">local-scope</span>
list:&:list:number <span class="Special"><-</span> push<span class="Constant"> 1</span>,<span class="Constant"> 0</span>
list <span class="Special"><-</span> push<span class="Constant"> 2</span>, list
list <span class="Special"><-</span> push<span class="Constant"> 3</span>, list
run [
stash <span class="Constant">[list:]</span>, list
list <span class="Special"><-</span> reverse list
stash <span class="Constant">[reversed:]</span>, list
]
trace-should-contain [
app: list:<span class="Constant"> 3</span><span class="muRecipe"> -> </span>2<span class="muRecipe"> -> </span>1
app: reversed:<span class="Constant"> 1</span><span class="muRecipe"> -> </span>2<span class="muRecipe"> -> </span>3
]
]
<span class="muRecipe">def</span> to-text in:&:list:_elem<span class="muRecipe"> -> </span>result:text [
<span class="Constant">local-scope</span>
<span class="Constant">load-ingredients</span>
buf:&:buffer <span class="Special"><-</span> new-buffer<span class="Constant"> 80</span>
buf <span class="Special"><-</span> to-buffer in, buf
result <span class="Special"><-</span> buffer-to-array buf
]
<span class="Comment"># variant of 'to-text' which stops printing after a few elements (and so is robust to cycles)</span>
<span class="muRecipe">def</span> to-text-line in:&:list:_elem<span class="muRecipe"> -> </span>result:text [
<span class="Constant">local-scope</span>
<span class="Constant">load-ingredients</span>
buf:&:buffer <span class="Special"><-</span> new-buffer<span class="Constant"> 80</span>
buf <span class="Special"><-</span> to-buffer in, buf,<span class="Constant"> 6</span> <span class="Comment"># max elements to display</span>
result <span class="Special"><-</span> buffer-to-array buf
]
<span class="muRecipe">def</span> to-buffer in:&:list:_elem, buf:&:buffer<span class="muRecipe"> -> </span>buf:&:buffer [
<span class="Constant">local-scope</span>
<span class="Constant">load-ingredients</span>
<span class="Delimiter">{</span>
<span class="muControl">break-if</span> in
buf <span class="Special"><-</span> append buf, <span class="Constant">[[]</span>]
<span class="muControl">return</span>
<span class="Delimiter">}</span>
<span class="Comment"># append in.value to buf</span>
val:_elem <span class="Special"><-</span> get *in, <span class="Constant">value:offset</span>
buf <span class="Special"><-</span> append buf, val
<span class="Comment"># now prepare next</span>
next:&:list:_elem <span class="Special"><-</span> rest in
nextn:num <span class="Special"><-</span> copy next
<span class="muControl">return-unless</span> next
buf <span class="Special"><-</span> append buf, <span class="Constant">[ -> ]</span>
<span class="Comment"># and recurse</span>
remaining:num, optional-ingredient-found?:bool <span class="Special"><-</span> <span class="Constant">next-ingredient</span>
<span class="Delimiter">{</span>
<span class="muControl">break-if</span> optional-ingredient-found?
<span class="Comment"># unlimited recursion</span>
buf <span class="Special"><-</span> to-buffer next, buf
<span class="muControl">return</span>
<span class="Delimiter">}</span>
<span class="Delimiter">{</span>
<span class="muControl">break-unless</span> remaining
<span class="Comment"># limited recursion</span>
remaining <span class="Special"><-</span> subtract remaining,<span class="Constant"> 1</span>
buf <span class="Special"><-</span> to-buffer next, buf, remaining
<span class="muControl">return</span>
<span class="Delimiter">}</span>
<span class="Comment"># past recursion depth; insert ellipses and stop</span>
append buf, <span class="Constant">[...]</span>
]
<span class="muScenario">scenario</span> stash-empty-list [
<span class="Constant">local-scope</span>
x:&:list:num <span class="Special"><-</span> copy<span class="Constant"> 0</span>
run [
stash x
]
trace-should-contain [
app: <span class="Constant">[]</span>
]
]
</pre>
</body>
</html>
<!-- vim: set foldmethod=manual : -->
|