pub fn bitNotWrap(r: *Mutable, a: Const, signedness: Signedness, bit_count: usize) void
r = ~a under 2s complement wrapping semantics. r may alias with a.
Assets that r has enough limbs to store the result. The upper bound Limb count is r is calcTwosCompLimbCount(bit_count).
calcTwosCompLimbCount(bit_count)
r: *Mutable
a: Const
signedness: Signedness
bit_count: usize
1430 1431 1432 1433 1434
pub fn bitNotWrap(r: *Mutable, a: Const, signedness: Signedness, bit_count: usize) void { r.copy(a.negate()); const negative_one: Const = .{ .limbs = &.{1}, .positive = false }; _ = r.addWrap(r.toConst(), negative_one, signedness, bit_count); }
r = ~a under 2s complement wrapping semantics. r may alias with a.
Assets that r has enough limbs to store the result. The upper bound Limb count is r is
calcTwosCompLimbCount(bit_count).