type t = Ocaml_common.Longident.t =
| Lident of Base.String.t |
| Ldot of t * Base.String.t |
| Lapply of t * t |
include Base.Comparable.S with type t := t
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
.
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.
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.t
include Base.Comparator.S with type t := t
val comparator : (t, comparator_witness) Base.Comparator.comparator
val validate_lbound : min:t Base.Maybe_bound.t -> t Base.Validate.check
val validate_ubound : max:t Base.Maybe_bound.t -> t Base.Validate.check
val validate_bound : min:t Base.Maybe_bound.t -> max:t Base.Maybe_bound.t -> t Base.Validate.check
val flatten_exn : t -> Base.String.t Base.List.t
val last_exn : t -> Base.String.t
val parse : Base.String.t -> t
Parses the given string as a longident, properly handling infix operators which may contain '.'. Note that it does not parse Lapply _
longidents and will raise Invalid_argument _
if passed values such as "A(B)"
.
val name : t -> Base.String.t