Stdlib/std.math/BigInt

BigInt

struct BigInt

Methods

pub fn to_signed_bytes_le(self): Bytes

Returns the two's complement byte representation of the BigInt in little-endian byte order.

pub fn to_signed_bytes_be(self): Bytes

Returns the two's complement byte representation of the BigInt in big-endian byte order.

pub fn to_bytes_le(self): Bytes

Returns the the byte representation of the BigInt in little-endian byte order.

pub fn to_bytes_be(self): Bytes

Returns the the byte representation of the BigInt in big-endian byte order.

pub fn _sign(self): int

pub fn is_zero(self): bool

Returns true if self is equal to the additive identity.

pub fn operator^:2(self, other: BigInt): BigInt

pub fn operator|:2(self, other: BigInt): BigInt

pub fn operator&:2(self, other: BigInt): BigInt

pub fn operator!=:2(self, other: BigInt): bool

pub fn operator==:2(self, other: BigInt): bool

pub fn operator%:2(self, other: BigInt): BigInt

pub fn operator/:2(self, other: BigInt): BigInt

pub fn operator*:2(self, other: BigInt): BigInt

pub fn operator-:2(self, other: BigInt): BigInt

pub fn operator+:2(self, other: BigInt): BigInt

pub fn div_ceil(self, other: BigInt): BigInt

Ceiled integer division.

pub fn mod_floor(self, other: BigInt): BigInt

Floored integer modulo.

pub fn div_floor(self, other: BigInt): BigInt

Floored integer division.

pub fn is_odd(self): bool

Returns true if the number is not divisible by 2.

pub fn is_even(self): bool

Returns true if the number is divisible by 2.

pub fn is_multiple_of(self, other: BigInt): bool

Returns true if the number is a multiple of other.

pub fn lcm(self, other: BigInt): BigInt

Calculates the Lowest Common Multiple (LCM) of the number and other.

pub fn gcd(self, other: BigInt): BigInt

Calculates the Greatest Common Divisor (GCD) of the number and other.

The result is always positive.

pub fn sqrt(self): BigInt

Returns the truncated principal square root.

pub fn modpow(self, exponent: BigInt, modulus: BigInt): BigInt

Returns (self ^ exponent) mod modulus.

Note that this rounds like mod_floor, not like the % operator, which makes a difference when given a negative self or modulus. The result will be in the interval [0, modulus) for modulus > 0, or in the interval (modulus, 0] for modulus < 0

Panics if the exponent is negative or the modulus is zero.

pub fn pow(self, rhs: int): BigInt

Returns self to the power rhs.

pub fn cbrt(self): BigInt

Returns the truncated principal cube root.

pub fn bits(self): int

Determines the fewest bits necessary to express the BigUint.

pub fn to_string(self): string

pub fn from_signed_bytes_le(bytes: Bytes): BigInt

Creates and initializes a BigInt from an array of bytes in two's complement.

The digits are in little-endian base 2<sup>8</sup>.

pub fn _zero(): BigInt

pub fn _from_bytes_le(sign: int, bytes: Bytes): BigInt

pub fn _from_bytes_be(sign: int, bytes: Bytes): BigInt

pub fn from_signed_bytes_be(bytes: Bytes): BigInt

Creates and initializes a BigInt from an array of bytes in two's complement binary representation.

The digits are in big-endian base 2<sup>8</sup>.

pub fn parse(s: string): BigInt throws ParseBigIntError