/** * Combine onto v using the XOR operation, i.e. {@code v ^= this}. * * @param v Existing bit set of same length. */ public void xorOnto(long[] v) { BitsUtil.xorI(v, bits); }
return xorI(v, o);
/** * Compute corresponding gray code as v XOR (v >>> 1) * * @param v Value * @return Gray code */ public static long[] grayI(long[] v) { // TODO: copy less long[] t = copy(v); shiftRightI(t, 1); xorI(v, t); return v; }
BitsUtil.xorI(scratch.items, ij.items); if(BitsUtil.cardinality(scratch.items) != 2) { break prefix; // No prefix match; since sorted, no more can follow!
BitsUtil.xorI(bits, refl); BitsUtil.cycleRightI(bits, rotation, numdim); final int nextrot = (rotation + BitsUtil.numberOfTrailingZerosSigned(bits) + 2) % numdim;
BitsUtil.xorI(bits, refl); BitsUtil.cycleRightI(bits, rotation, numdim); final int nextrot = (rotation + BitsUtil.numberOfTrailingZerosSigned(bits) + 2) % numdim;
BitsUtil.xorI(bits, refl); BitsUtil.cycleRightI(bits, rotation, numdim); final int nextrot = (rotation + BitsUtil.numberOfTrailingZerosSigned(bits) + 2) % numdim;
BitsUtil.xorI(bits, refl); BitsUtil.cycleRightI(bits, rotation, numdim); final int nextrot = (rotation + BitsUtil.numberOfTrailingZerosSigned(bits) + 2) % numdim;