include Container.S0
type ttype elt
val mem : t -> elt -> boolval length : t -> intval is_empty : t -> boolval iter : t -> f:(elt -> unit) -> unitval fold : t -> init:'accum -> f:('accum -> elt -> 'accum) -> 'accumval fold_result : t -> init:'accum -> f:('accum -> elt -> ('accum, 'e) Result.t) -> ('accum, 'e) Result.tval fold_until : t -> init:'accum -> f:('accum -> elt -> ('accum, 'final) Base__.Container_intf.Export.Continue_or_stop.t) -> finish:('accum -> 'final) -> 'finalval exists : t -> f:(elt -> bool) -> boolval for_all : t -> f:(elt -> bool) -> boolval count : t -> f:(elt -> bool) -> intval sum : (module Base__.Container_intf.Summable with type t = 'sum) -> t -> f:(elt -> 'sum) -> 'sumval find : t -> f:(elt -> bool) -> elt optionval find_map : t -> f:(elt -> 'a option) -> 'a optionval to_list : t -> elt listval to_array : t -> elt arrayval min_elt : t -> compare:(elt -> elt -> int) -> elt optionval max_elt : t -> compare:(elt -> elt -> int) -> elt option
type treetype comparator_witness
val invariants : t -> boolval mem : t -> elt -> boolval add : t -> elt -> tval remove : t -> elt -> tval union : t -> t -> tval inter : t -> t -> tval diff : t -> t -> tval symmetric_diff : t -> t -> (elt, elt) Base__.Either.t Sequence.tval compare_direct : t -> t -> intval equal : t -> t -> boolval is_subset : t -> of_:t -> bool
type named
module Named : sig ... endval fold_until : t -> init:'b -> f:('b -> elt -> ('b, 'final) Base__.Container_intf.Export.Continue_or_stop.t) -> finish:('b -> 'final) -> 'finalval fold_right : t -> init:'b -> f:(elt -> 'b -> 'b) -> 'bval iter2 : t -> t -> f:([ `Left of elt | `Right of elt | `Both of elt * elt ] -> unit) -> unitval filter : t -> f:(elt -> bool) -> tval partition_tf : t -> f:(elt -> bool) -> t * tval elements : t -> elt listval min_elt : t -> elt optionval min_elt_exn : t -> eltval max_elt : t -> elt optionval max_elt_exn : t -> eltval choose : t -> elt optionval choose_exn : t -> eltval split : t -> elt -> t * elt option * tval group_by : t -> equiv:(elt -> elt -> bool) -> t listval find_exn : t -> f:(elt -> bool) -> eltval nth : t -> int -> elt optionval remove_index : t -> int -> tval to_tree : t -> treeval to_sequence : ?order:[ `Increasing | `Decreasing ] -> ?greater_or_equal_to:elt -> ?less_or_equal_to:elt -> t -> elt Sequence.tval binary_search : t -> compare:(elt -> 'key -> int) -> [ `Last_strictly_less_than | `Last_less_than_or_equal_to | `Last_equal_to | `First_equal_to | `First_greater_than_or_equal_to | `First_strictly_greater_than ] -> 'key -> elt optionval binary_search_segmented : t -> segment_of:(elt -> [ `Left | `Right ]) -> [ `Last_on_left | `First_on_right ] -> elt optionval merge_to_sequence : ?order:[ `Increasing | `Decreasing ] -> ?greater_or_equal_to:elt -> ?less_or_equal_to:elt -> t -> t -> (elt, elt) Base__.Set_intf.Merge_to_sequence_element.t Sequence.t