base

Full standard library replacement for OCaml
IN THIS PACKAGE
Module type Base . Map . Creators1
type 'a t
type 'a tree
type key
type comparator_witness
val empty : _ t
val singleton : key -> 'a -> 'a t
val of_alist : (key * 'a) list -> [ `Ok of 'a t | `Duplicate_key of key ]
val of_alist_or_error : (key * 'a) list -> 'a t Or_error.t
val of_alist_exn : (key * 'a) list -> 'a t
val of_alist_multi : (key * 'a) list -> 'a list t
val of_alist_fold : (key * 'a) list -> init:'b -> f:( 'b -> 'a -> 'b ) -> 'b t
val of_alist_reduce : (key * 'a) list -> f:( 'a -> 'a -> 'a ) -> 'a t
val of_sorted_array : (key * 'a) array -> 'a t Or_error.t
val of_sorted_array_unchecked : (key * 'a) array -> 'a t
val of_increasing_iterator_unchecked : len:int -> f:( int -> key * 'a ) -> 'a t
val of_increasing_sequence : (key * 'a) Sequence.t -> 'a t Or_error.t
val of_sequence : (key * 'a) Sequence.t -> [ `Ok of 'a t | `Duplicate_key of key ]
val of_sequence_or_error : (key * 'a) Sequence.t -> 'a t Or_error.t
val of_sequence_exn : (key * 'a) Sequence.t -> 'a t
val of_sequence_multi : (key * 'a) Sequence.t -> 'a list t
val of_sequence_fold : (key * 'a) Sequence.t -> init:'b -> f:( 'b -> 'a -> 'b ) -> 'b t
val of_sequence_reduce : (key * 'a) Sequence.t -> f:( 'a -> 'a -> 'a ) -> 'a t
val of_iteri : iteri:( f:( key:key -> data:'v -> unit ) -> unit ) -> [ `Ok of 'v t | `Duplicate_key of key ]
val of_tree : 'a tree -> 'a t