include Ppx_sexp_conv_lib.Sexpable.S with type t := Make(S1)(S2).t
val t_of_sexp : Sexplib0.Sexp.t -> Make(S1)(S2).tval sexp_of_t : Make(S1)(S2).t -> Sexplib0.Sexp.t
include Comparable.S with type t := Make(S1)(S2).t
include Base.Comparable.S with type t := Make(S1)(S2).t
include Base.Comparisons.Infix with type t := Make(S1)(S2).t
val (>=) : Make(S1)(S2).t -> Make(S1)(S2).t -> boolval (<=) : Make(S1)(S2).t -> Make(S1)(S2).t -> boolval (=) : Make(S1)(S2).t -> Make(S1)(S2).t -> boolval (>) : Make(S1)(S2).t -> Make(S1)(S2).t -> boolval (<) : Make(S1)(S2).t -> Make(S1)(S2).t -> boolval (<>) : Make(S1)(S2).t -> Make(S1)(S2).t -> bool
val equal : Make(S1)(S2).t -> Make(S1)(S2).t -> boolval compare : Make(S1)(S2).t -> Make(S1)(S2).t -> intcompare t1 t2returns 0 ift1is equal tot2, a negative integer ift1is less thant2, and a positive integer ift1is greater thant2.
val min : Make(S1)(S2).t -> Make(S1)(S2).t -> Make(S1)(S2).tval max : Make(S1)(S2).t -> Make(S1)(S2).t -> Make(S1)(S2).t
val ascending : Make(S1)(S2).t -> Make(S1)(S2).t -> intascendingis identical tocompare.descending x y = ascending y x. These are intended to be mnemonic when used likeList.sort ~compare:ascendingandList.sort ~cmp:descending, since they cause the list to be sorted in ascending or descending order, respectively.
val descending : Make(S1)(S2).t -> Make(S1)(S2).t -> intval between : Make(S1)(S2).t -> low:Make(S1)(S2).t -> high:Make(S1)(S2).t -> boolbetween t ~low ~highmeanslow <= t <= high
val clamp_exn : Make(S1)(S2).t -> min:Make(S1)(S2).t -> max:Make(S1)(S2).t -> Make(S1)(S2).tclamp_exn t ~min ~maxreturnst', the closest value totsuch thatbetween t' ~low:min ~high:maxis true.Raises if
not (min <= max).
val clamp : Make(S1)(S2).t -> min:Make(S1)(S2).t -> max:Make(S1)(S2).t -> Make(S1)(S2).t Base.Or_error.t
include Base.Comparator.S with type t := Make(S1)(S2).t
val comparator : (Make(S1)(S2).t, comparator_witness) Base.Comparator.comparator
val validate_lbound : min:Make(S1)(S2).t Base.Maybe_bound.t -> Make(S1)(S2).t Base.Validate.checkval validate_ubound : max:Make(S1)(S2).t Base.Maybe_bound.t -> Make(S1)(S2).t Base.Validate.checkval validate_bound : min:Make(S1)(S2).t Base.Maybe_bound.t -> max:Make(S1)(S2).t Base.Maybe_bound.t -> Make(S1)(S2).t Base.Validate.check
module Replace_polymorphic_compare : sig ... endmodule Map : Map.S with type Key.t = Make(S1)(S2).t with type Key.comparator_witness = comparator_witnessmodule Set : Set.S with type Elt.t = Make(S1)(S2).t with type Elt.comparator_witness = comparator_witness