package bignum
Module Bignum
Arbitrary-precision rational numbers.
Sexp conversions represent values as decimals if possible, or defaults to (x + y/z) where x is decimal and y and z are integers. So for example, 1/3 <-> (0.333333333 + 1/3000000000). In string and sexp conversions, values with denominator of zero are special-cased: 0/0 <-> "nan", 1/0 <-> "inf", and -1/0 <-> "-inf".
include Core_kernel.Sexpable with type t := t
val t_of_sexp : Base.Sexp.t -> tval sexp_of_t : t -> Base.Sexp.tinclude Core_kernel.Comparable with type t := t
include Base.Comparable.S with type t := t
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.tinclude Base.Comparator.S with type t := t
val comparator : (t, comparator_witness) Base.Comparator.comparatorval 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.checkmodule Replace_polymorphic_compare :
Base.Comparable.Polymorphic_compare with type t := tmodule Map :
Core_kernel.Map.S
with type Key.t = t
with type Key.comparator_witness = comparator_witnessmodule Set :
Core_kernel.Set.S
with type Elt.t = t
with type Elt.comparator_witness = comparator_witnessinclude Core_kernel.Hashable with type t := t
include Core_kernel.Hashable.Common with type t := t
val compare : t -> t -> Base.Int.tval hash_fold_t :
Ppx_hash_lib.Std.Hash.state ->
t ->
Ppx_hash_lib.Std.Hash.stateval hash : t -> Ppx_hash_lib.Std.Hash.hash_valueval hashable : t Base.Hashable.tmodule Table : Core_kernel.Hashtbl.S with type key = tmodule Hash_set : Core_kernel.Hash_set.S with type elt = tmodule Hash_queue : Core_kernel.Hash_queue.S with type key = tinclude Core_kernel.Equal.S with type t := t
val equal : t Base.Equal.equalgen produces values with an order of magnitude (roughly the number of digits) in the numerator and denominator proportional to Quickcheck.Generator.size. Also includes values with zero in the denominator.
include Core_kernel.Quickcheckable with type t := t
val quickcheck_generator : t Base_quickcheck.Generator.tval quickcheck_observer : t Base_quickcheck.Observer.tval quickcheck_shrinker : t Base_quickcheck.Shrinker.tval zero : tval one : tval ten : tval hundred : tval thousand : tval million : tval billion : tval trillion : tval tenth : tval hundredth : tval thousandth : tval millionth : tval billionth : tval trillionth : tval (//) : int -> int -> tm // n is equivalent to of_int m / of_int n. Example: Bigint.O.(2 // 3).
Beware: 2 ** 8_000_000 will take at least a megabyte to store the result, and multiplying numbers a megabyte long is slow no matter how clever your algorithm. Be careful to ensure the second argument is reasonably-sized.
Default rounding direction is `Nearest. to_multiple_of defaults to one and must not be zero.
val iround :
?dir:[ `Down | `Up | `Nearest | `Zero ] ->
?to_multiple_of:int ->
t ->
int optionNone if the result would overflow or to_multiple_of is zero.
val iround_exn :
?dir:[ `Down | `Up | `Nearest | `Zero ] ->
?to_multiple_of:int ->
t ->
intException if the result would overflow or to_multiple_of is zero.
Convenience wrapper around round to round to the specified number of decimal digits. This raises if the number is infinite or undefined.
val to_float : t -> floatval to_string_decimal_accurate_exn : t -> stringAccurate if possible. If this number is not representable as a finite decimal fraction, it raises instead.
val to_string_decimal_accurate : t -> string Core_kernel.Or_error.tAs above, returns Or_error.t instead of raising
val is_representable_as_decimal : t -> booltrue if and only if to_string_decimal_accurate_exn doesn't raise.
val is_real : t -> booltrue if and only if the number is non-infinity and non-undefined.
val is_nan : t -> booltrue if and only if the number is undefined.
val to_string_hum :
?delimiter:char ->
?decimals:int ->
?strip_zero:bool ->
t ->
stringPretty print bignum in an approximate decimal form or print inf, -inf, nan. For example to_string_hum ~delimiter:',' ~decimals:3 ~strip_zero:false 1234.1999 = "1,234.200". No delimiters are inserted to the right of the decimal.
val to_string_accurate : t -> stringAlways accurate. If the number is representable as a finite decimal, it will return this decimal string. If the denomiator is zero, it would return "nan", "inf" or "-inf". Finally, if the bignum is a rational non representable as a decimal, to_string_accurate t returns an expression that evaluates to the right value. Example: to_string_accurate (Bignum.of_string "1/3") = "(0.333333333 + 1/3000000000)".
Since the introduction of that function in the API, of_string is able to read any value returned by this function, and would yield the original bignum. That is:
fun bignum -> bignum |> to_string_accurate |> of_stringis the identity in Bignum.
val of_float_decimal : float -> tTransforming a float into a Bignum.t needs to be done with care. Most rationals and decimals are not exactly representable as floats, thus their float representation includes some small imprecision at the end of their decimal form (typically after the 17th digits). It is very likely that when transforming a float into a Bignum.t, it is best to try to determine which was the original value and retrieve it instead of honoring the noise coming from its imprecise float representation.
Given that the original value is not available in the context of a function whose type is float -> Bignum.t, it is not possible to solve that problem in a principled way. However, a very reasonable approximation is to build the Bignum from a short string-representation of the float that guarantees the round-trip float |> to_string |> of_string. In particular, if the float was obtained from a short decimal string, this heuristic in practice succeeds at retrieving the original value.
In the context where it is assumed that a float is a perfect representative of the value meant to be modelled, the actual Bignum.t value for it may be built using of_float_dyadic.
For example:
3.14 is not a representable decimal, thus:
of_float_dyadic (Float.of_string "3.14") = (3.14 + 7/56294995342131200) of_float_decimal (Float.of_string "3.14") = 3.14of_float_dyadic used to be called of_float but we think it is not the right default choice, thus of_float was deprecated, and we introduced different names for this operation to force some explicit decision at call site.
After some time has passed, of_float_decimal will be renamed to of_float, thus re-introducing of_float in the API.
val of_float_dyadic : float -> tval of_float : float -> tval to_int : t -> int optionRounds toward zero. None if the conversion would overflow
val to_int_exn : t -> intval is_zero : t -> boolval sign : t -> intDo not use this function in new code. See sign_exn or sign_or_nan instead.
Returns -1, 0, or 1 according to the sign of the input. Due to an accidental oversight, sign nan = -1.
val sign_exn : t -> Core_kernel.Sign.tThe sign of a Bignum. Raises on nan.
val sign_or_nan : t -> Core_kernel.Sign_or_nan.tval of_string : string -> tval of_int : int -> tval pp_hum : Format.formatter -> t -> unitval pp_accurate : Format.formatter -> t -> unitval gen_finite : t Core_kernel.Quickcheck.Generator.tgen_finite is like gen but excludes values with zero in the denominator.
val gen_uniform_excl : t -> t -> t Core_kernel.Quickcheck.Generator.tgen_uniform_excl lower_bound upper_bound produces a uniform distribution between lower_bound and upper_bound, exclusive, in units based on the fractional parts of the bounds plus a number of decimal places proportional to Quickcheck.Generator.size.
val gen_incl : t -> t -> t Core_kernel.Quickcheck.Generator.tgen_incl lower_bound upper_bound produces a distribution of values between lower_bound and upper_bound, inclusive, that is approximately uniform with extra weight given to producing the endpoints lower_bound and upper_bound.
module Stable : sig ... endmodule Unstable : sig ... endmodule O : sig ... endval to_string : t -> stringval pp : Format.formatter -> t -> unitmodule For_testing : sig ... endval bin_size_t : t Core_kernel.Bin_prot.Size.sizerval bin_write_t : t Core_kernel.Bin_prot.Write.writerval bin_read_t : t Core_kernel.Bin_prot.Read.readerval __bin_read_t__ : (int -> t) Core_kernel.Bin_prot.Read.readerval bin_writer_t : t Core_kernel.Bin_prot.Type_class.writerval bin_reader_t : t Core_kernel.Bin_prot.Type_class.readerval bin_t : t Core_kernel.Bin_prot.Type_class.t