DoxigAlpha
std › math › big › int › Mutable › copy

copy

Copies the value of a Const to an existing Mutable so that they both have the same value. Asserts the value fits in the limbs buffer.

Function parameters

Parameters

#
self:*Mutable

Used to indicate either limit of a 2s-complement integer.

Types

#
TwosCompIntLimit
Used to indicate either limit of a 2s-complement integer.
Mutable
A arbitrary-precision big integer, with a fixed set of mutable limbs.
Const
A arbitrary-precision big integer, with a fixed set of immutable limbs.
Managed
An arbitrary-precision big integer along with an allocator which manages the memory.

Returns the number of limbs needed to store `scalar`, which must be a

Functions

#
calcLimbLen
Returns the number of limbs needed to store `scalar`, which must be a
calcSetStringLimbCount
Assumes `string_len` doesn't account for minus signs if the number is negative.
calcNonZeroTwosCompLimbCount
Compute the number of limbs required to store a 2s-complement number of `bit_count` bits.
calcTwosCompLimbCount
Compute the number of limbs required to store a 2s-complement number of `bit_count` bits.
addMulLimbWithCarry
a + b * c + *carry, sets carry to the overflow bits
llcmp
Returns -1, 0, 1 if |a| < |b|, |a| == |b| or |a| > |b| respectively for limbs.

Source

Implementation

#
pub fn copy(self: *Mutable, other: Const) void {
    if (self.limbs.ptr != other.limbs.ptr) {
        @memcpy(self.limbs[0..other.limbs.len], other.limbs[0..other.limbs.len]);
    }
    // Normalize before setting `positive` so the `eqlZero` doesn't need to iterate
    // over the extra zero limbs.
    self.normalize(other.limbs.len);
    self.positive = other.positive or other.eqlZero();
}