Module Id.Uid

Every Id.t contains a unique id that is distinct from the Uid.t in any other Id.t.

type t
val hash_fold_t : Hash.state -> t -> Hash.state
val hash : t -> Hash.hash_value
include Sexpable.S with type t := t
val sexp_of_t : t -> Sexp.t
val t_of_sexp : Sexp.t -> t
include Comparable.S with type t := t
include Base__.Comparable_intf.Validate with type t := t
val validate_bound : min:t Maybe_bound.t -> max:t Maybe_bound.t -> t Validate.check
val validate_ubound : max:t Maybe_bound.t -> t Validate.check
val validate_lbound : min:t Maybe_bound.t -> t Validate.check
include Comparator.S with type t := t
val comparator : (t, comparator_witness) Comparator.comparator
type comparator_witness
val clamp : t -> min:t -> max:t -> t Or_error.t
val clamp_exn : t -> min:t -> max:t -> t

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 between : t -> low:t -> high:t -> bool

between t ~low ~high means low <= t <= high

val descending : t -> t -> int
val ascending : t -> t -> int

ascending 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.

include Base__.Comparable_intf.Polymorphic_compare
include Comparisons.Infix with type t := t
val (>=) : t -> t -> bool
val (<=) : t -> t -> bool
val (=) : t -> t -> bool
val (>) : t -> t -> bool
val (<) : t -> t -> bool
val (<>) : t -> t -> bool
val equal : t -> t -> bool
val compare : t -> t -> int

compare t1 t2 returns 0 if t1 is equal to t2, a negative integer if t1 is less than t2, and a positive integer if t1 is greater than t2.

val min : t -> t -> t
val max : t -> t -> t