package incr_map

  1. Overview
  2. Docs
module Elt : sig ... end
module Diff : sig ... end
include Core.Set_intf.S_plain with module Elt := Elt and module Diff := Diff
type t = (Elt.t, Elt.comparator_witness) Base.Set.t
include Ppx_compare_lib.Comparable.S with type t := t
val compare : t Base__Ppx_compare_lib.compare
include Ppx_compare_lib.Equal.S with type t := t
val equal : t Base__Ppx_compare_lib.equal
include Diffable.S_plain with type t := t and module Diff := Diff
include Core.Set_intf.Creators_generic with type ('a, 'b) set := ('a, 'b) Core__.Set_intf.Set.t with type ('a, 'b) t := t with type ('a, 'b) tree := (Elt.t, Elt.comparator_witness) Core__.Set_intf.Tree.t with type 'a elt := Elt.t with type 'c cmp := Elt.comparator_witness with type ('a, 'b, 'c) create_options := ('a, 'b, 'c) Core__.Set_intf.Without_comparator.t
val empty : ('a, 'cmp, t) Core__.Set_intf.Without_comparator.t
val singleton : ('a, 'cmp, Elt.t -> t) Core__.Set_intf.Without_comparator.t
val union_list : ('a, 'cmp, t list -> t) Core__.Set_intf.Without_comparator.t
val of_list : ('a, 'cmp, Elt.t list -> t) Core__.Set_intf.Without_comparator.t
val of_sequence : ('a, 'cmp, Elt.t Base__.Sequence.t -> t) Core__.Set_intf.Without_comparator.t
val of_array : ('a, 'cmp, Elt.t array -> t) Core__.Set_intf.Without_comparator.t
val of_sorted_array : ('a, 'cmp, Elt.t array -> t Base__.Or_error.t) Core__.Set_intf.Without_comparator.t
val of_sorted_array_unchecked : ('a, 'cmp, Elt.t array -> t) Core__.Set_intf.Without_comparator.t
val of_increasing_iterator_unchecked : ('a, 'cmp, len:int -> f:(int -> Elt.t) -> t) Core__.Set_intf.Without_comparator.t
val stable_dedup_list : ('a, 'b, Elt.t list -> Elt.t list) Core__.Set_intf.Without_comparator.t
  • deprecated [since 2023-04] Use [List.stable_dedup] instead.
val map : ('b, 'cmp, ('a, 'c) Core__.Set_intf.Set.t -> f:('a -> Elt.t) -> t) Core__.Set_intf.Without_comparator.t
val filter_map : ('b, 'cmp, ('a, 'c) Core__.Set_intf.Set.t -> f:('a -> Elt.t option) -> t) Core__.Set_intf.Without_comparator.t
val of_tree : ('a, 'cmp, (Elt.t, Elt.comparator_witness) Core__.Set_intf.Tree.t -> t) Core__.Set_intf.Without_comparator.t
val of_hash_set : ('a, 'cmp, Elt.t Core.Hash_set.t -> t) Core__.Set_intf.Without_comparator.t
val of_hashtbl_keys : ('a, 'cmp, (Elt.t, _) Core.Hashtbl.t -> t) Core__.Set_intf.Without_comparator.t
val of_map_keys : (Elt.t, _, Elt.comparator_witness) Base.Map.t -> t

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

val quickcheck_generator : ('a, 'cmp, Elt.t Core.Quickcheck.Generator.t -> t Core.Quickcheck.Generator.t) Core__.Set_intf.Without_comparator.t
module Provide_of_sexp (Elt : sig ... end) : sig ... end
module Provide_bin_io (Elt : sig ... end) : Core.Set_intf.Binable.S with type t := t
module Provide_hash (Elt : sig ... end) : sig ... end
val t_of_sexp : Sexplib0__.Sexp.t -> t
val sexp_of_t : t -> Sexplib0__.Sexp.t
OCaml

Innovation. Community. Security.