/guava/guava/src/com/google/common/math/LongMath.java
while ( a >= n - 1) {
while ( a != n - 1 ) {
} long a = powMod(base, d, n); if (a == 1) { return true; } int j = 0; <extra_id_0> if (++j == r) { return false; } a = squareMod(a, n); } return true;