rok::core::num::bigint

Int

pub struct Int

An arbitrary-precision integer (spec 2.1.2). Write it int.

• pub const fn new() -> Int

  Zero.

• pub const fn from_i64(n: i64) -> Int

• pub const fn from_i32(n: i32) -> Int

• pub const fn from_u64(n: u64) -> Int

• pub fn from_literal(s: str) -> Int

  An integer literal's digits (_, 0x / 0o / 0b allowed): what an unsuffixed literal too big for i64 in an int slot lowers to.

• pub fn parse_radix(s: str, radix: u32) -> Int | none

  s in base radix (2..=36): an optional sign, then digits of either case; none otherwise. The grammar is the runtime's, the same the primitives' FromStr reads.

• pub fn to_str_radix(self, radix: u32) -> str

  The digits in base radix (2..=36, lowercase), - first when negative.

• pub const fn to_i32(self) -> i32 | none

• pub const fn to_i64(self) -> i64 | none

• pub const fn to_u64(self) -> u64 | none

• pub fn to_f64(self) -> f64

  The nearest f64 (ties to even; ±inf past f64::MAX).

• pub const fn is_zero(self) -> bool

• pub const fn is_negative(self) -> bool

• pub const fn is_positive(self) -> bool

• pub const fn signum(self) -> Int

  -1, 0 or 1.

• pub const fn abs(self) -> Int

• pub const fn bit_length(self) -> u64

  Bits of |self| without leading zeros (0 for zero; Python's bit_length).

• pub fn pow(self, exp: u32) -> Int

  self^exp (square and multiply).

• pub fn modpow(self, exp: Int, m: Int) -> Int

  self^exp %% m: in 0..m for m > 0, m + 1..=0 for m < 0 (the sign of m, as %%). Panics if m is zero or exp negative.

• pub fn gcd(self, other: Int) -> Int

  The greatest common divisor, never negative (gcd(0, 0) == 0). A runtime kernel (half-gcd reductions, then Lehmer's algorithm) after one division that brings the operands to about the same length.

• pub fn lcm(self, other: Int) -> Int

  The least common multiple, never negative (0 if either is).

• pub fn div_euclid(self, rhs: Int) -> Int

  The quotient rounded so that rem_euclid is never negative; panics on zero.

• pub fn rem_euclid(self, rhs: Int) -> Int

  The remainder in 0..rhs.abs(); panics on zero.

• pub fn isqrt(self) -> Int

  floor(sqrt(self)); panics on a negative number.

• pub fn checked_isqrt(self) -> Int | none

  floor(sqrt(self)), none for a negative number. Newton steps doubling the precision (the recursion of Python's math.isqrt): each refines the root of the top 2d bits from that of the top 2e bits, e = d / 2.

• pub fn div_rem(self, rhs: Int) -> (Int, Int)

  (self / rhs, self % rhs) in one division (truncating, like / and %); panics on zero.