Association tables over ordered types.
This module implements applicative association tables, also known as finite maps or dictionaries, given a total ordering function over the keys. All operations over maps are purely applicative (no side-effects). The implementation uses balanced binary trees, and therefore searching and insertion take time logarithmic in the size of the map.
The type of the map keys.
val empty : ('key, 'a) tThe empty map.
val is_empty : ('key, 'a) t -> boolTest whether a map is empty or not.
add x y m returns a map containing the same bindings as m, plus a binding of x to y. If x was already bound in m, its previous binding disappears.
val find : 'key -> ('key, 'a) t -> 'afind x m returns the current binding of x in m, or raises Not_found if no such binding exists.
remove x m returns a map containing the same bindings as m, except for x which is unbound in the returned map.
val mem : 'key -> ('key, 'a) t -> boolmem x m returns true if m contains a binding for x, and false otherwise.
val iter : ('key -> 'a -> unit) -> ('key, 'a) t -> unititer f m applies f to all bindings in map m. f receives the key as first argument, and the associated value as second argument. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.
map f m returns a map with same domain as m, where the associated value a of all bindings of m has been replaced by the result of the application of f to a. The bindings are passed to f in increasing order with respect to the ordering over the type of the keys.
Same as Map.S.map, but the function receives as arguments both the key and the associated value for each binding of the map.
val fold : ('key -> 'a -> 'b -> 'b) -> ('key, 'a) t -> 'b -> 'bfold f m a computes (f kN dN ... (f k1 d1 a)...), where k1 ... kN are the keys of all bindings in m (in increasing order), and d1 ... dN are the associated data.
val of_list : ('key * 'a) list -> ('key, 'a) tval to_list : ('key, 'a) t -> ('key * 'a) list