Function bitAnd [src]

r = a & b under 2s complement semantics. r may alias with a or b. Asserts that r has enough limbs to store the result. If only a is positive, the upper bound is a.limbs.len. If only b is positive, the upper bound is b.limbs.len. If a and b are positive, the upper bound is @min(a.limbs.len, b.limbs.len). If a and b are negative, the upper bound is @max(a.limbs.len, b.limbs.len) + 1.

Prototype

pub fn bitAnd(r: *Mutable, a: Const, b: Const) void

Parameters

r: *Mutablea: Constb: Const

Source

  pub fn bitAnd(r: *Mutable, a: Const, b: Const) void {
    // Trivial cases, llsignedand does not support zero.
    if (a.eqlZero()) {
        r.copy(a);
        return;
    } else if (b.eqlZero()) {
        r.copy(b);
        return;
    }

    if (a.limbs.len >= b.limbs.len) {
        r.positive = llsignedand(r.limbs, a.limbs, a.positive, b.limbs, b.positive);
        r.normalize(if (b.positive) b.limbs.len else if (a.positive) a.limbs.len else a.limbs.len + 1);
    } else {
        r.positive = llsignedand(r.limbs, b.limbs, b.positive, a.limbs, a.positive);
        r.normalize(if (a.positive) a.limbs.len else if (b.positive) b.limbs.len else b.limbs.len + 1);
    }
}  