include Map.Creators1
type 'a ttype 'a treetype key
val empty : 'a tval singleton : key -> 'a -> 'a tval of_alist : (key * 'a) list -> [ `Duplicate_key of key | `Ok of 'a t ]val of_alist_or_error : (key * 'a) list -> 'a t Base.Or_error.tval of_alist_exn : (key * 'a) list -> 'a tval of_alist_multi : (key * 'a) list -> 'a list tval of_alist_fold : (key * 'a) list -> init:'b -> f:('b -> 'a -> 'b) -> 'b tval of_alist_reduce : (key * 'a) list -> f:('a -> 'a -> 'a) -> 'a tval of_sorted_array : (key * 'a) array -> 'a t Base.Or_error.tval of_sorted_array_unchecked : (key * 'a) array -> 'a tval of_increasing_iterator_unchecked : len:int -> f:(int -> key * 'a) -> 'a tval of_increasing_sequence : (key * 'a) Base.Sequence.t -> 'a t Base.Or_error.tval of_iteri : iteri:(f:(key:key -> data:'v -> unit) -> unit) -> [ `Duplicate_key of key | `Ok of 'v t ]val of_tree : 'a tree -> 'a t
val of_hashtbl_exn : (key, 'a) Hashtbl.t -> 'a tval quickcheck_generator : key Quickcheck.Generator.t -> 'a Quickcheck.Generator.t -> 'a t Quickcheck.Generator.t