package core

  1. Overview
  2. Docs
package core
Legend:
Library
Module
Module type
Parameter
Class
Class type
type ('elt, 'cmp) t
type ('elt, 'cmp) tree
type 'elt elt
type 'cmp cmp
include Accessors_generic with type ('a, 'b) t := ('a, 'b) t with type ('a, 'b) tree := ('a, 'b) tree with type 'a elt := 'a elt with type 'cmp cmp := 'cmp cmp
include Set.Accessors_generic with type ('a, 'b) t := ('a, 'b) t with type ('a, 'b) tree := ('a, 'b) tree with type 'a elt := 'a elt with type 'cmp cmp := 'cmp cmp
val length : ('a, 'b) t -> int
val is_empty : ('a, 'b) t -> bool
val iter : ('a, 'b) t -> f:('a elt -> unit) -> unit
val fold : ('a, 'b) t -> init:'acc -> f:('acc -> 'a elt -> 'acc) -> 'acc
val fold_result : ('a, 'b) t -> init:'acc -> f:('acc -> 'a elt -> ('acc, 'e) Base__.Result.t) -> ('acc, 'e) Base__.Result.t
val exists : ('a, 'b) t -> f:('a elt -> bool) -> bool
val for_all : ('a, 'b) t -> f:('a elt -> bool) -> bool
val count : ('a, 'b) t -> f:('a elt -> bool) -> int
val sum : (module Base__Container_intf.Summable with type t = 'sum) -> ('a, 'b) t -> f:('a elt -> 'sum) -> 'sum
val find : ('a, 'b) t -> f:('a elt -> bool) -> 'a elt option
val find_map : ('a, 'c) t -> f:('a elt -> 'b option) -> 'b option
val to_list : ('a, 'b) t -> 'a elt list
val to_array : ('a, 'b) t -> 'a elt array
type ('a, 'cmp, 'z) access_options
val invariants : ('a, 'cmp, ('a, 'cmp) t -> bool) access_options
val mem : ('a, 'cmp, ('a, 'cmp) t -> 'a elt -> bool) access_options
val add : ('a, 'cmp, ('a, 'cmp) t -> 'a elt -> ('a, 'cmp) t) access_options
val remove : ('a, 'cmp, ('a, 'cmp) t -> 'a elt -> ('a, 'cmp) t) access_options
val union : ('a, 'cmp, ('a, 'cmp) t -> ('a, 'cmp) t -> ('a, 'cmp) t) access_options
val inter : ('a, 'cmp, ('a, 'cmp) t -> ('a, 'cmp) t -> ('a, 'cmp) t) access_options
val diff : ('a, 'cmp, ('a, 'cmp) t -> ('a, 'cmp) t -> ('a, 'cmp) t) access_options
val symmetric_diff : ('a, 'cmp, ('a, 'cmp) t -> ('a, 'cmp) t -> ('a elt, 'a elt) Base__.Either.t Base__.Sequence.t) access_options
val compare_direct : ('a, 'cmp, ('a, 'cmp) t -> ('a, 'cmp) t -> int) access_options
val equal : ('a, 'cmp, ('a, 'cmp) t -> ('a, 'cmp) t -> bool) access_options
val is_subset : ('a, 'cmp, ('a, 'cmp) t -> of_:('a, 'cmp) t -> bool) access_options
val are_disjoint : ('a, 'cmp, ('a, 'cmp) t -> ('a, 'cmp) t -> bool) access_options
module Named : sig ... end
val fold_until : ('a, 'b) t -> init:'acc -> f:('acc -> 'a elt -> ('acc, 'final) Base__.Container.Continue_or_stop.t) -> finish:('acc -> 'final) -> 'final
val fold_right : ('a, 'b) t -> init:'acc -> f:('a elt -> 'acc -> 'acc) -> 'acc
val iter2 : ('a, 'cmp, ('a, 'cmp) t -> ('a, 'cmp) t -> f: ([ `Both of 'a elt * 'a elt | `Left of 'a elt | `Right of 'a elt ] -> unit) -> unit) access_options
val filter : ('a, 'cmp) t -> f:('a elt -> bool) -> ('a, 'cmp) t
val partition_tf : ('a, 'cmp) t -> f:('a elt -> bool) -> ('a, 'cmp) t * ('a, 'cmp) t
val elements : ('a, 'b) t -> 'a elt list
val min_elt : ('a, 'b) t -> 'a elt option
val min_elt_exn : ('a, 'b) t -> 'a elt
val max_elt : ('a, 'b) t -> 'a elt option
val max_elt_exn : ('a, 'b) t -> 'a elt
val choose : ('a, 'b) t -> 'a elt option
val choose_exn : ('a, 'b) t -> 'a elt
val split : ('a, 'cmp, ('a, 'cmp) t -> 'a elt -> ('a, 'cmp) t * 'a elt option * ('a, 'cmp) t) access_options
val split_le_gt : ('a, 'cmp, ('a, 'cmp) t -> 'a elt -> ('a, 'cmp) t * ('a, 'cmp) t) access_options
val split_lt_ge : ('a, 'cmp, ('a, 'cmp) t -> 'a elt -> ('a, 'cmp) t * ('a, 'cmp) t) access_options
val group_by : ('a, 'cmp) t -> equiv:('a elt -> 'a elt -> bool) -> ('a, 'cmp) t list
val find_exn : ('a, 'b) t -> f:('a elt -> bool) -> 'a elt
val nth : ('a, 'b) t -> int -> 'a elt option
val remove_index : ('a, 'cmp, ('a, 'cmp) t -> int -> ('a, 'cmp) t) access_options
val to_tree : ('a, 'cmp) t -> ('a elt, 'cmp cmp) tree
val to_sequence : ('a, 'cmp, ?order:[ `Decreasing | `Increasing ] -> ?greater_or_equal_to:'a elt -> ?less_or_equal_to:'a elt -> ('a, 'cmp) t -> 'a elt Base__.Sequence.t) access_options
val binary_search_segmented : ('a, 'cmp, ('a, 'cmp) t -> segment_of:('a elt -> [ `Left | `Right ]) -> Base__.Binary_searchable.Which_target_by_segment.t -> 'a elt option) access_options
val merge_to_sequence : ('a, 'cmp, ?order:[ `Decreasing | `Increasing ] -> ?greater_or_equal_to:'a elt -> ?less_or_equal_to:'a elt -> ('a, 'cmp) t -> ('a, 'cmp) t -> ('a elt, 'a elt) Base__Set_intf.Merge_to_sequence_element.t Base__.Sequence.t) access_options
val to_map : ('a, 'cmp, ('a, 'cmp) t -> f:('a elt -> 'b) -> ('a elt, 'b, 'cmp cmp) Base.Map.t) access_options
val quickcheck_observer : 'a elt Quickcheck.Observer.t -> ('a, 'cmp) t Quickcheck.Observer.t
val quickcheck_shrinker : ('a, 'cmp, 'a elt Quickcheck.Shrinker.t -> ('a, 'cmp) t Quickcheck.Shrinker.t) access_options
include Creators_generic with type ('a, 'b) t := ('a, 'b) t with type ('a, 'b) tree := ('a, 'b) tree with type 'a elt := 'a elt with type 'cmp cmp := 'cmp cmp
include Set.Creators_generic with type ('a, 'b) t := ('a, 'b) t with type ('a, 'b) tree := ('a, 'b) tree with type 'a elt := 'a elt with type 'cmp cmp := 'cmp cmp
type ('a, 'cmp) set
type ('a, 'cmp, 'z) create_options
val empty : ('a, 'cmp, ('a, 'cmp) t) create_options
val singleton : ('a, 'cmp, 'a elt -> ('a, 'cmp) t) create_options
val union_list : ('a, 'cmp, ('a, 'cmp) t list -> ('a, 'cmp) t) create_options
val of_list : ('a, 'cmp, 'a elt list -> ('a, 'cmp) t) create_options
val of_sequence : ('a, 'cmp, 'a elt Base__.Sequence.t -> ('a, 'cmp) t) create_options
val of_array : ('a, 'cmp, 'a elt array -> ('a, 'cmp) t) create_options
val of_sorted_array : ('a, 'cmp, 'a elt array -> ('a, 'cmp) t Base__.Or_error.t) create_options
val of_sorted_array_unchecked : ('a, 'cmp, 'a elt array -> ('a, 'cmp) t) create_options
val of_increasing_iterator_unchecked : ('a, 'cmp, len:int -> f:(int -> 'a elt) -> ('a, 'cmp) t) create_options
val stable_dedup_list : ('a, 'b, 'a elt list -> 'a elt list) create_options
val map : ('b, 'cmp, ('a, 'c) set -> f:('a -> 'b elt) -> ('b, 'cmp) t) create_options
val filter_map : ('b, 'cmp, ('a, 'c) set -> f:('a -> 'b elt option) -> ('b, 'cmp) t) create_options
val of_tree : ('a, 'cmp, ('a elt, 'cmp cmp) tree -> ('a, 'cmp) t) create_options
val of_hash_set : ('a, 'cmp, 'a elt Hash_set.t -> ('a, 'cmp) t) create_options
val of_hashtbl_keys : ('a, 'cmp, ('a elt, _) Hashtbl.t -> ('a, 'cmp) t) create_options
val of_map_keys : ('a elt, _, 'cmp cmp) Base.Map.t -> ('a, 'cmp) t

Never requires a comparator because it can get one from the input Map.t.

val quickcheck_generator : ('a, 'cmp, 'a elt Quickcheck.Generator.t -> ('a, 'cmp) t Quickcheck.Generator.t) create_options
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events Blog Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct