fn addWrap(r: *Mutable, a: Const, b: Const, signedness: Signedness, bit_count: usize) bool
[src]
r = a + b with 2s-complement wrapping semantics. Returns whether overflow occurred. r, a and b may be aliases
Asserts the result fits in r
. An upper bound on the number of limbs needed by r is calcTwosCompLimbCount(bit_count)
.