Module Base__Source_code_position
One typically obtains a Source_code_position.t using a [%here] expression, which is implemented by the ppx_here preprocessor.
type t= Base__.Import.Caml.Lexing.position={pos_fname : string;pos_lnum : int;pos_bol : int;pos_cnum : int;}See INRIA's OCaml documentation for a description of these fields.
sexp_of_tuses the form"FILE:LINE:COL", and does not have a correspondingof_sexp.
val hash_fold_t : Base.Hash.state -> t -> Base.Hash.stateval hash : t -> Base.Hash.hash_valueval sexp_of_t : t -> Base.Sexp.t
include Base.Comparable.S with type t := t
include Base__.Comparable_intf.Polymorphic_compare
val ascending : t -> 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 : t -> t -> intval between : t -> low:t -> high:t -> boolbetween t ~low ~highmeanslow <= t <= high
val clamp_exn : t -> min:t -> max:t -> tclamp_exn t ~min ~maxreturnst', the closest value totsuch thatbetween t' ~low:min ~high:maxis 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
include Base__.Comparable_intf.Validate with type t := t
val 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
val to_string : t -> stringto_string tconvertstto the form"FILE:LINE:COL".
val of_pos : (string * int * int * int) -> tof_pos Caml.__POS__is like[%here]but without using ppx.