Function subWrap [src]

r = a - b with 2s-complement wrapping semantics. Returns whether any 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).

Prototype

pub fn subWrap(r: *Mutable, a: Const, b: Const, signedness: Signedness, bit_count: usize) bool

Parameters

r: *Mutablea: Constb: Constsignedness: Signednessbit_count: usize

Source

  pub fn subWrap(r: *Mutable, a: Const, b: Const, signedness: Signedness, bit_count: usize) bool {
    return r.addWrap(a, b.negate(), signedness, bit_count);
}  