module Integer: sig
.. end
Extension of Big_int
compatible with Zarith
.
Since Nitrogen-20111001
type
t = Z.t
exception Too_big
Produced by values whose physical representation is too
costly (e.g. in terms of memory usage).
val equal : t -> t -> bool
val compare : t -> t -> int
val le : t -> t -> bool
val ge : t -> t -> bool
val lt : t -> t -> bool
val gt : t -> t -> bool
val add : t -> t -> t
val sub : t -> t -> t
val mul : t -> t -> t
val native_div : t -> t -> t
val rem : t -> t -> t
Remainder of the Euclidean division (always positive)
val pos_div : t -> t -> t
Euclidean division. Equivalent to C division if both operands are positive.
Equivalent to a floored division if b > 0 (rounds downwards),
otherwise rounds upwards.
Note: it is possible that pos_div (-a) b <> pos_div a (-b).
val divexact : t -> t -> t
Faster, but produces correct results only when b evenly divides a.
val c_div : t -> t -> t
Truncated division towards 0 (like in C99)
val c_rem : t -> t -> t
Remainder of the truncated division towards 0 (like in C99)
val div_rem : t -> t -> t * t
div_rem a b
returns (pos_div a b, pos_rem a b)
val cast : size:t -> signed:bool -> value:t -> t
val abs : t -> t
val one : t
val two : t
val four : t
val onethousand : t
val minus_one : t
val is_zero : t -> bool
val is_one : t -> bool
val pgcd : t -> t -> t
pgcd v 0 == pgcd 0 v == abs v
. Result is always positive
val ppcm : t -> t -> t
ppcm v 0 == ppcm 0 v == 0
. Result is always positive
val min : t -> t -> t
val max : t -> t -> t
val length : t -> t -> t
b - a + 1
val of_int : int -> t
val of_int64 : Int64.t -> t
val of_int32 : Int32.t -> t
val to_int64 : t -> int64
val to_int : t -> int
Raises Failure
if the argument does not fit in an OCaml int
val to_float : t -> float
val of_float : float -> t
Converts from a floating-point value. The value is truncated.
Raises Overflow
on infinity and NaN arguments. (Or on big values
with Big_int.)
val neg : t -> t
val succ : t -> t
val pred : t -> t
val round_up_to_r : min:t -> r:t -> modu:t -> t
val round_down_to_r : max:t -> r:t -> modu:t -> t
val pos_rem : t -> t -> t
Remainder of the Euclidean division (always positive)
val shift_left : t -> t -> t
val shift_right : t -> t -> t
val logand : t -> t -> t
val logor : t -> t -> t
val logxor : t -> t -> t
val lognot : t -> t
val two_power : t -> t
val two_power_of_int : int -> t
: start:t -> stop:t -> t -> t
val small_nums : t array
val zero : t
val eight : t
val sixteen : t
val thirtytwo : t
val div : t -> t -> t
Euclidean division (that returns a positive rem)
val billion_one : t
val hash : t -> int
val shift_right_logical : t -> t -> t
val two_power_64 : t
val max_int64 : t
val min_int64 : t
val of_string : string -> t
Raises Failure
_ when the string cannot be parsed.
val to_string : t -> string
val add_2_64 : t -> t
val add_2_32 : t -> t
val is_even : t -> bool
val round_down_to_zero : t -> t -> t
val power_int_positive_int : int -> int -> t
val popcount : t -> int
val pretty : ?hexa:bool -> t Pretty_utils.formatter