Module Core_kernel.Univ_map

module type S = Core_kernel__Univ_map_intf.S
module type S1 = Core_kernel__Univ_map_intf.S1
module Key = Type_equal.Id
include S with type 'a data = 'a
type t
val sexp_of_t : t -> Ppx_sexp_conv_lib.Sexp.t
type 'a data = 'a
include Base.Invariant.S with type t := t
val invariant : t -> unit
val empty : t
val is_empty : t -> Base.Bool.t
val set : t -> 'a Type_equal.Id.t -> 'a data -> t
val mem : t -> 'a Type_equal.Id.t -> Base.Bool.t
val mem_by_id : t -> Type_equal.Id.Uid.t -> Base.Bool.t
val find : t -> 'a Type_equal.Id.t -> 'a data Base.Option.t
val find_exn : t -> 'a Type_equal.Id.t -> 'a data
val add : t -> 'a Type_equal.Id.t -> 'a data -> [ `Ok of t | `Duplicate ]
val add_exn : t -> 'a Type_equal.Id.t -> 'a data -> t
val change : t -> 'a Type_equal.Id.t -> f:('a data Base.Option.t -> 'a data Base.Option.t) -> t
val change_exn : t -> 'a Type_equal.Id.t -> f:('a data -> 'a data) -> t
val update : t -> 'a Type_equal.Id.t -> f:('a data Base.Option.t -> 'a data) -> t
val remove : t -> 'a Type_equal.Id.t -> t
val remove_by_id : t -> Type_equal.Id.Uid.t -> t
module Packed : sig ... end
val to_alist : t -> Packed.t Base.List.t
val of_alist_exn : Packed.t Base.List.t -> t
module Make : functor (Data : sig ... end) -> S with type 'a data = 'a Data.t
module Make1 : functor (Data : sig ... end) -> S1 with type ('s, 'a) data = ('s, 'a) Data.t
module With_default : sig ... end

keys with associated default values, so that find is no longer partial

module With_fold : sig ... end

keys that map to an accumulator value with an associated fold operation

module Multi : sig ... end

list-accumulating keys with a default value of the empty list