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
|
(************************************************************************)
(* v * The Coq Proof Assistant / The Coq Development Team *)
(* <O___,, * INRIA - CNRS - LIX - LRI - PPS - Copyright 1999-2017 *)
(* \VV/ **************************************************************)
(* // * This file is distributed under the terms of the *)
(* * GNU Lesser General Public License Version 2.1 *)
(************************************************************************)
module type OrderedType =
sig
type t
val compare : t -> t -> int
end
module type MonadS =
sig
type +'a t
val return : 'a -> 'a t
val (>>=) : 'a t -> ('a -> 'b t) -> 'b t
end
module type S = Map.S
module type ExtS =
sig
include CSig.MapS
module Set : CSig.SetS with type elt = key
val get : key -> 'a t -> 'a
val update : key -> 'a -> 'a t -> 'a t
val modify : key -> (key -> 'a -> 'a) -> 'a t -> 'a t
val domain : 'a t -> Set.t
val bind : (key -> 'a) -> Set.t -> 'a t
val fold_left : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val fold_right : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val smartmap : ('a -> 'a) -> 'a t -> 'a t
val smartmapi : (key -> 'a -> 'a) -> 'a t -> 'a t
val height : 'a t -> int
module Unsafe :
sig
val map : (key -> 'a -> key * 'b) -> 'a t -> 'b t
end
module Monad(M : MonadS) :
sig
val fold : (key -> 'a -> 'b -> 'b M.t) -> 'a t -> 'b -> 'b M.t
val fold_left : (key -> 'a -> 'b -> 'b M.t) -> 'a t -> 'b -> 'b M.t
val fold_right : (key -> 'a -> 'b -> 'b M.t) -> 'a t -> 'b -> 'b M.t
end
end
module MapExt (M : Map.OrderedType) :
sig
type 'a map = 'a Map.Make(M).t
val update : M.t -> 'a -> 'a map -> 'a map
val modify : M.t -> (M.t -> 'a -> 'a) -> 'a map -> 'a map
val domain : 'a map -> Set.Make(M).t
val bind : (M.t -> 'a) -> Set.Make(M).t -> 'a map
val fold_left : (M.t -> 'a -> 'b -> 'b) -> 'a map -> 'b -> 'b
val fold_right : (M.t -> 'a -> 'b -> 'b) -> 'a map -> 'b -> 'b
val smartmap : ('a -> 'a) -> 'a map -> 'a map
val smartmapi : (M.t -> 'a -> 'a) -> 'a map -> 'a map
val height : 'a map -> int
module Unsafe :
sig
val map : (M.t -> 'a -> M.t * 'b) -> 'a map -> 'b map
end
module Monad(MS : MonadS) :
sig
val fold : (M.t -> 'a -> 'b -> 'b MS.t) -> 'a map -> 'b -> 'b MS.t
val fold_left : (M.t -> 'a -> 'b -> 'b MS.t) -> 'a map -> 'b -> 'b MS.t
val fold_right : (M.t -> 'a -> 'b -> 'b MS.t) -> 'a map -> 'b -> 'b MS.t
end
end =
struct
(** This unsafe module is a way to access to the actual implementations of
OCaml sets and maps without reimplementing them ourselves. It is quite
dubious that these implementations will ever be changed... Nonetheless,
if this happens, we can still implement a less clever version of [domain].
*)
type 'a map = 'a Map.Make(M).t
type set = Set.Make(M).t
type 'a _map =
| MEmpty
| MNode of 'a map * M.t * 'a * 'a map * int
type _set =
| SEmpty
| SNode of set * M.t * set * int
let map_prj : 'a map -> 'a _map = Obj.magic
let map_inj : 'a _map -> 'a map = Obj.magic
let set_prj : set -> _set = Obj.magic
let set_inj : _set -> set = Obj.magic
let rec update k v (s : 'a map) : 'a map = match map_prj s with
| MEmpty -> raise Not_found
| MNode (l, k', v', r, h) ->
let c = M.compare k k' in
if c < 0 then
let l' = update k v l in
if l == l' then s
else map_inj (MNode (l', k', v', r, h))
else if c = 0 then
if v' == v then s
else map_inj (MNode (l, k', v, r, h))
else
let r' = update k v r in
if r == r' then s
else map_inj (MNode (l, k', v', r', h))
let rec modify k f (s : 'a map) : 'a map = match map_prj s with
| MEmpty -> raise Not_found
| MNode (l, k', v, r, h) ->
let c = M.compare k k' in
if c < 0 then
let l' = modify k f l in
if l == l' then s
else map_inj (MNode (l', k', v, r, h))
else if c = 0 then
let v' = f k' v in
if v' == v then s
else map_inj (MNode (l, k', v', r, h))
else
let r' = modify k f r in
if r == r' then s
else map_inj (MNode (l, k', v, r', h))
let rec domain (s : 'a map) : set = match map_prj s with
| MEmpty -> set_inj SEmpty
| MNode (l, k, _, r, h) ->
set_inj (SNode (domain l, k, domain r, h))
(** This function is essentially identity, but OCaml current stdlib does not
take advantage of the similarity of the two structures, so we introduce
this unsafe loophole. *)
let rec bind f (s : set) : 'a map = match set_prj s with
| SEmpty -> map_inj MEmpty
| SNode (l, k, r, h) ->
map_inj (MNode (bind f l, k, f k, bind f r, h))
(** Dual operation of [domain]. *)
let rec fold_left f (s : 'a map) accu = match map_prj s with
| MEmpty -> accu
| MNode (l, k, v, r, h) ->
let accu = f k v (fold_left f l accu) in
fold_left f r accu
let rec fold_right f (s : 'a map) accu = match map_prj s with
| MEmpty -> accu
| MNode (l, k, v, r, h) ->
let accu = f k v (fold_right f r accu) in
fold_right f l accu
let rec smartmap f (s : 'a map) = match map_prj s with
| MEmpty -> map_inj MEmpty
| MNode (l, k, v, r, h) ->
let l' = smartmap f l in
let r' = smartmap f r in
let v' = f v in
if l == l' && r == r' && v == v' then s
else map_inj (MNode (l', k, v', r', h))
let rec smartmapi f (s : 'a map) = match map_prj s with
| MEmpty -> map_inj MEmpty
| MNode (l, k, v, r, h) ->
let l' = smartmapi f l in
let r' = smartmapi f r in
let v' = f k v in
if l == l' && r == r' && v == v' then s
else map_inj (MNode (l', k, v', r', h))
let height s = match map_prj s with
| MEmpty -> 0
| MNode (_, _, _, _, h) -> h
module Unsafe =
struct
let rec map f (s : 'a map) : 'b map = match map_prj s with
| MEmpty -> map_inj MEmpty
| MNode (l, k, v, r, h) ->
let (k, v) = f k v in
map_inj (MNode (map f l, k, v, map f r, h))
end
module Monad(M : MonadS) =
struct
open M
let rec fold_left f s accu = match map_prj s with
| MEmpty -> return accu
| MNode (l, k, v, r, h) ->
fold_left f l accu >>= fun accu ->
f k v accu >>= fun accu ->
fold_left f r accu
let rec fold_right f s accu = match map_prj s with
| MEmpty -> return accu
| MNode (l, k, v, r, h) ->
fold_right f r accu >>= fun accu ->
f k v accu >>= fun accu ->
fold_right f l accu
let fold = fold_left
end
end
module Make(M : Map.OrderedType) =
struct
include Map.Make(M)
include MapExt(M)
let get k m = try find k m with Not_found -> assert false
end
|
