creates a module implementing Opaque interface.
module M : sig ... endinclude Core_kernel.Comparable.S with type t := M.tinclude Base.Comparable.S with type t := M.tinclude Base.Comparisons.S with type t := M.tascending is identical to compare. descending x y = ascending y x. These are intended to be mnemonic when used like List.sort ~compare:ascending and List.sort
~cmp:descending, since they cause the list to be sorted in ascending or descending order, respectively.
clamp_exn t ~min ~max returns t', the closest value to t such that between t' ~low:min ~high:max is true.
Raises if not (min <= max).
val clamp : M.t -> min:M.t -> max:M.t -> M.t Base.Or_error.tinclude Base.Comparator.S with type t := M.tval comparator : (M.t, comparator_witness) Base.Comparator.comparatorval validate_lbound : min:M.t Core.Maybe_bound.t -> M.t Validate.checkval validate_ubound : max:M.t Core.Maybe_bound.t -> M.t Validate.checkval validate_bound :
min:M.t Core.Maybe_bound.t ->
max:M.t Core.Maybe_bound.t ->
M.t Validate.checkmodule Replace_polymorphic_compare :
Base.Comparable.Polymorphic_compare with type t := M.tmodule Map :
Core.Map.S
with type Key.t = M.t
with type Key.comparator_witness = comparator_witnessmodule Set :
Core.Set.S
with type Elt.t = M.t
with type Elt.comparator_witness = comparator_witnessinclude Core_kernel.Hashable.S with type t := M.tinclude Ppx_compare_lib.Comparable.S with type t := M.tinclude Ppx_hash_lib.Hashable.S with type t := M.tval hash_fold_t : Base.Hash.state -> M.t -> Base.Hash.stateval hash : M.t -> Base.Hash.hash_valueval hashable : M.t Base.Hashable.tmodule Table : Core.Hashtbl.S with type key = M.tmodule Hash_set : Core.Hash_set.S with type elt = M.tmodule Hash_queue : Core.Hash_queue.S with type key = M.t