Identifiable.Make_plainmodule M : sig ... endinclude S_common with type t := M.tval sexp_of_t : M.t -> Ppx_sexp_conv_lib.Sexp.tinclude Base.Stringable.S with type t := M.tval of_string : string -> M.tval to_string : M.t -> stringinclude Base.Pretty_printer.S with type t := M.tval pp : Base.Formatter.t -> M.t -> unitinclude Comparable.S_plain 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 Base.Maybe_bound.t -> M.t Base.Validate.checkval validate_ubound : max:M.t Base.Maybe_bound.t -> M.t Base.Validate.checkval validate_bound : min:M.t Base.Maybe_bound.t -> max:M.t Base.Maybe_bound.t -> M.t Base.Validate.checkmodule Replace_polymorphic_compare : Base.Comparable.Polymorphic_compare with type t := M.tmodule Map : Map.S_plain with type Key.t = M.t with type Key.comparator_witness = comparator_witnessmodule Set : Set.S_plain with type Elt.t = M.t with type Elt.comparator_witness = comparator_witnessinclude Hashable.S_plain with type t := M.tinclude Hashable.Common with type t := M.tval compare : M.t -> M.t -> Base.Int.tval hash_fold_t : Base.Hash.state -> M.t -> Base.Hash.stateval hash : M.t -> Base.Hash.hash_valueval hashable : M.t Hashtbl.Hashable.tmodule Table : Hashtbl.S_plain with type key = M.tmodule Hash_set : Hash_set.S_plain with type elt = M.tmodule Hash_queue : Hash_queue.S with type key = M.t