`sig
type 'a t
type 'a tree
type key
val empty : 'a Core_map_intf.Creators1.t
val singleton :
Core_map_intf.Creators1.key -> 'a -> 'a Core_map_intf.Creators1.t
val of_alist :
(Core_map_intf.Creators1.key * 'a) list ->
[ `Duplicate_key of Core_map_intf.Creators1.key
| `Ok of 'a Core_map_intf.Creators1.t ]
val of_alist_or_error :
(Core_map_intf.Creators1.key * 'a) list ->
'a Core_map_intf.Creators1.t Or_error.t
val of_alist_exn :
(Core_map_intf.Creators1.key * 'a) list -> 'a Core_map_intf.Creators1.t
val of_alist_multi :
(Core_map_intf.Creators1.key * 'a) list ->
'a list Core_map_intf.Creators1.t
val of_alist_fold :
(Core_map_intf.Creators1.key * 'a) list ->
init:'b -> f:('b -> 'a -> 'b) -> 'b Core_map_intf.Creators1.t
val of_alist_reduce :
(Core_map_intf.Creators1.key * 'a) list ->
f:('a -> 'a -> 'a) -> 'a Core_map_intf.Creators1.t
val of_sorted_array :
(Core_map_intf.Creators1.key * 'a) array ->
'a Core_map_intf.Creators1.t Or_error.t
val of_sorted_array_unchecked :
(Core_map_intf.Creators1.key * 'a) array -> 'a Core_map_intf.Creators1.t
val of_tree :
'a Core_map_intf.Creators1.tree -> 'a Core_map_intf.Creators1.t
end`