Tree (core_kernel.Core_kernel.Set.Poly.Tree)

type 'elt t = ('elt, Comparator.Poly.comparator_witness) Tree.t

include Ppx_sexp_conv_lib.Sexpable.S1 with type 'elt t := 'elt t

val t_of_sexp : (Sexplib0.Sexp.t -> 'a) -> Sexplib0.Sexp.t -> 'elt t
val sexp_of_t : ('a -> Sexplib0.Sexp.t) -> 'elt t -> Sexplib0.Sexp.t

type 'a named = ('a, Comparator.Poly.comparator_witness) Tree.Named.t

include Set_intf.Creators_and_accessors1 with type ('a, 'b) set := ('a, 'b) Tree.t with type 'elt t := 'elt t with type 'elt tree := 'elt t with type 'a named := 'a named with type comparator_witness := Comparator.Poly.comparator_witness

include Set_intf.Accessors1 with type comparator_witness := Comparator.Poly.comparator_witness and type 'a named := 'a named and type 'elt tree := 'elt t and type 'elt t := 'elt t

include Set_intf.Set.Accessors1 with type 'elt t := 'elt t and type 'elt tree := 'elt t and type 'a named := 'a named and type comparator_witness := Comparator.Poly.comparator_witness

include Base.Container.S1 with type 'elt t := 'elt t

val mem : 'elt t -> 'a -> equal:('a -> 'a -> bool) -> bool: Checks whether the provided element is there, using equal.

val length : 'elt t -> int
val is_empty : 'elt t -> bool
val iter : 'elt t -> f:('a -> unit) -> unit
val fold : 'elt t -> init:'accum -> f:('accum -> 'a -> 'accum) -> 'accum: fold t ~init ~f returns f (... f (f (f init e1) e2) e3 ...) en, where e1..en are the elements of t

val fold_result : 'elt t -> init:'accum -> f:('accum -> 'a -> ('accum, 'e) Base.Result.t) -> ('accum, 'e) Base.Result.t: fold_result t ~init ~f is a short-circuiting version of fold that runs in the Result monad. If f returns an Error _, that value is returned without any additional invocations of f.

val fold_until : 'elt t -> init:'accum -> f:('accum -> 'a -> ('accum, 'final) Base__Container_intf.Export.Continue_or_stop.t) -> finish:('accum -> 'final) -> 'final

fold_until t ~init ~f ~finish is a short-circuiting version of fold. If f returns Stop _ the computation ceases and results in that value. If f returns Continue _, the fold will proceed. If f never returns Stop _, the final result is computed by finish.

Example:

type maybe_negative =
  | Found_negative of int
  | All_nonnegative of { sum : int }

(** [first_neg_or_sum list] returns the first negative number in [list], if any,
    otherwise returns the sum of the list. *)
let first_neg_or_sum =
  List.fold_until ~init:0
    ~f:(fun sum x ->
      if x < 0
      then Stop (Found_negative x)
      else Continue (sum + x))
    ~finish:(fun sum -> All_nonnegative { sum })
;;

let x = first_neg_or_sum [1; 2; 3; 4; 5]
val x : maybe_negative = All_nonnegative {sum = 15}

let y = first_neg_or_sum [1; 2; -3; 4; 5]
val y : maybe_negative = Found_negative -3

val exists : 'elt t -> f:('a -> bool) -> bool: Returns true if and only if there exists an element for which the provided function evaluates to true. This is a short-circuiting operation.

val for_all : 'elt t -> f:('a -> bool) -> bool: Returns true if and only if the provided function evaluates to true for all elements. This is a short-circuiting operation.

val count : 'elt t -> f:('a -> bool) -> int: Returns the number of elements for which the provided function evaluates to true.

val sum : (module Base__Container_intf.Summable with type t = 'sum) -> 'elt t -> f:('a -> 'sum) -> 'sum: Returns the sum of f i for all i in the container.

val find : 'elt t -> f:('a -> bool) -> 'a option: Returns as an option the first element for which f evaluates to true.

val find_map : 'elt t -> f:('a -> 'b option) -> 'b option: Returns the first evaluation of f that returns Some, and returns None if there is no such element.

val to_list : 'elt t -> 'a list
val to_array : 'elt t -> 'a array
val min_elt : 'elt t -> compare:('a -> 'a -> int) -> 'a option: Returns a minimum (resp maximum) element from the collection using the provided compare function, or None if the collection is empty. In case of a tie, the first element encountered while traversing the collection is returned. The implementation uses fold so it has the same complexity as fold.

val max_elt : 'elt t -> compare:('a -> 'a -> int) -> 'a option

val invariants : 'elt t -> bool
val mem : 'elt t -> 'a -> bool
val add : 'elt t -> 'a -> 'elt t
val remove : 'elt t -> 'a -> 'elt t
val union : 'elt t -> 'elt t -> 'elt t
val inter : 'elt t -> 'elt t -> 'elt t
val diff : 'elt t -> 'elt t -> 'elt t
val symmetric_diff : 'elt t -> 'elt t -> ('a, 'a) Base.Either.t Base.Sequence.t
val compare_direct : 'elt t -> 'elt t -> int
val equal : 'elt t -> 'elt t -> bool
val is_subset : 'elt t -> of_:'elt t -> bool
val are_disjoint : 'elt t -> 'elt t -> bool

module Named : sig ... end

val fold_until : 'elt t -> init:'b -> f:('b -> 'a -> ('b, 'final) Base__Set_intf.Continue_or_stop.t) -> finish:('b -> 'final) -> 'final
val fold_right : 'elt t -> init:'b -> f:('a -> 'b -> 'b) -> 'b
val iter2 : 'elt t -> 'elt t -> f:([ `Left of 'a | `Right of 'a | `Both of 'a * 'a ] -> unit) -> unit
val filter : 'elt t -> f:('a -> bool) -> 'elt t
val partition_tf : 'elt t -> f:('a -> bool) -> 'elt t * 'elt t
val elements : 'elt t -> 'a list
val min_elt : 'elt t -> 'a option
val min_elt_exn : 'elt t -> 'a
val max_elt : 'elt t -> 'a option
val max_elt_exn : 'elt t -> 'a
val choose : 'elt t -> 'a option
val choose_exn : 'elt t -> 'a
val split : 'elt t -> 'a -> 'elt t * 'a option * 'elt t
val group_by : 'elt t -> equiv:('a -> 'a -> bool) -> 'elt t list
val find_exn : 'elt t -> f:('a -> bool) -> 'a
val nth : 'elt t -> int -> 'a option
val remove_index : 'elt t -> int -> 'elt t
val to_tree : 'elt t -> 'elt t
val to_sequence : ?⁠order:[ `Increasing | `Decreasing ] -> ?⁠greater_or_equal_to:'a -> ?⁠less_or_equal_to:'a -> 'elt t -> 'a Base.Sequence.t
val binary_search : 'elt t -> compare:('a -> '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 -> 'a option
val binary_search_segmented : 'elt t -> segment_of:('a -> [ `Left | `Right ]) -> [ `Last_on_left | `First_on_right ] -> 'a option
val merge_to_sequence : ?⁠order:[ `Increasing | `Decreasing ] -> ?⁠greater_or_equal_to:'a -> ?⁠less_or_equal_to:'a -> 'elt t -> 'elt t -> ('a, 'a) Base.Sequence.Merge_with_duplicates_element.t Base.Sequence.t

val to_map : 'elt t -> f:('a -> 'b) -> ('a, 'b, Comparator.Poly.comparator_witness) Base.Map.t
val quickcheck_observer : 'a Quickcheck.Observer.t -> 'elt t Quickcheck.Observer.t
val quickcheck_shrinker : 'a Quickcheck.Shrinker.t -> 'elt t Quickcheck.Shrinker.t

include Set_intf.Creators1 with type 'a t := 'elt t with type 'a tree := 'elt t with type ('a, 'b) set := ('a, 'b) Tree.t and type comparator_witness := Comparator.Poly.comparator_witness

include Set_intf.Set.Creators1 with type comparator_witness := Comparator.Poly.comparator_witness and type ('a, 'b) set := ('a, 'b) Tree.t and type 'a tree := 'elt t and type 'a t := 'elt t

val empty : 'elt t
val singleton : 'a -> 'elt t
val union_list : 'elt t list -> 'elt t
val of_list : 'a list -> 'elt t
val of_array : 'a array -> 'elt t
val of_sorted_array : 'a array -> 'elt t Base.Or_error.t
val of_sorted_array_unchecked : 'a array -> 'elt t
val of_increasing_iterator_unchecked : len:int -> f:(int -> 'a) -> 'elt t
val stable_dedup_list : 'a list -> 'a list
val map : ('a, 'b) Tree.t -> f:('a -> 'b) -> 'elt t
val filter_map : ('a, 'b) Tree.t -> f:('a -> 'b option) -> 'elt t
val of_tree : 'elt t -> 'elt t

val of_hash_set : 'a Hash_set.t -> 'elt t
val of_hashtbl_keys : ('a, _) Hashtbl.t -> 'elt t
val of_map_keys : ('a, _, Comparator.Poly.comparator_witness) Base.Map.t -> 'elt t
val quickcheck_generator : 'a Quickcheck.Generator.t -> 'elt t Quickcheck.Generator.t