package core

  1. Overview
  2. Docs
Legend:
Library
Module
Module type
Parameter
Class
Class type
module Tree : sig ... end
include Bin_prot.Binable.S1 with type 'elt t := 'elt t
val bin_shape_t : Bin_prot__.Shape.t -> Bin_prot__.Shape.t
val bin_size_t : ('a, 'a t) Bin_prot__.Size.sizer1
val bin_write_t : ('a, 'a t) Bin_prot__.Write.writer1
val bin_read_t : ('a, 'a t) Bin_prot__.Read.reader1
val __bin_read_t__ : ('a, int -> 'a t) Bin_prot__.Read.reader1
val bin_writer_t : ('a, 'a t) Bin_prot__.Type_class.S1.writer
val bin_reader_t : ('a, 'a t) Bin_prot__.Type_class.S1.reader
val bin_t : ('a, 'a t) Bin_prot__.Type_class.S1.t
include Ppx_compare_lib.Comparable.S1 with type 'elt t := 'elt t
val compare : 'a Base__Ppx_compare_lib.compare -> 'a t Base__Ppx_compare_lib.compare
include Sexplib0.Sexpable.S1 with type 'elt t := 'elt t
val t_of_sexp : (Sexplib0__.Sexp.t -> 'a) -> Sexplib0__.Sexp.t -> 'a t
val sexp_of_t : ('a -> Sexplib0__.Sexp.t) -> 'a t -> Sexplib0__.Sexp.t
val t_sexp_grammar : 'elt Sexplib0.Sexp_grammar.t -> 'elt t Sexplib0.Sexp_grammar.t
include Set_intf.Creators_generic with type ('a, 'b) set := ('a, 'b) t with type ('elt, 'cmp) t := 'elt t with type ('elt, 'cmp) tree := 'elt Tree.t with type 'c cmp := Comparator.Poly.comparator_witness with type 'a elt := 'a with type ('a, 'b, 'c) create_options := ('a, 'b, 'c) Core__.Set_intf.Without_comparator.t
val empty : ('a, 'cmp, 'a t) Core__.Set_intf.Without_comparator.t
val singleton : ('a, 'cmp, 'a -> 'a t) Core__.Set_intf.Without_comparator.t
val union_list : ('a, 'cmp, 'a t list -> 'a t) Core__.Set_intf.Without_comparator.t
val of_list : ('a, 'cmp, 'a list -> 'a t) Core__.Set_intf.Without_comparator.t
val of_sequence : ('a, 'cmp, 'a Base__.Sequence.t -> 'a t) Core__.Set_intf.Without_comparator.t
val of_array : ('a, 'cmp, 'a array -> 'a t) Core__.Set_intf.Without_comparator.t
val of_sorted_array : ('a, 'cmp, 'a array -> 'a t Base__.Or_error.t) Core__.Set_intf.Without_comparator.t
val of_sorted_array_unchecked : ('a, 'cmp, 'a array -> 'a t) Core__.Set_intf.Without_comparator.t
val of_increasing_iterator_unchecked : ('a, 'cmp, len:int -> f:(int -> 'a) -> 'a t) Core__.Set_intf.Without_comparator.t
val stable_dedup_list : ('a, 'b, 'a list -> 'a list) Core__.Set_intf.Without_comparator.t
  • deprecated [since 2023-04] Use [List.stable_dedup] instead.
val map : ('b, 'cmp, ('a, 'c) t -> f:('a -> 'b) -> 'b t) Core__.Set_intf.Without_comparator.t
val filter_map : ('b, 'cmp, ('a, 'c) t -> f:('a -> 'b option) -> 'b t) Core__.Set_intf.Without_comparator.t
val of_tree : ('a, 'cmp, 'a Tree.t -> 'a t) Core__.Set_intf.Without_comparator.t
val of_hash_set : ('a, 'cmp, 'a Hash_set.t -> 'a t) Core__.Set_intf.Without_comparator.t
val of_hashtbl_keys : ('a, 'cmp, ('a, _) Hashtbl.t -> 'a t) Core__.Set_intf.Without_comparator.t
val of_map_keys : ('a, _, Comparator.Poly.comparator_witness) Base.Map.t -> 'a t

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

val quickcheck_generator : ('a, 'cmp, 'a Quickcheck.Generator.t -> 'a t Quickcheck.Generator.t) Core__.Set_intf.Without_comparator.t
OCaml

Innovation. Community. Security.