include Map.Creators_generic with type 'a cmp := 'a Cmp.t and type 'a key := 'a Key.t and type ('a, 'b, 'c) tree := ('a, 'b, 'c) Tree.t and type ('a, 'b, 'c) t := ('a, 'b, 'c) T.t and type ('a, 'b, 'c) options := ('a, 'b, 'c) Options.t
val empty : ('a, 'b, 'c) Options.t
val singleton : ('a, 'b, 'c) Options.t
val of_sorted_array : ('a, 'b, 'c) Options.t
val of_sorted_array_unchecked : ('a, 'b, 'c) Options.t
val of_increasing_iterator_unchecked : ('a, 'b, 'c) Options.t
val of_alist : ('a, 'b, 'c) Options.t
val of_alist_or_error : ('a, 'b, 'c) Options.t
val of_alist_exn : ('a, 'b, 'c) Options.t
val of_alist_multi : ('a, 'b, 'c) Options.t
val of_alist_fold : ('a, 'b, 'c) Options.t
val of_alist_reduce : ('a, 'b, 'c) Options.t
val of_increasing_sequence : ('a, 'b, 'c) Options.t
val of_sequence : ('a, 'b, 'c) Options.t
val of_sequence_or_error : ('a, 'b, 'c) Options.t
val of_sequence_exn : ('a, 'b, 'c) Options.t
val of_sequence_multi : ('a, 'b, 'c) Options.t
val of_sequence_fold : ('a, 'b, 'c) Options.t
val of_sequence_reduce : ('a, 'b, 'c) Options.t
val of_iteri : ('a, 'b, 'c) Options.t
val of_tree : ('a, 'b, 'c) Options.t
val of_hashtbl_exn : ('a, 'b, 'c) Options.t
val of_key_set : ('a Key.t, 'a Cmp.t) Base.Set.t -> f:('a Key.t -> 'v) -> ('a, 'b, 'c) T.t
Never requires a comparator because it can get one from the input
Set.t
.
val quickcheck_generator : ('a, 'b, 'c) Options.t