DoxigAlpha
std › math › big › int › Managed › bitOr

bitOr

r = a | b

a and b are zero-extended to the longer of a or b.

Function parameters

Parameters

#
r:*Managed
a:*const Managed
b:*const Managed

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 bitOr(r: *Managed, a: *const Managed, b: *const Managed) !void {
    try r.ensureCapacity(@max(a.len(), b.len()));
    var m = r.toMutable();
    m.bitOr(a.toConst(), b.toConst());
    r.setMetadata(m.positive, m.len);
}