-
Notifications
You must be signed in to change notification settings - Fork 125
/
textralist.opa
521 lines (480 loc) · 16.3 KB
/
textralist.opa
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
/*
Copyright © 2011 MLstate
This file is part of OPA.
OPA is free software: you can redistribute it and/or modify it under the
terms of the GNU Affero General Public License, version 3, as published by
the Free Software Foundation.
OPA is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for
more details.
You should have received a copy of the GNU Affero General Public License
along with OPA. If not, see <http://www.gnu.org/licenses/>.
*/
/*
@authors Matthieu Guffroy, Frédéric Ye, Corentin Gallet
**/
/**
* {1 About this module}
*
* RA lists of AVLs.
* `RA' stands for "Random Access".
*
* {1 Where should I start?}
*
* The lists are ascending, but only one element for two ; the second is always a single leaf-tree.
* So 1-1-1-2-1-3-1-7 is okay.
*
* They can't be two elements h>1, they have to be merged.
* 1-1-4-1-4 -> 1-1-5
*
* And no h=1 element at the end of a list with elements h>1 :
* 1-2-1-3-6-1 is not okay, since the last tree will never be merged.
*
* 4 h=1 elements must be merged :
* 1-1-1-1 -> 1-2.
*
* Beware : some RA lists are reversed here.
*
* {1 What if I need more?}
*/
/**
* {1 Types defined in this module}
*/
type textralist = list(textavl)
/* disabled :
type Textralist('a,'b,'c,'d) =
{{
Internal_module : Textavl('a,'b,'c,'d)
check_text : textralist -> int -> string
dot_graph : textralist -> int -> string -> string -> string
empty : textralist
get : textralist -> int -> Unicode.character
head : textralist -> textavl
insert_aux_avls_into_avls : textralist -> textralist -> int -> textralist
insert_aux_avls_into_avls_rev : textralist -> textralist -> int -> textralist
insert_aux_str_into_avls : textralist -> string -> int -> textralist
insert_aux_str_into_avls_rev : textralist -> string -> int -> textralist
insert_str_to_the_left : textralist -> string -> int -> textralist
insert_str_to_the_left_rev : textralist -> string -> int -> textralist
length : textralist -> int
lowercase : textralist -> textralist
next : textralist -> textralist
raconcat : textavl -> textralist -> textavl
raregroup : textralist -> textralist
raregroup_rev : textralist -> textralist
reverse : textralist -> textralist
rstart : textralist -> (Unicode.character, string, textralist, list(textavl))
start : textralist -> (Unicode.character, string, textralist, list(textavl))
sub : textralist -> int -> int -> textralist
sub_rev : textralist -> int -> int -> textralist
to_list : textralist -> list(string)
to_string : textralist -> string
uppercase : textralist -> textralist
//mapc : textralist -> (Unicode.character -> Unicode.character) -> textralist
//next_node : seq('data) -> seq('data)
}}
*/
/*type asciitextralist = textralist
type utf8camotextralist = textralist(utf8camotextavl)
type utf8eucatextralist = textralist*/
type utf8cacttextralist = textralist
/**
* {1 Interface}
*/
Make_textralist/*(Textavl:Textavl)*/ =
//Textavl = Utf8cact_textavl
{{
/*
** Internal_module : Allow the module Text to directly use Textavl.
*/
Internal_module = Textavl;
/*
** empty
** Build an empty list.
*/
empty = [] : textralist
/*
** raregroup()
** Return a valid RA-list.
*/
raregroup(lavl) =
rec raregroup_aux(lavl, n) =
match lavl : textralist with
| [] ->
[] : textralist
| [hd1 | tl1] ->
(hei1 = Textavl.sizetr(hd1);
match tl1 : textralist with
| [] ->
lavl : textralist
| [hd2 | tl2] ->
(hei2 = Textavl.sizetr(hd2);
match tl2:textralist with
| [] ->
if ((hei1 > 1) && (hei2 > 1)) then
[Textavl.merge_avl_nn(hd1, hd2)]:textralist
/* Case 1 : two trees. Merge the two.*/
else if ((hei2 == 1) && (n >= 3)) then
[Textavl.merge_avl_nn(hd1, hd2)]:textralist
/* Case 2 : ending h=1 element. Merging.*/
else
lavl
/* Case 3 : okay.*/
| [ hd3 | tl3] ->
hei3 = Textavl.sizetr(hd3);
if ((hei1 > 1) && (hei2 == 1) && (hei3 > hei1)) then
List.cons(hd1, raregroup_aux(tl1, 10)):textralist
/* Case 4 : tree. Okay.*/
else if ((hei1 == 1) && (hei2 > 1) && (hei3 == 1)) then
List.cons(hd1, raregroup_aux(tl1, n + 1)):textralist
/* Case 5 : h=1 element. Okay.*/
else if ((hei1 == 1) && (hei2 == 1) && (n == 1)) then
List.cons(hd1, raregroup_aux(tl1, n + 1)):textralist
/* Case 6 : First h=1 elements. Okay.*/
else if ((hei1 > 1) && (hei2 == 1) && (hei3 == hei1)) then
raregroup_aux(List.cons(Textavl.create_node(hd1, Textavl.value(hd2), hd3), tl3):textralist, 10)
/* Case 7 : merging two trees of the same height.*/
else if ((hei1 == 1) && (hei2 == 1) && (hei3 == 1) && (n == 2)) then
raregroup_aux(List.cons(Textavl.create_node(hd1, Textavl.value(hd2), hd3), tl3):textralist, 10)
/* Case 8 : Merging the h=1 elements of the start.*/
else if ((hei1 > 1) && (hei2 == 1)) then
raregroup_aux(List.cons(Textavl.merge_avl_nn(Textavl.merge_avl_nn(hd1, hd2), hd3), tl3):textralist, 10)
/* Case 9 : Merging the 3 elements.*/
else if (hei1 > 1) then
raregroup_aux(List.cons(Textavl.merge_avl_nn(hd1, hd2), tl2):textralist, 10)
/* Case 10 : Merging the first and the second elements.*/
else
List.cons(hd1, raregroup_aux(tl1, n + 1)):textralist
/* Case 11 : one more step forward.*/
)
)
raregroup_aux(lavl, 1)
/*
** raregroup_rev()
** Reversed version of raregroup().
*/
raregroup_rev(lavl) =
rec raregroup_aux_rev(lavl, n) =
match lavl:textralist with
| [] -> [] : textralist
| [hd1 | tl1] ->
(hei1 = Textavl.sizetr(hd1);
match tl1:textralist with
| [] -> lavl : textralist
| [hd2 | tl2] ->
(hei2 = Textavl.sizetr(hd2);
match tl2:textralist with
| [] ->
if ((hei1 > 1) && (hei2 > 1)) then
[Textavl.merge_avl_nn(hd2, hd1)]:textralist
/* Case 1 : two trees. Merge the two.*/
else if ((hei2 == 1) && (n >= 3)) then
[Textavl.merge_avl_nn(hd2, hd1)]:textralist
/* Case 2 : ending h=1 element. Merging.*/
else
lavl
/* Case 3 : okay.*/
| [hd3 | tl3] ->
hei3 = Textavl.sizetr(hd3);
if ((hei1 > 1) && (hei2 == 1) && (hei3 > hei1)) then
List.cons(hd1, raregroup_aux_rev(tl1, 10)):textralist
/* Case 4 : tree. Okay.*/
else if ((hei1 == 1) && (hei2 > 1) && (hei3 == 1)) then
List.cons(hd1, raregroup_aux_rev(tl1, n + 1)):textralist
/* Case 5 : h=1 element. Okay.*/
else if ((hei1 == 1) && (hei2 == 1) && (n == 1)) then
List.cons(hd1, raregroup_aux_rev(tl1, n + 1)):textralist
/* Case 6 : First h=1 elements. Okay.*/
else if ((hei1 > 1) && (hei2 == 1) && (hei3 == hei1)) then
raregroup_aux_rev(List.cons(Textavl.create_node(hd3, Textavl.value(hd2), hd1), tl3):textralist, 10)
/* Case 7 : merging two trees of the same height.*/
else if ((hei1 == 1) && (hei2 == 1) && (hei3 == 1) && (n == 2)) then
raregroup_aux_rev(List.cons(Textavl.create_node(hd3, Textavl.value(hd2), hd1), tl3):textralist, 10)
/* Case 8 : Merging the h=1 elements of the start.*/
else if ((hei1 > 1) && (hei2 == 1)) then
raregroup_aux_rev(List.cons(Textavl.merge_avl_nn(Textavl.merge_avl_nn(hd3, hd2), hd1), tl3):textralist, 10)
/* Case 9 : Merging the 3 elements.*/
else if (hei1 > 1) then
raregroup_aux_rev(List.cons(Textavl.merge_avl_nn(hd2, hd1), tl2):textralist, 10)
/* Case 10 : Merging the first and the second elements.*/
else
List.cons(hd1, raregroup_aux_rev(tl1, n + 1)):textralist
/* Case 11 : one more step forward.*/
)
)
raregroup_aux_rev(lavl, 1)
/*
** reverse()
** Return a reversed list.
*/
reverse(lavl) =
List.rev(lavl)
/*
** raconcat()
** Merge all the AVLs of a list into one only AVL.
*/
raconcat(tree, lavl) =
match lavl : textralist with
| [] -> tree
| [hd | tl] -> raconcat(Textavl.merge_avl_nn(tree, hd), tl)
/*
** head()
** Return the first AVL of the list.
*/
head(lavl) =
match lavl : textralist with
| [] -> Textavl.empty : textavl
| [hd | _] -> hd
/*
** next()
** Return the next AVL.
*/
next(lavl) =
match lavl : textralist with
| [] -> []
| [_ | tl] -> tl
/*
** insert_str_to_the_left()
** Insert a new element of height 1 at the beginning of the list.
** A `right' version is no longer useful.
*/
insert_str_to_the_left(lavl, str, smerge) =
match lavl:textralist with
| [] ->
[Textavl.singleton(str)]:textralist
| [hd | tl] ->
if (Textavl.node_length(str) + Textavl.left_leaf_size(hd, 0) <= smerge) then
List.cons(Textavl.concat_left(hd, str), tl):textralist
else
raregroup(List.cons(Textavl.singleton(str), lavl))
/*
** insert_str_to_the_left()
** Reverse version.
*/
insert_str_to_the_left_rev(lavl, str, smerge) =
match lavl:textralist with
| [] ->
[Textavl.singleton(str)]:textralist
| [hd | tl] ->
if (Textavl.node_length(str) + Textavl.left_leaf_size(hd, 0) <= smerge) then
List.cons(Textavl.concat_right(hd, str), tl):textralist
else
raregroup_rev(List.cons(Textavl.singleton(str), lavl))
/*
** length()
** Return the number of Unicode.characters stored in the list.
*/
length(l) =
match l : textralist with
| [] -> 0
| [hd | tl] -> Textavl.sizetxt(hd) + length(tl)
/*
** to_string()
** Return a string of all the contents of the list.
** Useless now, since we're using to_list.
*/
to_string(l) =
match l : textralist with
| [] -> ""
| [hd | tl] -> Textavl.to_string(hd) ^ to_string(tl)
/*
** to_list()
** Return a list of all the elements of the list.
*/
to_list(l) =
List.flatten(List.map(Textavl.to_list, l))
/*
** sub()
** Return a sub-list.
*/
sub(l, start, len) =
match l:textralist with
| [] -> [] : textralist
| [hd | tl] ->
hdlen = Textavl.sizetxt(hd);
if (start >= hdlen) then
sub(tl, start - hdlen, len)
else if (hdlen >= start + len) then
[Textavl.sub_avl(hd, start, len)]:textralist
else
List.cons(Textavl.sub_avl(hd, start, hdlen - start),
sub(tl, 0, len - hdlen + start)):textralist
/*
** sub_rev()
** Return a sub-list.
*/
sub_rev(l, start, len) =
match l:textralist with
| [] -> [] : textralist
| [hd | tl] ->
hdlen = Textavl.sizetxt(hd);
if (start >= hdlen) then
sub_rev(tl, start - hdlen, len)
else if (hdlen >= start + len) then
[Textavl.sub_avl(hd, hdlen - len - start, len)]:textralist
else
List.cons(Textavl.sub_avl(hd, 0, hdlen - start),
sub_rev(tl, 0, len - hdlen + start)):textralist
/*
** insert_aux_str_into_avls()
** Insert a string into a list of AVLs.
*/
insert_aux_str_into_avls(l, s, pos) =
match l:textralist with
| [] ->
[Textavl.singleton(s):textavl]:textralist
| [hd | tl] ->
lenhd = Textavl.sizetxt(hd);
if (lenhd >= pos) then
List.cons(Textavl.insert_str_into_avl(hd, s, pos), tl):textralist
else
List.cons(hd, insert_aux_str_into_avls(tl, s, pos - lenhd):textralist):textralist
/*
** insert_aux_str_into_avls_rev()
** Reversed version of insert_aux_str_into_avls().
*/
insert_aux_str_into_avls_rev(l, s, pos) =
match l:textralist with
| [] ->
[Textavl.singleton(s):textavl]:textralist
| [hd | tl] ->
lenhd = Textavl.sizetxt(hd);
if (lenhd >= pos) then
List.cons(Textavl.insert_str_into_avl(hd, s, lenhd - pos), tl):textralist
else
List.cons(hd, insert_aux_str_into_avls_rev(tl, s, pos - lenhd):textralist):textralist
/*
** insert_aux_avls_into_avls()
** Split a list in two, and insert a list inside.
*/
insert_aux_avls_into_avls(l1, l2, pos) =
match l1:textralist with
| [] ->
l2:textralist
| [hd | tl] ->
lenhd = Textavl.sizetxt(hd);
if (lenhd == pos) then /* Shortcut.*/
List.cons(hd, List.append(l2, tl)):textralist
else if (lenhd >= pos) then
(lefthd, righthd) = Textavl.split(hd, pos);
List.cons(lefthd, List.append(l2, List.cons(righthd, tl))):textralist
else
List.cons(hd, insert_aux_avls_into_avls(tl, l2, pos - lenhd)):textralist
/*
** insert_aux_avls_into_avls_rev()
** Reversed version of insert_aux_avls_into_avls().
*/
insert_aux_avls_into_avls_rev(l1, l2, pos) =
match l1:textralist with
| [] ->
l2:textralist
| [hd | tl] ->
lenhd = Textavl.sizetxt(hd);
if (lenhd == pos) then
[raconcat(hd, List.append(l2, tl))]:textralist
else if (lenhd >= pos) then
(lefthd, righthd) = Textavl.split(hd, lenhd - pos);
[raconcat(lefthd, List.append(l2, List.cons(righthd, tl)))]:textralist
else
List.cons(hd, insert_aux_avls_into_avls_rev(tl, l2, pos - lenhd)):textralist
/*
** check_text()
** Show the height of the AVLs in the list.
** Useful for debug only.
*/
check_text(l, n) =
match l:textralist with
| [] ->
"Sons : {n}"
| [hd | tl] ->
"H:{Textavl.sizetr(hd):int}; " ^ check_text(tl, n + 1);
/*
** dot_graph()
** Return a string in the Dot syntax showing the structure of the list and its AVLs.
*/
dot_graph(txt, number:int, side:string, shape:string) =
match txt:textralist with
| [] ->
"\"Empty {side}\" [shape={shape}];\n{side} -> \"Empty {side}\";\n"
| [hd | tl] ->
Textavl.dot_avlgraph(hd, "Tree {side} {number} - ", "{side}", " [shape={shape}]") ^ dot_graph(tl, number + 1, side, shape)
/*
** uppercase()
** Uppercase the content of the list.
*/
uppercase(l) =
match l : textralist with
| [] -> [] : textralist
| [hd | tl] ->
List.cons(Textavl.uppercase(hd), uppercase(tl)):textralist
/*
** lowercase()
** Lowercase the content of the list.
*/
lowercase(l) =
match l : textralist with
| [] -> [] : textralist
| [hd | tl] ->
List.cons(Textavl.lowercase(hd), lowercase(tl)):textralist
/*
** get()
** Return the Unicode.character.
*/
get(lavl, pos) =
match lavl : textralist with
| [] -> error("[In Textralist.get()]")
| [hd | tl] ->
lenhd = Textavl.sizetxt(hd);
if (lenhd >= pos) then Textavl.get(hd, pos)
else get(tl, pos - lenhd)
/*
** mapc()
** Apply a function to the Unicode.characters of the trees of the list.
*/
/*
mapc(l, f) =
match l:textralist with
| [] -> [] : textralist
| [hd | tl] ->
List.cons(Textavl.mapc(hd, f), mapc(tl, f)):textralist
*/
/*
** start()
** Build a new iterator.
*/
start(l) =
match l:list(textavl) with
| [] -> (0, "", [], [])
| [hd | tl] ->
(a, b, c) = Textavl.start(hd);
(a, b, tl, c)
/*
** rstart()
** Reversed version of start().
*/
rstart(l) =
rec rstart_aux(l, mem, old) =
match l:list(textavl) with
| [] ->
(a, b, c) = Textavl.rstart(old);
(a, b, next(mem), c)
| [hd|tl] ->
rstart_aux(tl, List.cons(hd, mem), hd)
match l:list(textavl) with
| [] ->
(0, "", [], [])
| [_|_] ->
rstart_aux(l, [], Textavl.empty)
}} /* disabled for : Textralist */
/*
** Ascii_textralist : RA lists of Ascii-nodes AVLs.
*/
//Ascii_textralist = Make_textralist(Ascii_textavl);
/*
** Utf8_textralist : RA lists of UTF8-nodes AVLs.
** Camomile, Eucalyptutf, Cactutf.
*/
/*Utf8camo_textralist = Make_textralist(Utf8camo_textavl);*/
//Utf8euca_textralist = Make_textralist(Utf8euca_textavl);
Utf8cact_textralist = Make_textralist//(Utf8cact_textavl);