/
batDllist.ml
318 lines (276 loc) · 6.45 KB
/
batDllist.ml
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
(*
* Dllist- a mutable, circular, doubly linked list library
* Copyright (C) 2004 Brian Hurt, Jesse Guardiani
* Copyright (C) 2008 David Teller
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version,
* with the special exception on linking described in file LICENSE.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*)
type 'a node_t = {
mutable data : 'a;
mutable next : 'a node_t;
mutable prev : 'a node_t
}
type 'a enum_t = {
mutable curr : 'a node_t;
mutable valid : bool
}
type 'a t = 'a node_t
type 'a mappable = 'a t
type 'a enumerable = 'a t
exception Empty
let create x = let rec nn = { data = x; next = nn; prev = nn} in nn
let length node =
let rec loop cnt n =
if n == node then
cnt
else
loop (cnt + 1) n.next
in
loop 1 node.next
let add node elem =
let nn = { data = elem; next = node.next; prev = node } in
node.next.prev <- nn;
node.next <- nn
let append node elem =
let nn = { data = elem; next = node.next; prev = node } in
node.next.prev <- nn;
node.next <- nn;
nn
let prepend node elem =
let nn = { data = elem; next = node; prev = node.prev } in
node.prev.next <- nn;
node.prev <- nn;
nn
let promote node =
let next = node.next in
let prev = node.prev in
if next != prev then begin
next.next.prev <- node;
node.next <- next.next;
node.prev <- next;
next.next <- node;
next.prev <- prev;
prev.next <- next
end
let demote node =
let next = node.next in
let prev = node.prev in
if next != prev then begin
prev.prev.next <- node;
node.prev <- prev.prev;
node.next <- prev;
prev.prev <- node;
prev.next <- next;
next.prev <- prev
end
let remove node =
let next = node.next in
let prev = node.prev in
prev.next <- next;
next.prev <- prev;
node.next <- node;
node.prev <- node
let drop node =
let next = node.next in
let prev = node.prev in
prev.next <- next;
next.prev <- prev;
node.next <- node;
node.prev <- node;
next
let rev_drop node =
let next = node.next in
let prev = node.prev in
prev.next <- next;
next.prev <- prev;
node.next <- node;
node.prev <- node;
prev
let splice node1 node2 =
let next = node1.next in
let prev = node2.prev in
node1.next <- node2;
node2.prev <- node1;
next.prev <- prev;
prev.next <- next
let set node data = node.data <- data
let get node = node.data
let next node = node.next
let prev node = node.prev
let skip node idx =
let m = if idx > 0 then -1 else 1 in
let rec loop idx n =
if idx == 0 then
n
else
loop (idx + m) n.next
in
loop idx node
let rev node =
let rec loop next n =
begin
let prev = n.prev in
n.next <- prev;
n.prev <- next;
if n != node then
loop n prev
end
in
loop node node.prev
let iter f node =
let () = f node.data in
let rec loop n =
if n != node then
let () = f n.data in
loop n.next
in
loop node.next
let for_all p node =
let rec loop n =
if n == node then true
else p n.data && loop n.next
in
p node.data && loop node.next
let exists p node =
let rec loop n =
if n == node then false
else p n.data || loop n.next
in
p node.data || loop node.next
let fold_left f init node =
let rec loop accu n =
if n == node then
accu
else
loop (f accu n.data) n.next
in
loop (f init node.data) node.next
let fold_right f node init =
let rec loop accu n =
if n == node then
f n.data accu
else
loop (f n.data accu) n.prev
in
loop init node.prev
let map f node =
let first = create (f node.data) in
let rec loop last n =
if n == node then
begin
first.prev <- last;
first
end
else
begin
let nn = { data = f n.data; next = first; prev = last } in
last.next <- nn;
loop nn n.next
end
in
loop first node.next
let copy node = map (fun x -> x) node
let to_list node = fold_right (fun d l -> d::l) node []
let of_list lst =
match lst with
| [] -> raise Empty
| h :: t ->
let first = create h in
let rec loop last = function
| [] ->
last.next <- first;
first.prev <- last;
first
| h :: t ->
let nn = { data = h; next = first; prev = last } in
last.next <- nn;
loop nn t
in
loop first t
let enum node =
let next e () =
if e.valid == false then
raise BatEnum.No_more_elements
else
begin
let rval = e.curr.data in
e.curr <- e.curr.next;
if (e.curr == node) then
e.valid <- false;
rval
end
and count e () =
if e.valid == false then
0
else
let rec loop cnt n =
if n == node then
cnt
else
loop (cnt + 1) (n.next)
in
loop 1 (e.curr.next)
in
let rec clone e () =
let e' = { curr = e.curr; valid = e.valid } in
BatEnum.make ~next:(next e') ~count:(count e') ~clone:(clone e')
in
let e = { curr = node; valid = true } in
BatEnum.make ~next:(next e) ~count:(count e) ~clone:(clone e)
let rev_enum node =
let prev e () =
if e.valid == false then
raise BatEnum.No_more_elements
else
begin
let rval = e.curr.data in
e.curr <- e.curr.prev;
if (e.curr == node) then
e.valid <- false;
rval
end
and count e () =
if e.valid == false then
0
else
let rec loop cnt n =
if n == node then
cnt
else
loop (cnt + 1) (n.prev)
in
loop 1 (e.curr.prev)
in
let rec clone e () =
let e' = { curr = e.curr; valid = e.valid } in
BatEnum.make ~next:(prev e') ~count:(count e') ~clone:(clone e')
in
let e = { curr = node; valid = true } in
BatEnum.make ~next:(prev e) ~count:(count e) ~clone:(clone e)
let of_enum enm =
match BatEnum.get enm with
| None -> raise Empty
| Some(d) ->
let first = create d in
let f n d = append n d in
ignore(BatEnum.fold f first enm);
first
let print ?(first="[") ?(last="]") ?(sep="; ") print_a out t =
BatEnum.print ~first ~last ~sep print_a out (enum t)
let filter f node = (*TODO : make faster*)
of_enum (BatEnum.filter f (enum node))
let filter_map f node = (*TODO : make faster*)
of_enum (BatEnum.filter_map f (enum node))