Module Opaque_mapSource

Sourcemodule Key : sig ... end
include Sexplib0.Sexpable.S1 with type 'a t := 'a t
Sourceval t_of_sexp : (Sexplib0.Sexp.t -> 'a) -> Sexplib0.Sexp.t -> 'a t
Sourceval sexp_of_t : ('a -> Sexplib0.Sexp.t) -> 'a t -> Sexplib0.Sexp.t
include Ppx_compare_lib.Comparable.S1 with type 'a t := 'a t
Sourceval compare : ('a -> 'a -> int) -> 'a t -> 'a t -> int
include Ppx_compare_lib.Equal.S1 with type 'a t := 'a t
Sourceval equal : ('a -> 'a -> bool) -> 'a t -> 'a t -> bool
include Core.Bin_prot.Binable.S1 with type 'a t := 'a t
Sourceval bin_size_t : ('a, 'a t) Bin_prot.Size.sizer1
Sourceval bin_write_t : ('a, 'a t) Bin_prot.Write.writer1
Sourceval bin_read_t : ('a, 'a t) Bin_prot.Read.reader1
Sourceval __bin_read_t__ : ('a, int -> 'a t) Bin_prot.Read.reader1
Sourceval bin_writer_t : ('a, 'a t) Bin_prot.Type_class.S1.writer
Sourceval bin_reader_t : ('a, 'a t) Bin_prot.Type_class.S1.reader
Sourceval bin_t : ('a, 'a t) Bin_prot.Type_class.S1.t
include Diffable.S1 with type 'a t := 'a t
Sourcemodule Diff : sig ... end
Sourceval 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.t

When 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.

Sourceval empty : _ t
Sourceval of_list : 'a list -> 'a t
Sourceval of_array : 'a array -> 'a t
Sourcemodule Stable : sig ... end