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
|
datatype dlist'' t =
Nil
| Cons of t * source (dlist'' t)
datatype dlist' t =
Empty
| Nonempty of { Head : dlist'' t, Tail : source (source (dlist'' t)) }
con dlist t = source (dlist' t)
type position = transaction unit
fun headPos [t] (dl : dlist t) =
dl' <- get dl;
case dl' of
Nonempty { Head = Cons (_, tl), Tail = tl' } =>
cur <- get tl;
set dl (case cur of
Nil => Empty
| _ => Nonempty {Head = cur, Tail = tl'})
| _ => return ()
fun tailPos [t] (cur : source (dlist'' t)) new tail =
new' <- get new;
set cur new';
case new' of
Nil => set tail cur
| _ => return ()
val create [t] = source Empty
fun clear [t] (s : dlist t) = set s Empty
fun append [t] dl v =
dl' <- get dl;
case dl' of
Empty =>
tl <- source Nil;
tl' <- source tl;
set dl (Nonempty {Head = Cons (v, tl), Tail = tl'});
return (headPos dl)
| Nonempty {Tail = tl, ...} =>
cur <- get tl;
new <- source Nil;
set cur (Cons (v, new));
set tl new;
return (tailPos cur new tl)
fun replace [t] dl ls =
case ls of
[] => set dl Empty
| x :: ls =>
tl <- source Nil;
let
fun build ls acc =
case ls of
[] => return acc
| x :: ls =>
this <- source (Cons (x, acc));
build ls this
in
hd <- build (List.rev ls) tl;
tlS <- source tl;
set dl (Nonempty {Head = Cons (x, hd), Tail = tlS})
end
fun renderDyn [ctx] [ctx ~ [Dyn]] [t] (f : t -> position -> xml (ctx ++ [Dyn]) [] []) filter pos len dl = <xml>
<dyn signal={dl' <- signal dl;
case dl' of
Empty => return <xml/>
| Nonempty {Head = hd, Tail = tlTop} =>
let
fun render' prev dl'' len =
case len of
Some 0 => <xml/>
| _ =>
case dl'' of
Nil => <xml/>
| Cons (v, tl) =>
let
val pos = case prev of
None => headPos dl
| Some prev => tailPos prev tl tlTop
in
<xml>
<dyn signal={b <- filter v;
return <xml>
{if b then
f v pos
else
<xml/>}
<dyn signal={tl' <- signal tl;
return (render' (Some tl) tl'
(if b then
Option.mp (fn n => n - 1) len
else
len))}/>
</xml>}/>
</xml>
end
fun skip pos hd =
case pos of
0 => return hd
| _ =>
case hd of
Nil => return hd
| Cons (_, tl) =>
tl' <- signal tl;
skip (pos-1) tl'
in
case pos of
None => return (render' None hd len)
| Some pos =>
hd <- skip pos hd;
return (render' None hd len)
end}/>
</xml>
fun renderFlat [ctx] [ctx ~ [Dyn]] [t] (f : t -> position -> xml (ctx ++ [Dyn]) [] [])
: option int -> list (t * position) -> xml (ctx ++ [Dyn]) [] [] =
let
fun renderFlat' len ls =
case len of
Some 0 => <xml/>
| _ =>
case ls of
[] => <xml/>
| p :: ls =>
let
val len =
case len of
None => None
| Some n => Some (n - 1)
in
<xml>{f p.1 p.2}{renderFlat' len ls}</xml>
end
in
renderFlat'
end
val split [t] =
let
fun split' acc (ls : list t) =
case ls of
[] => acc
| x1 :: [] => (x1 :: acc.1, acc.2)
| x1 :: x2 :: ls => split' (x1 :: acc.1, x2 :: acc.2) ls
in
split' ([], [])
end
fun merge [t] (cmp : t -> t -> signal bool) =
let
fun merge' acc (ls1 : list t) (ls2 : list t) =
case (ls1, ls2) of
([], _) => return (List.revAppend acc ls2)
| (_, []) => return (List.revAppend acc ls1)
| (x1 :: ls1', x2 :: ls2') =>
b <- cmp x1 x2;
if b then
merge' (x1 :: acc) ls1' ls2
else
merge' (x2 :: acc) ls1 ls2'
in
merge' []
end
fun sort [t] (cmp : t -> t -> signal bool) =
let
fun sort' (ls : list t) =
case ls of
[] => return ls
| _ :: [] => return ls
| _ =>
let
val (ls1, ls2) = split ls
in
ls1' <- sort' ls1;
ls2' <- sort' ls2;
merge cmp ls1' ls2'
end
in
sort'
end
fun render [ctx] [ctx ~ [Dyn]] [t] f (r : {Filter : t -> signal bool,
Sort : signal (option (t -> t -> signal bool)),
StartPosition : signal (option int),
MaxLength : signal (option int)}) dl = <xml>
<dyn signal={len <- r.MaxLength;
cmp <- r.Sort;
pos <- r.StartPosition;
case cmp of
None => return (renderDyn f r.Filter pos len dl)
| Some cmp =>
dl' <- signal dl;
elems <- (case dl' of
Empty => return []
| Nonempty {Head = hd, Tail = tlTop} =>
let
fun listOut prev dl'' acc =
case dl'' of
Nil => return acc
| Cons (v, tl) =>
let
val pos = case prev of
None => headPos dl
| Some prev => tailPos prev tl tlTop
in
b <- r.Filter v;
tl' <- signal tl;
listOut (Some tl) tl' (if b then
(v, pos) :: acc
else
acc)
end
in
listOut None hd []
end);
elems <- sort (fn v1 v2 => cmp v1.1 v2.1) elems;
let
fun skip n ls =
case (n, ls) of
(0, _) => ls
| (n, _ :: ls) => skip (n-1) ls
| (_, []) => []
val elems =
case pos of
None => elems
| Some pos => skip pos elems
in
return (renderFlat f len elems)
end}/>
</xml>
fun delete pos = pos
fun elements' [t] (dl'' : dlist'' t) : signal (list t) =
case dl'' of
Nil => return []
| Cons (x, dl'') =>
dl'' <- signal dl'';
tl <- elements' dl'';
return (x :: tl)
fun elements [t] (dl : dlist t) : signal (list t) =
dl' <- signal dl;
case dl' of
Empty => return []
| Nonempty {Head = hd, ...} => elements' hd
fun size' [t] (dl'' : dlist'' t) : signal int =
case dl'' of
Nil => return 0
| Cons (x, dl'') =>
dl'' <- signal dl'';
n <- size' dl'';
return (n + 1)
fun size [t] (dl : dlist t) : signal int =
dl' <- signal dl;
case dl' of
Empty => return 0
| Nonempty {Head = hd, ...} => size' hd
fun numPassing' [t] (f : t -> signal bool) (dl'' : dlist'' t) : signal int =
case dl'' of
Nil => return 0
| Cons (x, dl'') =>
b <- f x;
dl'' <- signal dl'';
n <- numPassing' f dl'';
return (if b then n + 1 else n)
fun numPassing [t] (f : t -> signal bool) (dl : dlist t) : signal int =
dl' <- signal dl;
case dl' of
Empty => return 0
| Nonempty {Head = hd, ...} => numPassing' f hd
fun foldl [t] [acc] (f : t -> acc -> signal acc) =
let
fun foldl'' (i : acc) (dl : dlist'' t) : signal acc =
case dl of
Nil => return i
| Cons (v, dl') =>
dl' <- signal dl';
i' <- f v i;
foldl'' i' dl'
fun foldl' (i : acc) (dl : dlist t) : signal acc =
dl <- signal dl;
case dl of
Empty => return i
| Nonempty {Head = dl, ...} => foldl'' i dl
in
foldl'
end
|
