For IntelliJ IDEA,

Android Studio or Eclipse

if (!polynomial.isIrreducible())

if (!polynomial.isIrreducible())

done = fieldPolynomial.isIrreducible(); l++; if (done) done = fieldPolynomial.isIrreducible();

done = fieldPolynomial.isIrreducible(); l++; if (done) done = fieldPolynomial.isIrreducible();

/** * Tests random polynomials of degree (n+1) until an irreducible is found * and stores the result in <i>field polynomial</i>. This can take very * long for huge degrees. * * @return true */ private boolean testRandom() { int l; boolean done = false; fieldPolynomial = new GF2Polynomial(mDegree + 1); l = 0; while (!done) { l++; fieldPolynomial.randomize(); fieldPolynomial.setBit(mDegree); fieldPolynomial.setBit(0); if (fieldPolynomial.isIrreducible()) { done = true; return done; } } return done; }

/** * Tests random polynomials of degree (n+1) until an irreducible is found * and stores the result in <i>field polynomial</i>. This can take very * long for huge degrees. * * @return true */ private boolean testRandom() { int l; boolean done = false; fieldPolynomial = new GF2Polynomial(mDegree + 1); l = 0; while (!done) { l++; fieldPolynomial.randomize(); fieldPolynomial.setBit(mDegree); fieldPolynomial.setBit(0); if (fieldPolynomial.isIrreducible()) { done = true; return done; } } return done; }

| ((k & 1) != 0)) done = fieldPolynomial.isIrreducible(); l++; if (done)

| ((k & 1) != 0)) done = fieldPolynomial.isIrreducible(); l++; if (done)