module type S = sig ... endinclude S
include Stdlib.Map.S with type key = string and type 'a t = 'a StringMap.t
val is_empty : 'a t -> boolval mem : key -> 'a t -> boolval add : key -> 'a -> 'a t -> 'a tval update : key -> ('a option -> 'a option) -> 'a t -> 'a tval singleton : key -> 'a -> 'a tval remove : key -> 'a t -> 'a tval merge :
(key -> 'a option -> 'b option -> 'c option) ->
'a t ->
'b t ->
'c tval union : (key -> 'a -> 'a -> 'a option) -> 'a t -> 'a t -> 'a tval compare : ('a -> 'a -> int) -> 'a t -> 'a t -> intval equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> boolval iter : (key -> 'a -> unit) -> 'a t -> unitval fold : (key -> 'a -> 'b -> 'b) -> 'a t -> 'b -> 'bval for_all : (key -> 'a -> bool) -> 'a t -> boolval exists : (key -> 'a -> bool) -> 'a t -> boolval filter : (key -> 'a -> bool) -> 'a t -> 'a tval filter_map : (key -> 'a -> 'b option) -> 'a t -> 'b tval partition : (key -> 'a -> bool) -> 'a t -> 'a t * 'a tval cardinal : 'a t -> intval bindings : 'a t -> (key * 'a) listval min_binding : 'a t -> key * 'aval min_binding_opt : 'a t -> (key * 'a) optionval max_binding : 'a t -> key * 'aval max_binding_opt : 'a t -> (key * 'a) optionval choose : 'a t -> key * 'aval choose_opt : 'a t -> (key * 'a) optionval split : key -> 'a t -> 'a t * 'a option * 'a tval find : key -> 'a t -> 'aval find_opt : key -> 'a t -> 'a optionval find_first : (key -> bool) -> 'a t -> key * 'aval find_first_opt : (key -> bool) -> 'a t -> (key * 'a) optionval find_last : (key -> bool) -> 'a t -> key * 'aval find_last_opt : (key -> bool) -> 'a t -> (key * 'a) optionval map : ('a -> 'b) -> 'a t -> 'b tval mapi : (key -> 'a -> 'b) -> 'a t -> 'b tval to_seq : 'a t -> (key * 'a) Stdlib.Seq.tval to_rev_seq : 'a t -> (key * 'a) Stdlib.Seq.tval to_seq_from : key -> 'a t -> (key * 'a) Stdlib.Seq.tval add_seq : (key * 'a) Stdlib.Seq.t -> 'a t -> 'a tval of_seq : (key * 'a) Stdlib.Seq.t -> 'a tval t : 'a Repr.ty -> 'a t Repr.tyval of_list : (string * 'a) list -> 'a tval keys : 'a t -> string listval values : 'a t -> 'a listval to_pair : ('a * 'b) t -> 'a t * 'b tval add_unique : key -> 'a -> 'a t -> 'a tval union_disjoint :
?common_keys_equal_elt:(string list * ('a -> 'a -> bool)) ->
'a t ->
'a t ->
'a tval union_disjoint_list :
?common_keys_equal_elt:(string list * ('a -> 'a -> bool)) ->
'a t list ->
'a tval map_list_to_list_map : 'a t list -> 'a list tval sub_map : 'a t -> 'b t -> 'b tval update_keys : (key -> key) -> 'a t -> 'a t