Function subSat [src]

r = a - b with 2s-complement saturating semantics. r, a and b may be aliases. Assets the result fits in r. Upper bound on the number of limbs needed by r is calcTwosCompLimbCount(bit_count).

Prototype

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

Parameters

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

Source

  pub fn subSat(r: *Mutable, a: Const, b: Const, signedness: Signedness, bit_count: usize) void {
    r.addSat(a, b.negate(), signedness, bit_count);
}  