package core

  1. Overview
  2. Docs
package core
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module Set.Using_comparatorSource

include Set_intf.Creators_generic with type ('a, 'b) set := ('a, 'b) t with type ('a, 'b) t := ('a, 'b) t with type ('a, 'b) tree := ('a, 'b) Tree.t with type 'a elt := 'a with type 'c cmp := 'c with type ('a, 'b, 'c) create_options := ('a, 'b, 'c) Base.Set.With_comparator.t
include Base.Set.Creators_generic with type ('a, 'b) set := ('a, 'b) t with type ('a, 'b) t := ('a, 'b) t with type ('a, 'b) tree := ('a, 'b) Tree.t with type 'a elt := 'a with type 'c cmp := 'c with type ('a, 'b, 'c) create_options := ('a, 'b, 'c) Base.Set.With_comparator.t
Sourceval empty : ('a, 'cmp, ('a, 'cmp) t) Base.Set.With_comparator.t
Sourceval singleton : ('a, 'cmp, 'a -> ('a, 'cmp) t) Base.Set.With_comparator.t
Sourceval union_list : ('a, 'cmp, ('a, 'cmp) t list -> ('a, 'cmp) t) Base.Set.With_comparator.t
Sourceval of_list : ('a, 'cmp, 'a list -> ('a, 'cmp) t) Base.Set.With_comparator.t
Sourceval of_sequence : ('a, 'cmp, 'a Base.Sequence.t -> ('a, 'cmp) t) Base.Set.With_comparator.t
Sourceval of_array : ('a, 'cmp, 'a array -> ('a, 'cmp) t) Base.Set.With_comparator.t
Sourceval of_sorted_array : ('a, 'cmp, 'a array -> ('a, 'cmp) t Base.Or_error.t) Base.Set.With_comparator.t
Sourceval of_sorted_array_unchecked : ('a, 'cmp, 'a array -> ('a, 'cmp) t) Base.Set.With_comparator.t
Sourceval of_increasing_iterator_unchecked : ('a, 'cmp, len:int -> f:(int -> 'a) -> ('a, 'cmp) t) Base.Set.With_comparator.t
Sourceval stable_dedup_list : ('a, _, 'a list -> 'a list) Base.Set.With_comparator.t
  • deprecated [since 2023-04] Use [List.stable_dedup] instead.
Sourceval map : ('b, 'cmp, ('a, _) t -> f:('a -> 'b) -> ('b, 'cmp) t) Base.Set.With_comparator.t

The types of map and filter_map are subtle. The input set, ('a, _) set, reflects the fact that these functions take a set of *any* type, with any comparator, while the output set, ('b, 'cmp) t, reflects that the output set has the particular 'cmp of the creation function. The comparator can come in one of three ways, depending on which set module is used

  • Set.map -- comparator comes as an argument
  • Set.Poly.map -- comparator is polymorphic comparison
  • Foo.Set.map -- comparator is Foo.comparator
Sourceval filter_map : ('b, 'cmp, ('a, _) t -> f:('a -> 'b option) -> ('b, 'cmp) t) Base.Set.With_comparator.t
Sourceval of_tree : ('a, 'cmp, ('a, 'cmp) Tree.t -> ('a, 'cmp) t) Base.Set.With_comparator.t
Sourceval of_hash_set : ('a, 'cmp, 'a Hash_set.t -> ('a, 'cmp) t) Base.Set.With_comparator.t
Sourceval of_hashtbl_keys : ('a, 'cmp, ('a, _) Hashtbl.t -> ('a, 'cmp) t) Base.Set.With_comparator.t
Sourceval of_map_keys : ('a, _, 'cmp) Base.Map.t -> ('a, 'cmp) t

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

Sourceval quickcheck_generator : ('a, 'cmp, 'a Quickcheck.Generator.t -> ('a, 'cmp) t Quickcheck.Generator.t) Base.Set.With_comparator.t
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet 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