-
Notifications
You must be signed in to change notification settings - Fork 464
/
Copy pathbelt_MapString.ml
169 lines (154 loc) · 4.14 KB
/
belt_MapString.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
# 2 "others/map.cppo.ml"
type key = string
module I = Belt_internalMapString
# 11 "others/map.cppo.ml"
module N = Belt_internalAVLtree
module A = Belt_Array
type 'a t = (key, 'a) N.t
let empty = None
let isEmpty = N.isEmpty
(* let singleton = N.singleton *)
let minKey = N.minKey
let minKeyUndefined = N.minKeyUndefined
let maxKey = N.maxKey
let maxKeyUndefined = N.maxKeyUndefined
let minimum = N.minimum
let minUndefined = N.minUndefined
let maximum = N.maximum
let maxUndefined = N.maxUndefined
let forEachU = N.forEachU
let forEach = N.forEach
let mapU = N.mapU
let map = N.map
let mapWithKeyU = N.mapWithKeyU
let mapWithKey = N.mapWithKey
let reduceU = N.reduceU
let reduce = N.reduce
let everyU = N.everyU
let every = N.every
let someU = N.someU
let some = N.some
let keepU = N.keepSharedU
let keep = N.keepShared
let partitionU = N.partitionSharedU
let partition = N.partitionShared
let size = N.size
let toList = N.toList
let toArray = N.toArray
let keysToArray = N.keysToArray
let valuesToArray = N.valuesToArray
let checkInvariantInternal = N.checkInvariantInternal
let rec set t (newK : key) (newD : _) =
match t with
| None ->
N.singleton newK newD
| Some n ->
let k = n.N.key in
if newK = k then
Some (N.updateValue n newD)
else
let v = n.N.value in
if newK < k then
N.bal (set n.N.left newK newD) k v n.N.right
else
N.bal n.N.left k v (set n.N.right newK newD)
let rec updateU t (x : key) f =
match t with
| None ->
begin match f None [@bs] with
| None -> t
| Some data ->
N.singleton x data
end
| Some n ->
let k = n.N.key in
if x = k then
begin match f (Some n.N.value) [@bs] with
| None ->
let {N.left = l; right = r } = n in
begin match l, r with
| None, _ -> r
| _, None -> l
| _, Some rn ->
let kr, vr = ref rn.N.key, ref rn.N.value in
let r = N.removeMinAuxWithRef rn kr vr in
N.bal l kr.contents vr.contents r
end
| Some data -> Some (N.updateValue n data )
end
else
let {N.left = l; right = r; value = v} = n in
if x < k then
let ll = (updateU l x f) in
if l == ll then t
else N.bal ll k v r
else
let rr = (updateU r x f) in
if r == rr then t
else N.bal l k v rr
let update t x f = updateU t x (fun[@bs] a -> f a)
let rec removeAux n (x : key) =
let {N.left = l; key = v; right = r} = n in
if x = v then
match l, r with
| None, _ -> r
| _, None -> l
| _, Some rn ->
let kr, vr = ref rn.N.key, ref rn.N.value in
let r = N.removeMinAuxWithRef rn kr vr in
N.bal l kr.contents vr.contents r
else if x < v then
match l with
| None -> Some n
| Some left ->
let ll = removeAux left x in
if ll == l then Some n
else N.(bal ll v n.value r)
else
match r with
| None -> Some n
| Some right ->
let rr = removeAux right x in
N.bal l v n.N.value rr
let remove n x =
match n with
| None -> None
| Some n -> removeAux n x
let rec removeMany0 t xs i len =
if i < len then
let ele = A.getUnsafe xs i in
let u = removeAux t ele in
match u with
| None -> u
| Some t -> removeMany0 t xs (i + 1) len
else
Some t
let removeMany t keys =
let len = A.length keys in
match t with
| None -> None
| Some t -> removeMany0 t keys 0 len
let findFirstByU = N.findFirstByU
let findFirstBy = N.findFirstBy
let mergeMany h arr =
let len = A.length arr in
let v = ref h in
for i = 0 to len - 1 do
let key,value = A.getUnsafe arr i in
v.contents<- set v.contents key value
done ;
v.contents
(* let mergeArray = mergeMany *)
let has = I.has
let cmpU = I.cmpU
let cmp = I.cmp
let eqU = I.eqU
let eq = I.eq
let get = I.get
let getUndefined = I.getUndefined
let getWithDefault = I.getWithDefault
let getExn = I.getExn
let split = I.split
let mergeU = I.mergeU
let merge = I.merge
let fromArray = I.fromArray