val hash_fold_t : Base.Hash.state ‑> t ‑> Base.Hash.stateval hash : t ‑> Base.Hash.hash_valueval t_of_sexp : Sexplib0.Sexp.t ‑> Sexplib0.Sexp.tval sexp_of_t : Sexplib0.Sexp.t ‑> Sexplib0.Sexp.tval equal : Sexplib0.Sexp.t ‑> Sexplib0.Sexp.t ‑> boolval compare : Sexplib0.Sexp.t ‑> Sexplib0.Sexp.t ‑> intexception Not_found_s of Sexplib0.Sexp.texception Of_sexp_error of exn * Sexplib0.Sexp.tval message : string ‑> (string * Sexplib0.Sexp.t) list ‑> Sexplib0.Sexp.tval pp_hum : Format.formatter ‑> Sexplib0.Sexp.t ‑> unitval pp_hum_indent : int ‑> Format.formatter ‑> Sexplib0.Sexp.t ‑> unitval pp_mach : Format.formatter ‑> Sexplib0.Sexp.t ‑> unitval pp : Format.formatter ‑> Sexplib0.Sexp.t ‑> unitval to_string_hum : ?indent:int ‑> Sexplib0.Sexp.t ‑> stringval to_string_mach : Sexplib0.Sexp.t ‑> stringval to_string : Sexplib0.Sexp.t ‑> stringmodule Private = Base__Sexp.Privateinclude Base.Comparable.S with type t := tinclude Base__.Comparable_intf.Polymorphic_compareascending 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 : t ‑> min:t ‑> max:t ‑> t Base.Or_error.tinclude Base.Comparator.S with type t := tval comparator : (t, comparator_witness) Base.Comparator.comparatorinclude Base__.Comparable_intf.Validate with type t := tval validate_lbound : min:t Base.Maybe_bound.t ‑> t Base.Validate.checkval validate_ubound : max:t Base.Maybe_bound.t ‑> t Base.Validate.checkval validate_bound : min:t Base.Maybe_bound.t ‑> max:t Base.Maybe_bound.t ‑> t Base.Validate.check