/guava/guava/src/com/google/common/math/LongMath.java
if ( hiLo < 0) {   hiLo = remainder( hiLo, m) ; }
[Delete]
return (a >= m - b) ? (a + b - m) : (a + b); } private long times2ToThe32Mod(long a, long m) { int remainingPowersOf2 = 32; do { int shift = min(remainingPowersOf2, Long.numberOfLeadingZeros(a)); <extra_id_0> remainingPowersOf2 -= shift; } while (remainingPowersOf2 > 0); return a; } @Override long mulMod(long a, long b, long m) {