Function shiftLeft [src]

r = a << shift, in other words, r = a * 2^shift r and a may alias. Asserts there is enough memory to fit the result. The upper bound Limb count is a.limbs.len + (shift / (@sizeOf(Limb) * 8)).

Prototype

pub fn shiftLeft(r: *Mutable, a: Const, shift: usize) void

Parameters

r: *Mutablea: Constshift: usize

Source

  pub fn shiftLeft(r: *Mutable, a: Const, shift: usize) void {
    llshl(r.limbs, a.limbs, shift);
    r.normalize(a.limbs.len + (shift / limb_bits) + 1);
    r.positive = a.positive;
}  