module Key : sig ... endtype 'a t = (Key.t, 'a, Key.comparator_witness) Core.Map.tinclude Sexplib0.Sexpable.S1 with type 'a t := 'a tval t_of_sexp : (Sexplib0.Sexp.t -> 'a) -> Sexplib0.Sexp.t -> 'a tval sexp_of_t : ('a -> Sexplib0.Sexp.t) -> 'a t -> Sexplib0.Sexp.tinclude Ppx_compare_lib.Comparable.S1 with type 'a t := 'a tinclude Ppx_compare_lib.Equal.S1 with type 'a t := 'a tinclude Core.Bin_prot.Binable.S1 with type 'a t := 'a tval bin_shape_t : Bin_prot.Shape.t -> Bin_prot.Shape.tval bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1val bin_write_t : ('a, 'a t) Bin_prot.Write.writer1val bin_read_t : ('a, 'a t) Bin_prot.Read.reader1val __bin_read_t__ : ('a, int -> 'a t) Bin_prot.Read.reader1val bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writerval bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.readerval bin_t : ('a, 'a t) Bin_prot.Type_class.S1.tinclude Diffable.S1 with type 'a t := 'a tmodule Diff : sig ... endval erase_key_incrementally :
?data_equal:('data -> 'data -> bool) ->
(('key, 'data, _) Core.Map.t, 'w) Incremental.t ->
get:(key:'key -> data:'data -> 'a) ->
('a t, 'w) Incremental.tWhen Opaque_maps are created incrementally we can be smart about insertion and get good performance around insertion and rebalancing.
empty, of_list, and of_array won't give you nice incrementality like erase_key_incrementally, but they are still fine if the primary goal is using the type itself outside of an incremental context.
But if possible, consider erase_key_incrementally.
val empty : _ tval of_list : 'a list -> 'a tval of_array : 'a array -> 'a tmodule Stable : sig ... end