module Make =
Functor building an implementation of the map structure
given a totally ordered type.
The type of the map keys.
The type of maps from type
key to type
The empty map.
key:key -> data:'d -> 'd t -> 'd t
add x y m returns a map containing the same bindings as
m, plus a binding of
x was already bound
m, its previous binding disappears.
find x m returns the current binding of
Not_found if no such binding exists.
key -> 'f t -> 'f t
remove x m returns a map containing the same bindings as
m, except for
x which is unbound in the returned map.
key -> 'g t -> bool
mem x m returns
m contains a binding for
f:(key:key -> data:'h -> unit) -> 'h t -> unit
iter f m applies
f to all bindings in map
f receives the key as first argument, and the associated value
as second argument. The order in which the bindings are passed to
f is unspecified. Only current bindings are presented to
bindings hidden by more recent bindings are not passed to
f:('i -> 'j) -> 'i t -> 'j t
map f m returns a map with same domain as
m, where the
a of all bindings of
m has been
replaced by the result of the application of
The order in which the associated values are passed to
f:(key -> 'k -> 'l) -> 'k t -> 'l t
map, but the function receives as arguments both the
key and the associated value for each binding of the map.
f:(key:key -> data:'m -> 'n -> 'n) -> 'm t -> init:'n -> 'n
fold f m a computes
(f kN dN ... (f k1 d1 a)...),
k1 ... kN are the keys of all bindings in
d1 ... dN are the associated data.
The order in which the bindings are presented to