pub fn shiftLeft(r: *Mutable, a: Const, shift: usize) void
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)).
a.limbs.len + (shift / (@sizeOf(Limb) * 8))
r: *Mutable
a: Const
shift: usize
1310 1311 1312 1313 1314
pub fn shiftLeft(r: *Mutable, a: Const, shift: usize) void { const new_len = llshl(r.limbs, a.limbs, shift); r.normalize(new_len); r.positive = a.positive; }
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)).