Map.SpecializeFunctor building an implementation of a "specialized", non-polymorphic map from K.t to V.t.
The resulting module contains modified to_string, print and pp functions for easy top-level development and debugging.
include sig ... endmodule M : sig ... endtype key = K.tval mem : key -> 'a Stdlib__Map.Make(K).t -> boolval add : key -> 'a -> 'a Stdlib__Map.Make(K).t -> 'a Stdlib__Map.Make(K).tval update :
key ->
('a option -> 'a option) ->
'a Stdlib__Map.Make(K).t ->
'a Stdlib__Map.Make(K).tval singleton : key -> 'a -> 'a Stdlib__Map.Make(K).tval remove : key -> 'a Stdlib__Map.Make(K).t -> 'a Stdlib__Map.Make(K).tval merge :
(key -> 'a option -> 'b option -> 'c option) ->
'a Stdlib__Map.Make(K).t ->
'b Stdlib__Map.Make(K).t ->
'c Stdlib__Map.Make(K).tval union :
(key -> 'a -> 'a -> 'a option) ->
'a Stdlib__Map.Make(K).t ->
'a Stdlib__Map.Make(K).t ->
'a Stdlib__Map.Make(K).tval iter : (key -> 'a -> unit) -> 'a Stdlib__Map.Make(K).t -> unitval fold : (key -> 'a -> 'b -> 'b) -> 'a Stdlib__Map.Make(K).t -> 'b -> 'bval for_all : (key -> 'a -> bool) -> 'a Stdlib__Map.Make(K).t -> boolval exists : (key -> 'a -> bool) -> 'a Stdlib__Map.Make(K).t -> boolval filter :
(key -> 'a -> bool) ->
'a Stdlib__Map.Make(K).t ->
'a Stdlib__Map.Make(K).tval filter_map :
(key -> 'a -> 'b option) ->
'a Stdlib__Map.Make(K).t ->
'b Stdlib__Map.Make(K).tval partition :
(key -> 'a -> bool) ->
'a Stdlib__Map.Make(K).t ->
'a Stdlib__Map.Make(K).t * 'a Stdlib__Map.Make(K).tval bindings : 'a Stdlib__Map.Make(K).t -> (key * 'a) listval min_binding : 'a Stdlib__Map.Make(K).t -> key * 'aval min_binding_opt : 'a Stdlib__Map.Make(K).t -> (key * 'a) optionval max_binding : 'a Stdlib__Map.Make(K).t -> key * 'aval max_binding_opt : 'a Stdlib__Map.Make(K).t -> (key * 'a) optionval choose : 'a Stdlib__Map.Make(K).t -> key * 'aval choose_opt : 'a Stdlib__Map.Make(K).t -> (key * 'a) optionval split :
key ->
'a Stdlib__Map.Make(K).t ->
'a Stdlib__Map.Make(K).t * 'a option * 'a Stdlib__Map.Make(K).tval find : key -> 'a Stdlib__Map.Make(K).t -> 'aval find_opt : key -> 'a Stdlib__Map.Make(K).t -> 'a optionval mapi :
(key -> 'a -> 'b) ->
'a Stdlib__Map.Make(K).t ->
'b Stdlib__Map.Make(K).tval to_seq : 'a Stdlib__Map.Make(K).t -> (key * 'a) Stdlib.Seq.tval to_rev_seq : 'a Stdlib__Map.Make(K).t -> (key * 'a) Stdlib.Seq.tval add_seq :
(key * 'a) Stdlib.Seq.t ->
'a Stdlib__Map.Make(K).t ->
'a Stdlib__Map.Make(K).tval of_seq : (key * 'a) Stdlib.Seq.t -> 'a Stdlib__Map.Make(K).tval random :
?size:(unit -> int) ->
key:(unit -> key) ->
value:(unit -> 'a) ->
unit ->
'a Stdlib__Map.Make(K).tval replace : key -> 'a -> 'a Stdlib__Map.Make(K).t -> 'a Stdlib__Map.Make(K).tval of_list :
'a Stdlib__Map.Make(K).t ->
(key * 'a) list ->
'a Stdlib__Map.Make(K).tval adjoin :
('a -> 'b -> 'b) ->
'b ->
key ->
'a ->
'b Stdlib__Map.Make(K).t ->
'b Stdlib__Map.Make(K).tval classify :
('a -> key) ->
('a -> 'b -> 'b) ->
'b ->
'a ->
'b Stdlib__Map.Make(K).t ->
'b Stdlib__Map.Make(K).tval incr :
?z:int ->
?i:int ->
key ->
int Stdlib__Map.Make(K).t ->
int Stdlib__Map.Make(K).tval next_key : K.t -> 'a Stdlib__Map.Make(K).t -> 'a optionval to_list : 'a Stdlib__Map.Make(K).t -> (key * 'a) listval keys : 'a Stdlib__Map.Make(K).t -> key listtype nonrec t = V.t {t}78val to_string : ?sep:string -> V.t {t}78 -> stringval print : ?sep:string -> V.t {t}78 -> unitval pp : Format.formatter -> V.t {t}78 -> unit