Up

Module Percent

An abstract type of scale factors

Signature

type t
include Std_internal.Stringable with type t := t
type t
val of_string : string -> t
val to_string : t -> string
include Std_internal.Sexpable with type t := t
type t
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
include Std_internal.Binable with type t := t
type t
val bin_size_t : t Bin_prot.Size.sizer
val bin_write_t : t Bin_prot.Write.writer
val bin_read_t : t Bin_prot.Read.reader
val __bin_read_t__ : (int -> t) Bin_prot.Read.reader

This function only needs implementation if t exposed to be a polymorphic variant. Despite what the type reads, this does *not* produce a function after reading; instead it takes the constructor tag (int) before reading and reads the rest of the variant t afterwards.

val bin_writer_t : t Bin_prot.Type_class.writer
val bin_reader_t : t Bin_prot.Type_class.reader
val bin_t : t Bin_prot.Type_class.t
include Std_internal.Comparable with type t := t
include Comparable_intf.S_common
include Comparable_intf.Polymorphic_compare
include Polymorphic_compare_intf.Infix
type 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
val min : t -> t -> t
val max : t -> t -> t
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 ~cmp:ascending and List.sort ~cmp:descending, since they cause the list to be sorted in ascending or descending order, respectively.

val descending : t -> t -> int
val between : t -> low:t -> high:t -> bool
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 clamp : t -> min:t -> max:t -> t Or_error.t
include Comparator.S with type t := t
type t
type comparator_witness
include Comparable_intf.Validate with type t := t
type t
val validate_lbound : min:t Maybe_bound.t -> t Validate.check
val validate_ubound : max:t Maybe_bound.t -> t Validate.check
val validate_bound : min:t Maybe_bound.t -> max:t Maybe_bound.t -> t Validate.check
module Map : Core_map.S with type Key.t = t with type Key.comparator_witness = comparator_witness
module Set : Core_set.S with type Elt.t = t with type Elt.comparator_witness = comparator_witness
include Comparable.With_zero with type t := t
type t
val validate_positive : t Validate.check
val validate_non_negative : t Validate.check
val validate_negative : t Validate.check
val validate_non_positive : t Validate.check
val is_positive : t -> bool
val is_non_negative : t -> bool
val is_negative : t -> bool
val is_non_positive : t -> bool
val sign : t -> Sign0.t

Returns Neg, Zero, or Pos in a way consistent with the above functions.

Arithmetic
include Commutative_group.S with type t := t
type t
val t_of_sexp : Sexplib.Sexp.t -> t
val sexp_of_t : t -> Sexplib.Sexp.t
val zero : t
val (+) : t -> t -> t
val (-) : t -> t -> t
val (*) : t -> t -> t
val neg : t -> t
val abs : t -> t
val is_zero : t -> bool
val is_nan : t -> bool
val is_inf : t -> bool
val apply : t -> float -> float

apply t x multiplies the percent t by x, returning a float

val scale : t -> float -> t

scale t x scales the percent t by x, returning a new t

val of_mult : float -> t

of_mult 5. is 5x = 500% = 50_000bp

val to_mult : t -> float
val of_percentage : float -> t

of_percentage 5. is 5% = 0.05x = 500bp

val to_percentage : t -> float
val of_bp : float -> t

of_bp 5. is 5bp = 0.05% = 0.0005x

val to_bp : t -> float
val of_bp_int : int -> t
val to_bp_int : t -> int

rounds down

val t_of_sexp_allow_nan_and_inf : Std_internal.Sexp.t -> t
val of_string_allow_nan_and_inf : string -> t
val validate : t -> Validate.t
module Stable : sig .. end