sig
module type OrderedType =
sig
type t
val compare : Mapext.OrderedType.t -> Mapext.OrderedType.t -> int
end
module type S =
sig
type key
type +'a t
val empty : 'a Mapext.S.t
val is_empty : 'a Mapext.S.t -> bool
val mem : Mapext.S.key -> 'a Mapext.S.t -> bool
val add : Mapext.S.key -> 'a -> 'a Mapext.S.t -> 'a Mapext.S.t
val singleton : Mapext.S.key -> 'a -> 'a Mapext.S.t
val remove : Mapext.S.key -> 'a Mapext.S.t -> 'a Mapext.S.t
val merge :
(Mapext.S.key -> 'a option -> 'b option -> 'c option) ->
'a Mapext.S.t -> 'b Mapext.S.t -> 'c Mapext.S.t
val compare :
('a -> 'a -> int) -> 'a Mapext.S.t -> 'a Mapext.S.t -> int
val equal :
('a -> 'a -> bool) -> 'a Mapext.S.t -> 'a Mapext.S.t -> bool
val iter : (Mapext.S.key -> 'a -> unit) -> 'a Mapext.S.t -> unit
val fold :
(Mapext.S.key -> 'a -> 'b -> 'b) -> 'a Mapext.S.t -> 'b -> 'b
val for_all : (Mapext.S.key -> 'a -> bool) -> 'a Mapext.S.t -> bool
val exists : (Mapext.S.key -> 'a -> bool) -> 'a Mapext.S.t -> bool
val filter :
(Mapext.S.key -> 'a -> bool) -> 'a Mapext.S.t -> 'a Mapext.S.t
val partition :
(Mapext.S.key -> 'a -> bool) ->
'a Mapext.S.t -> 'a Mapext.S.t * 'a Mapext.S.t
val cardinal : 'a Mapext.S.t -> int
val bindings : 'a Mapext.S.t -> (Mapext.S.key * 'a) list
val min_binding : 'a Mapext.S.t -> Mapext.S.key * 'a
val max_binding : 'a Mapext.S.t -> Mapext.S.key * 'a
val choose : 'a Mapext.S.t -> Mapext.S.key * 'a
val split :
Mapext.S.key ->
'a Mapext.S.t -> 'a Mapext.S.t * 'a option * 'a Mapext.S.t
val find : Mapext.S.key -> 'a Mapext.S.t -> 'a
val map : ('a -> 'b) -> 'a Mapext.S.t -> 'b Mapext.S.t
val mapi : (Mapext.S.key -> 'a -> 'b) -> 'a Mapext.S.t -> 'b Mapext.S.t
val of_list : (Mapext.S.key * 'a) list -> 'a Mapext.S.t
val map2 :
(Mapext.S.key -> 'a -> 'b -> 'c) ->
'a Mapext.S.t -> 'b Mapext.S.t -> 'c Mapext.S.t
val iter2 :
(Mapext.S.key -> 'a -> 'b -> unit) ->
'a Mapext.S.t -> 'b Mapext.S.t -> unit
val fold2 :
(Mapext.S.key -> 'a -> 'b -> 'c -> 'c) ->
'a Mapext.S.t -> 'b Mapext.S.t -> 'c -> 'c
val for_all2 :
(Mapext.S.key -> 'a -> 'b -> bool) ->
'a Mapext.S.t -> 'b Mapext.S.t -> bool
val exists2 :
(Mapext.S.key -> 'a -> 'b -> bool) ->
'a Mapext.S.t -> 'b Mapext.S.t -> bool
val map2z :
(Mapext.S.key -> 'a -> 'a -> 'a) ->
'a Mapext.S.t -> 'a Mapext.S.t -> 'a Mapext.S.t
val iter2z :
(Mapext.S.key -> 'a -> 'a -> unit) ->
'a Mapext.S.t -> 'a Mapext.S.t -> unit
val fold2z :
(Mapext.S.key -> 'a -> 'a -> 'b -> 'b) ->
'a Mapext.S.t -> 'a Mapext.S.t -> 'b -> 'b
val for_all2z :
(Mapext.S.key -> 'a -> 'a -> bool) ->
'a Mapext.S.t -> 'a Mapext.S.t -> bool
val exists2z :
(Mapext.S.key -> 'a -> 'a -> bool) ->
'a Mapext.S.t -> 'a Mapext.S.t -> bool
val map2o :
(Mapext.S.key -> 'a -> 'c) ->
(Mapext.S.key -> 'b -> 'c) ->
(Mapext.S.key -> 'a -> 'b -> 'c) ->
'a Mapext.S.t -> 'b Mapext.S.t -> 'c Mapext.S.t
val iter2o :
(Mapext.S.key -> 'a -> unit) ->
(Mapext.S.key -> 'b -> unit) ->
(Mapext.S.key -> 'a -> 'b -> unit) ->
'a Mapext.S.t -> 'b Mapext.S.t -> unit
val fold2o :
(Mapext.S.key -> 'a -> 'c -> 'c) ->
(Mapext.S.key -> 'b -> 'c -> 'c) ->
(Mapext.S.key -> 'a -> 'b -> 'c -> 'c) ->
'a Mapext.S.t -> 'b Mapext.S.t -> 'c -> 'c
val for_all2o :
(Mapext.S.key -> 'a -> bool) ->
(Mapext.S.key -> 'b -> bool) ->
(Mapext.S.key -> 'a -> 'b -> bool) ->
'a Mapext.S.t -> 'b Mapext.S.t -> bool
val exists2o :
(Mapext.S.key -> 'a -> bool) ->
(Mapext.S.key -> 'b -> bool) ->
(Mapext.S.key -> 'a -> 'b -> bool) ->
'a Mapext.S.t -> 'b Mapext.S.t -> bool
val map2zo :
(Mapext.S.key -> 'a -> 'a) ->
(Mapext.S.key -> 'a -> 'a) ->
(Mapext.S.key -> 'a -> 'a -> 'a) ->
'a Mapext.S.t -> 'a Mapext.S.t -> 'a Mapext.S.t
val iter2zo :
(Mapext.S.key -> 'a -> unit) ->
(Mapext.S.key -> 'a -> unit) ->
(Mapext.S.key -> 'a -> 'a -> unit) ->
'a Mapext.S.t -> 'a Mapext.S.t -> unit
val fold2zo :
(Mapext.S.key -> 'a -> 'b -> 'b) ->
(Mapext.S.key -> 'a -> 'b -> 'b) ->
(Mapext.S.key -> 'a -> 'a -> 'b -> 'b) ->
'a Mapext.S.t -> 'a Mapext.S.t -> 'b -> 'b
val for_all2zo :
(Mapext.S.key -> 'a -> bool) ->
(Mapext.S.key -> 'a -> bool) ->
(Mapext.S.key -> 'a -> 'a -> bool) ->
'a Mapext.S.t -> 'a Mapext.S.t -> bool
val exists2zo :
(Mapext.S.key -> 'a -> bool) ->
(Mapext.S.key -> 'a -> bool) ->
(Mapext.S.key -> 'a -> 'a -> bool) ->
'a Mapext.S.t -> 'a Mapext.S.t -> bool
val map_slice :
(Mapext.S.key -> 'a -> 'a) ->
'a Mapext.S.t -> Mapext.S.key -> Mapext.S.key -> 'a Mapext.S.t
val iter_slice :
(Mapext.S.key -> 'a -> unit) ->
'a Mapext.S.t -> Mapext.S.key -> Mapext.S.key -> unit
val fold_slice :
(Mapext.S.key -> 'a -> 'b -> 'b) ->
'a Mapext.S.t -> Mapext.S.key -> Mapext.S.key -> 'b -> 'b
val for_all_slice :
(Mapext.S.key -> 'a -> bool) ->
'a Mapext.S.t -> Mapext.S.key -> Mapext.S.key -> bool
val exists_slice :
(Mapext.S.key -> 'a -> bool) ->
'a Mapext.S.t -> Mapext.S.key -> Mapext.S.key -> bool
val key_equal : 'a Mapext.S.t -> 'a Mapext.S.t -> bool
val key_subset : 'a Mapext.S.t -> 'a Mapext.S.t -> bool
val find_greater : Mapext.S.key -> 'a Mapext.S.t -> Mapext.S.key * 'a
val find_less : Mapext.S.key -> 'a Mapext.S.t -> Mapext.S.key * 'a
val find_greater_equal :
Mapext.S.key -> 'a Mapext.S.t -> Mapext.S.key * 'a
val find_less_equal :
Mapext.S.key -> 'a Mapext.S.t -> Mapext.S.key * 'a
end
module Make :
functor (Ord : OrderedType) ->
sig
type key = Ord.t
type +'a t
val empty : 'a t
val is_empty : 'a t -> bool
val mem : key -> 'a t -> bool
val add : key -> 'a -> 'a t -> 'a t
val singleton : key -> 'a -> 'a t
val remove : key -> 'a t -> 'a t
val merge :
(key -> 'a option -> 'b option -> 'c option) ->
'a t -> 'b t -> 'c t
val compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
val equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
val iter : (key -> 'a -> unit) -> 'a t -> unit
val fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'b
val for_all : (key -> 'a -> bool) -> 'a t -> bool
val exists : (key -> 'a -> bool) -> 'a t -> bool
val filter : (key -> 'a -> bool) -> 'a t -> 'a t
val partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a t
val cardinal : 'a t -> int
val bindings : 'a t -> (key * 'a) list
val min_binding : 'a t -> key * 'a
val max_binding : 'a t -> key * 'a
val choose : 'a t -> key * 'a
val split : key -> 'a t -> 'a t * 'a option * 'a t
val find : key -> 'a t -> 'a
val map : ('a -> 'b) -> 'a t -> 'b t
val mapi : (key -> 'a -> 'b) -> 'a t -> 'b t
val of_list : (key * 'a) list -> 'a t
val map2 : (key -> 'a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t
val iter2 : (key -> 'a -> 'b -> unit) -> 'a t -> 'b t -> unit
val fold2 : (key -> 'a -> 'b -> 'c -> 'c) -> 'a t -> 'b t -> 'c -> 'c
val for_all2 : (key -> 'a -> 'b -> bool) -> 'a t -> 'b t -> bool
val exists2 : (key -> 'a -> 'b -> bool) -> 'a t -> 'b t -> bool
val map2z : (key -> 'a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val iter2z : (key -> 'a -> 'a -> unit) -> 'a t -> 'a t -> unit
val fold2z :
(key -> 'a -> 'a -> 'b -> 'b) -> 'a t -> 'a t -> 'b -> 'b
val for_all2z : (key -> 'a -> 'a -> bool) -> 'a t -> 'a t -> bool
val exists2z : (key -> 'a -> 'a -> bool) -> 'a t -> 'a t -> bool
val map2o :
(key -> 'a -> 'c) ->
(key -> 'b -> 'c) ->
(key -> 'a -> 'b -> 'c) -> 'a t -> 'b t -> 'c t
val iter2o :
(key -> 'a -> unit) ->
(key -> 'b -> unit) ->
(key -> 'a -> 'b -> unit) -> 'a t -> 'b t -> unit
val fold2o :
(key -> 'a -> 'c -> 'c) ->
(key -> 'b -> 'c -> 'c) ->
(key -> 'a -> 'b -> 'c -> 'c) -> 'a t -> 'b t -> 'c -> 'c
val for_all2o :
(key -> 'a -> bool) ->
(key -> 'b -> bool) ->
(key -> 'a -> 'b -> bool) -> 'a t -> 'b t -> bool
val exists2o :
(key -> 'a -> bool) ->
(key -> 'b -> bool) ->
(key -> 'a -> 'b -> bool) -> 'a t -> 'b t -> bool
val map2zo :
(key -> 'a -> 'a) ->
(key -> 'a -> 'a) ->
(key -> 'a -> 'a -> 'a) -> 'a t -> 'a t -> 'a t
val iter2zo :
(key -> 'a -> unit) ->
(key -> 'a -> unit) ->
(key -> 'a -> 'a -> unit) -> 'a t -> 'a t -> unit
val fold2zo :
(key -> 'a -> 'b -> 'b) ->
(key -> 'a -> 'b -> 'b) ->
(key -> 'a -> 'a -> 'b -> 'b) -> 'a t -> 'a t -> 'b -> 'b
val for_all2zo :
(key -> 'a -> bool) ->
(key -> 'a -> bool) ->
(key -> 'a -> 'a -> bool) -> 'a t -> 'a t -> bool
val exists2zo :
(key -> 'a -> bool) ->
(key -> 'a -> bool) ->
(key -> 'a -> 'a -> bool) -> 'a t -> 'a t -> bool
val map_slice : (key -> 'a -> 'a) -> 'a t -> key -> key -> 'a t
val iter_slice : (key -> 'a -> unit) -> 'a t -> key -> key -> unit
val fold_slice :
(key -> 'a -> 'b -> 'b) -> 'a t -> key -> key -> 'b -> 'b
val for_all_slice : (key -> 'a -> bool) -> 'a t -> key -> key -> bool
val exists_slice : (key -> 'a -> bool) -> 'a t -> key -> key -> bool
val key_equal : 'a t -> 'a t -> bool
val key_subset : 'a t -> 'a t -> bool
val find_greater : key -> 'a t -> key * 'a
val find_less : key -> 'a t -> key * 'a
val find_greater_equal : key -> 'a t -> key * 'a
val find_less_equal : key -> 'a t -> key * 'a
end
end