Float3232-bit floating-point representation and utilities. This is essentially a copy of the Base.Float API.
include Bin_prot.Binable.S__local with type t := tinclude Bin_prot.Binable.S_only_functions__local with type t := tval bin_read_t : t Bin_prot.Read.readerval __bin_read_t__ : t Bin_prot.Read.vtag_readerThis 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_shape_t : Bin_prot.Shape.tval bin_writer_t : t Bin_prot.Type_class.writerval bin_reader_t : t Bin_prot.Type_class.readerval bin_t : t Bin_prot.Type_class.tinclude Sexplib0.Sexpable.S__stack with type t := tinclude Sexplib0.Sexpable.Of_sexp with type t := tinclude Sexplib0.Sexpable.Sexp_of__stack with type t := tinclude Ppx_quickcheck_runtime.Quickcheckable.S with type t := tval quickcheck_generator : t Base_quickcheck.Generator.tval quickcheck_observer : t Base_quickcheck.Observer.tval quickcheck_shrinker : t Base_quickcheck.Shrinker.tinclude Base.Floatable.S with type t := tmax and min will return nan if either argument is nan.
The validate_* functions always fail if class is Nan or Infinite.
include Base.Identifiable.S__local with type t := tinclude Ppx_hash_lib.Hashable.S_any with type t := tval hash_fold_t : t Ppx_hash_lib.hash_foldval hash : t -> Ppx_hash_lib.Std.Hash.hash_valueinclude Sexplib0.Sexpable.S with type t := tinclude Sexplib0.Sexpable.Of_sexp with type t := tval t_of_sexp : Sexplib0.Sexp.t -> tinclude Sexplib0.Sexpable.Sexp_of with type t := tval sexp_of_t : t -> Sexplib0.Sexp.tinclude Base.Stringable.S with type t := tinclude Base.Comparable.S__local with type t := tinclude Base.Comparisons.S__local with type t := tinclude Base.Comparisons.Infix with type t := tascending 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.tinclude Base.Comparator.S with type t := tval comparator : (t, comparator_witness) Base.Comparator.T.comparatorinclude Base.Pretty_printer.S with type t := tval pp : Base.Formatter.t -> t -> unitval hashable : t Base.Hashable.tval of_string : Base.string @ local -> t @@ portableval of_string_opt : Base.string @ local -> t Base.option @@ portablemodule Util : sig ... endinclude Base.Invariant.S with type t := tval invariant : t -> unitinclude Base.Comparisons.S_with_local_opt__local with type t := tval nan : t @@ portableval infinity : t @@ portableval neg_infinity : t @@ portableval max_value : t @@ portableEqual to infinity.
val min_value : t @@ portableEqual to neg_infinity.
val zero : t @@ portableval one : t @@ portableval minus_one : t @@ portableval pi : t @@ portableThe constant pi.
val sqrt_pi : t @@ portableThe constant sqrt(pi).
val sqrt_2pi : t @@ portableThe constant sqrt(2 * pi).
val euler_gamma_constant : t @@ portableEuler-Mascheroni constant (γ).
val epsilon_float : t @@ portableThe difference between 1.0s and the smallest exactly representable float32 greater than 1.0s. That is:
epsilon_float = (one_ulp `Up 1.0s) -. 1.0s
This gives the relative accuracy of type t, in the sense that for numbers on the order of x, the roundoff error is on the order of x *. float_epsilon.
See also: Machine epsilon.
val max_finite_value : t @@ portablemin_positive_subnormal_value = 2 ** -149min_positive_normal_value = 2 ** -126val min_positive_subnormal_value : t @@ portableval min_positive_normal_value : t @@ portableval to_int32_preserve_order : t @ local -> Base.int32 Base.option @@ portableAn order-preserving bijection between all float32s except for nans, and all int32s with absolute value smaller than or equal to 2**31 - 2**23. Note both 0.s and -0.s map to 0l.
val to_int32_preserve_order_exn : t @ local -> Base.int32 @@ portableval of_int32_preserve_order : Base.int32 @ local -> t @@ portableReturns nan if the absolute value of the argument is too large.
The next or previous representable float32. ULP stands for "unit of least precision", and is the spacing between floating point numbers. Both one_ulp `Up infinity and one_ulp `Down neg_infinity return a nan.
val of_float : Base.float @ local -> t @@ portableConverts a 64-bit float to the nearest representable float32.
val to_float : t @ local -> Base.float @@ portableConverts a float32 to a 64-bit float.
Convert an integer to a float32. Note that this doesn't round trip in either direction. For example, Float32.to_int (Float32.of_int max_int) <> max_int.
Truncate the given float32 to an integer. The result is unspecified if the argument is nan or falls outside the range of representable integers.
val of_int64 : Base.int64 @ local -> t @@ portableConverts the given int64 to the nearest representable float32. The amd64 flambda-backend compiler translates this call to CVTSI2SS.
val to_int64 : t @ local -> Base.int64 @@ portableTruncate the given float32 number to an int64. The result is unspecified if the argument is nan or falls outside the range of representable int64s. The amd64 flambda-backend compiler translates this call to CVTTSS2SI.
val of_bits : Base.int32 @ local -> t @@ portableConverts an int32 to a float32 with the same bit pattern. The amd64 flambda-backend compiler translates this call to MOVD.
val to_bits : t @ local -> Base.int32 @@ portableConverts a float32 to an int32 with the same bit pattern. The amd64 flambda-backend compiler translates this call to MOVD.
round rounds a float32 to an integer float32. iround{,_exn} rounds a float32 to an int. Both round according to a direction dir, with default dir being `Nearest.
| `Down | rounds toward Float32.neg_infinity |
| `Up | rounds toward Float32.infinity |
| `Nearest | rounds to the nearest int ("round half-integers up") |
| `Zero | rounds toward zero |iround_exn raises when trying to handle nan or trying to handle a float32 outside the range [float32 min_int, float32 max_int).
Here are some examples for round for each direction:
| `Down | [-2.s,-1.s) to -2.s | [-1.s,0.s) to -1.s | [0.s,1.s) to 0.s, [1.s,2.s) to 1.s | | `Up | (-2.s,-1.s] to -1.s | (-1.s,0.s] to -0.s | (0.s,1.s] to 1.s, (1.s,2.s] to 2.s | | `Zero | (-2.s,-1.s] to -1.s | (-1.s,1.s) to 0.s | [1.s,2.s) to 1.s | | `Nearest | [-1.5s,-0.5s) to -1.s | [-0.5s,0.5s) to 0.s | [0.5s,1.5s) to 1.s |
For convenience, versions of these functions with the dir argument hard-coded are provided. If you are writing performance-critical code you should use the versions with the hard-coded arguments (e.g. iround_down_exn). The _exn ones are the fastest.
The following properties hold:
of_int (iround_*_exn i) = i for any float32 i that is an integer with min_int <= i <= max_int.round_* i = i for any float32 i that is an integer.iround_*_exn (of_int i) = i for any int i with -2**23 <= i <= 2**23.val iround :
?dir:[ `Zero | `Nearest | `Up | `Down ] ->
t @ local ->
Base.int Base.option @@ portableRounds a float32 to the next integer float32 toward zero. The amd64 flambda-backend compiler translates this call to ROUNDSS.
Rounds a float32 down to the next integer float32 toward negative infinity. The amd64 flambda-backend compiler translates this call to ROUNDSS.
Rounds a float32 up to the next integer float32 toward positive infinity. The amd64 flambda-backend compiler translates this call to ROUNDSS.
Rounds a float32 to an integer float32 using the current rounding mode. The default rounding mode is "round half to even", and we expect that no program will change the rounding mode. The amd64 flambda-backend compiler translates this call to ROUNDSS.
val iround_towards_zero : t @ local -> Base.int Base.option @@ portableval iround_down : t @ local -> Base.int Base.option @@ portableval iround_up : t @ local -> Base.int Base.option @@ portableval iround_nearest : t @ local -> Base.int Base.option @@ portableval iround_nearest_half_to_even : t @ local -> Base.int64 @@ portableRounds a float32 to an int64 using the current rounding mode. The default rounding mode is "round half to even", and we expect that no program will change the rounding mode. If the argument is NaN, infinite, or otherwise cannot be represented, no exception is raised and the result is an unspecified int64. The amd64 flambda-backend compiler translates this call to CVTSS2SI.
val iround_lbound : t @@ portableIf f < iround_lbound || f > iround_ubound, then iround* functions will refuse to round f, returning None or raising as appropriate.
val iround_ubound : t @@ portableA float32 is nan when it is not a rational number or an infinity.
A float32 is infinite when it is either infinity or neg_infinity.
A float32 is finite when neither is_nan nor is_inf is true.
is_integer x is true if and only if x is an integer.
In analogy to Int.( % ), ( % ):
Like the other infix operators, NaNs in mean NaNs out.
Other cases: (a % Infinity) = a when 0 <= a < Infinity, (a % Infinity) = Infinity when -Infinity < a < 0, (+/- Infinity % a) = NaN, (a % 0) = NaN.
module Parts : sig ... endReturns the fractional part and the whole (i.e., integer) part. For example, modf (-3.14s) returns { fractional = -0.14s; integral = -3.s; }!
mod_float x y returns a result with the same sign as x. It returns nan if y is 0. It is basically
let mod_float x y = x -. (float32 (truncate (x /. y)) *. y)not
let mod_float x y = x -. (floor (x /. y) *. y)and therefore resembles mod on integers more than %.
These are for modules that inherit from t, since the infix operators are more convenient.
module O : sig ... endA sub-module designed to be opened to make working with float32s more convenient.
module O_dot : sig ... endSimilar to O, except that operators are suffixed with a dot, allowing one to have both int and float32 operators in scope simultaneously.
val to_string : t @ local -> Base.string @@ portableto_string x builds a string s representing the float32 x that guarantees the round trip, that is such that Float32.equal x (Float32.of_string s).
val to_string_hum :
?delimiter:Base.char ->
?decimals:Base.int ->
?strip_zero:Base.bool ->
?explicit_plus:Base.bool ->
t @ local ->
Base.string @@ portablePretty print float32, for example to_string_hum ~decimals:3 1234.1999s = "1_234.200" to_string_hum ~decimals:3 ~strip_zero:true 1234.1999s = "1_234.2" . No delimiters are inserted to the right of the decimal.
val to_padded_compact_string : t @ local -> Base.string @@ portableProduce a lossy compact string representation of the float32. The float32 is scaled by an appropriate power of 1000 and rendered with one digit after the decimal point, except that the decimal point is written as '.', 'k', 'm', 'g', 't', or 'p' to indicate the scale factor. (However, if the digit after the "decimal" point is 0, it is suppressed.)
The smallest scale factor that allows the number to be rendered with at most 3 digits to the left of the decimal is used. If the number is too large for this format (i.e., the absolute value is at least 999.95e15), scientific notation is used instead. E.g.:
to_padded_compact_string (-0.01s) = "-0 "to_padded_compact_string 1.89s = "1.9"to_padded_compact_string 999_949.99s = "999k9"to_padded_compact_string 999_950.s = "1m "In the case where the digit after the "decimal", or the "decimal" itself is omitted, the numbers are padded on the right with spaces to ensure the last two columns of the string always correspond to the decimal and the digit afterward (except in the case of scientific notation, where the exponent is the right-most element in the string and could take up to four characters).
to_padded_compact_string 1.s = "1 "to_padded_compact_string 1.e6s = "1m "to_padded_compact_string 1.e16s = "1.e+16"to_padded_compact_string max_finite_value = "1.8e+308"Numbers in the range -.05 < x < .05 are rendered as "0 " or "-0 ".
Other cases:
to_padded_compact_string nan = "nan "to_padded_compact_string infinity = "inf "to_padded_compact_string neg_infinity = "-inf "Exact ties are resolved to even in the decimal:
to_padded_compact_string 3.25s = "3.2"to_padded_compact_string 3.75s = "3.8"to_padded_compact_string 33_250.s = "33k2"to_padded_compact_string 33_350.s = "33k4"to_padded_compact_string is defined in terms of to_padded_compact_string_custom below as
let to_padded_compact_string t =
to_padded_compact_string_custom
t
?prefix:None
~kilo:"k"
~mega:"m"
~giga:"g"
~tera:"t"
~peta:"p"
()
;;val to_padded_compact_string_custom :
t @ local ->
(?prefix:Base.string ->
(kilo:Base.string ->
(mega:Base.string ->
(giga:Base.string ->
(tera:Base.string ->
(?peta:Base.string ->
(Base.unit ->
Base.string) @ local) @ local) @ local) @ local) @ local) @ local) @ local @@ portableSimilar to to_padded_compact_string but allows the user to provide different abbreviations. This can be useful to display currency values, e.g. $1mm3, where prefix="$", mega="mm".
int_pow x n computes x ** float32 n via repeated squaring. It is generally much faster than **.
Note that int_pow x 0 always returns 1., even if x = nan. This coincides with x ** 0. and is intentional.
For n >= 0 the result is identical to an n-fold product of x with itself under *., with a certain placement of parentheses. For n < 0 the result is identical to int_pow (1. /. x) (-n).
The error will be on the order of |n| ulps, essentially the same as if you perturbed x by up to a ulp and then exponentiated exactly.
Benchmarks show a factor of 5-10 speedup (relative to **) for exponents up to about 1000 (approximately 10ns vs. 70ns). For larger exponents the advantage is smaller but persists into the trillions. For a recent or more detailed comparison, run the benchmarks.
Depending on context, calling this function might or might not allocate 2 minor words. Even if called in a way that causes allocation, it still appears to be faster than **.
frexp f returns the pair of the significant and the exponent of f. When f is zero, the significant x and the exponent n of f are equal to zero. When f is non-zero, they are defined by f = x *. 2 ** n and 0.5s <= x < 1.0s.
expm1 x computes exp x -. 1.0s, giving numerically-accurate results even if x is close to 0.0s.
log1p x computes log(1.0s +. x) (natural logarithm), giving numerically-accurate results even if x is close to 0.0s.
copysign x y returns a float whose absolute value is that of x and whose sign is that of y. If x is nan, returns nan. If y is nan, returns either x or -. x, but it is not specified which.
Arc cosine. The argument must fall within the range [-1.0s, 1.0s]. Result is in radians and is between 0.0s and pi.
Arc sine. The argument must fall within the range [-1.0s, 1.0s]. Result is in radians and is between -pi/2 and pi/2.
Arc tangent. Result is in radians and is between -pi/2 and pi/2.
atan2 y x returns the arc tangent of y /. x. The signs of x and y are used to determine the quadrant of the result. Result is in radians and is between -pi and pi.
hypot x y returns sqrt(x *. x + y *. y), that is, the length of the hypotenuse of a right-angled triangle with sides of length x and y, or, equivalently, the distance of the point (x,y) to origin.
Hyperbolic arc cosine. The argument must fall within the range [1.0s, inf]. Result is in radians and is between 0.0s and inf.
Hyperbolic arc sine. The argument and result range over the entire real line. Result is in radians.
Hyperbolic arc tangent. The argument must fall within the range [-1.0s, 1.0s]. Result is in radians and ranges over the entire real line.
val classify : t @ local -> Base.Float.Class.t @@ portableval sign : t -> Base.Sign.t @@ portableval sign_exn : t @ local -> Base.Sign.t @@ portableThe sign of a float32. Both -0.s and 0.s map to Zero. Raises on nan. All other values map to Neg or Pos.
val sign_or_nan : t @ local -> Base.Sign_or_nan.t @@ portableThe sign of a float32, with support for NaN. Both -0. and 0. map to Zero. All NaN values map to Nan. All other values map to Neg or Pos.
val create_ieee :
negative:Base.bool ->
exponent:Base.int ->
mantissa:Base.int ->
t Base.Or_error.t @@ portableThese functions construct and destruct 32-bit floating point numbers based on their IEEE representation with a sign bit, an 8-bit non-negative (biased) exponent, and a 23-bit non-negative mantissa (or significand). See Wikipedia for details of the encoding.
In particular, if 1 <= exponent <= 254, then:
create_ieee_exn ~negative:false ~exponent ~mantissa
= (2 ** (exponent - 127)) * (1 + ((2 ** -23) * mantissa))module Terse : sig ... endS-expressions contain at most 8 significant digits.