Class files must be compiled with debug information to show line coverage.
Class files must be compiled with debug information to link with source files.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Methods |
| Total | 8,408 of 8,408 | 0% | 328 of 328 | 0% | 232 | 232 | 68 | 68 |
| static {...} | | 0% | n/a | 1 | 1 | 1 | 1 | |
| mult512(int[], int[]) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| mult256(int[], int[]) | | 0% | | 0% | 11 | 11 | 1 | 1 |
| toString(int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| mult128(int[], int[]) | | 0% | | 0% | 11 | 11 | 1 | 1 |
| reducePentanomial(int, int[]) | | 0% | | 0% | 5 | 5 | 1 | 1 |
| reduceTrinomial(int, int) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| GF2Polynomial(int, byte[]) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| GF2Polynomial(int, BigInteger) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| squareThisPreCalc() | | 0% | | 0% | 5 | 5 | 1 | 1 |
| karaMult(GF2Polynomial) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| mult64(int[], int[]) | | 0% | | 0% | 5 | 5 | 1 | 1 |
| shiftLeftThis() | | 0% | | 0% | 5 | 5 | 1 | 1 |
| toByteArray() | | 0% | | 0% | 3 | 3 | 1 | 1 |
| divide(GF2Polynomial) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| squareThisBitwise() | | 0% | | 0% | 6 | 6 | 1 | 1 |
| shiftRight() | | 0% | | 0% | 3 | 3 | 1 | 1 |
| shiftRightThis() | | 0% | | 0% | 3 | 3 | 1 | 1 |
| multiplyClassic(GF2Polynomial) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| GF2Polynomial(int, String) | | 0% | | 0% | 7 | 7 | 1 | 1 |
| shiftLeftAddThis(GF2Polynomial, int) | | 0% | | 0% | 5 | 5 | 1 | 1 |
| quotient(GF2Polynomial) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| vectorMult(GF2Polynomial) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| shiftLeft(int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| shiftBlocksLeft() | | 0% | | 0% | 3 | 3 | 1 | 1 |
| expandN(int) | | 0% | | 0% | 5 | 5 | 1 | 1 |
| isIrreducible() | | 0% | | 0% | 5 | 5 | 1 | 1 |
| xor(GF2Polynomial) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| doShiftBlocksLeft(int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| mult32(int, int) | | 0% | | 0% | 5 | 5 | 1 | 1 |
| remainder(GF2Polynomial) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| shiftLeft() | | 0% | | 0% | 2 | 2 | 1 | 1 |
| gcd(GF2Polynomial) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| GF2Polynomial(int, int[]) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| reduceN() | | 0% | | 0% | 4 | 4 | 1 | 1 |
| equals(Object) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| getBit(int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| testBit(int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| GF2Polynomial(int, Random) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| resetBit(int) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| upper(int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| GF2Polynomial(int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| setBit(int) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| xorBit(int) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| isOne() | | 0% | | 0% | 4 | 4 | 1 | 1 |
| xorThisBy(GF2Polynomial) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| isZero() | | 0% | | 0% | 4 | 4 | 1 | 1 |
| zeroUnusedBits() | | 0% | | 0% | 2 | 2 | 1 | 1 |
| toFlexiBigInt() | | 0% | | 0% | 3 | 3 | 1 | 1 |
| lower(int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| assignOne() | 0% | | 0% | 2 | 2 | 1 | 1 | |
| assignX() | 0% | | 0% | 2 | 2 | 1 | 1 | |
| randomize() | 0% | | 0% | 2 | 2 | 1 | 1 | |
| randomize(Random) | 0% | | 0% | 2 | 2 | 1 | 1 | |
| GF2Polynomial(GF2Polynomial) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| assignAll() | 0% | | 0% | 2 | 2 | 1 | 1 | |
| multiply(GF2Polynomial) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| toIntegerArray() | 0% | n/a | 1 | 1 | 1 | 1 | ||
| assignZero() | 0% | | 0% | 2 | 2 | 1 | 1 | |
| increase() | 0% | n/a | 1 | 1 | 1 | 1 | ||
| addToThis(GF2Polynomial) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| subtractFromThis(GF2Polynomial) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| hashCode() | 0% | n/a | 1 | 1 | 1 | 1 | ||
| clone() | 0% | n/a | 1 | 1 | 1 | 1 | ||
| add(GF2Polynomial) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| subtract(GF2Polynomial) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| increaseThis() | 0% | n/a | 1 | 1 | 1 | 1 | ||
| getLength() | 0% | n/a | 1 | 1 | 1 | 1 |