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 | 4,879 of 4,879 | 0% | 210 of 210 | 0% | 158 | 158 | 53 | 53 |
static {...} | ![]() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 |
resultant(int) | ![]() | 0% | ![]() | 0% | 5 | 5 | 1 | 1 |
invertF3() | ![]() | 0% | ![]() | 0% | 10 | 10 | 1 | 1 |
multRecursive(IntegerPolynomial) | ![]() | 0% | ![]() | 0% | 7 | 7 | 1 | 1 |
resultantMultiThread() | ![]() | 0% | ![]() | 0% | 10 | 10 | 1 | 1 |
invertFq(int) | ![]() | 0% | ![]() | 0% | 9 | 9 | 1 | 1 |
resultant() | ![]() | 0% | ![]() | 0% | 11 | 11 | 1 | 1 |
mod2ToModq(IntegerPolynomial, int) | ![]() | 0% | ![]() | 0% | 5 | 5 | 1 | 1 |
shiftGap(int) | ![]() | 0% | ![]() | 0% | 4 | 4 | 1 | 1 |
toBinary3Tight() | ![]() | 0% | ![]() | 0% | 4 | 4 | 1 | 1 |
mult(IntegerPolynomial) | ![]() | 0% | ![]() | 0% | 4 | 4 | 1 | 1 |
centeredNormSq(int) | ![]() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 |
modCenter(int) | ![]() | 0% | ![]() | 0% | 4 | 4 | 1 | 1 |
sort(int[]) | ![]() | 0% | ![]() | 0% | 4 | 4 | 1 | 1 |
mod3() | ![]() | 0% | ![]() | 0% | 4 | 4 | 1 | 1 |
center0(int) | ![]() | 0% | ![]() | 0% | 4 | 4 | 1 | 1 |
div(int) | ![]() | 0% | ![]() | 0% | 3 | 3 | 1 | 1 |
add(IntegerPolynomial) | ![]() | 0% | ![]() | 0% | 3 | 3 | 1 | 1 |
sub(IntegerPolynomial) | ![]() | 0% | ![]() | 0% | 3 | 3 | 1 | 1 |
rotate1() | ![]() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 |
multShiftSub(IntegerPolynomial, int, int, int) | ![]() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 |
IntegerPolynomial(BigIntPolynomial) | ![]() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 |
squareSum() | ![]() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 |
equalsAbsOne() | ![]() | 0% | ![]() | 0% | 4 | 4 | 1 | 1 |
mult2(int) | ![]() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 |
mult3(int) | ![]() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 |
equalsOne() | ![]() | 0% | ![]() | 0% | 4 | 4 | 1 | 1 |
ensurePositive(int) | ![]() | 0% | ![]() | 0% | 3 | 3 | 1 | 1 |
sumCoeffs() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 | |
count(int) | 0% | ![]() | 0% | 3 | 3 | 1 | 1 | |
sub(int) | 0% | ![]() | 0% | 2 | 2 | 1 | 1 | |
mult(int) | 0% | ![]() | 0% | 2 | 2 | 1 | 1 | |
mod(int) | 0% | ![]() | 0% | 2 | 2 | 1 | 1 | |
equalsZero() | 0% | ![]() | 0% | 3 | 3 | 1 | 1 | |
degree() | 0% | ![]() | 0% | 3 | 3 | 1 | 1 | |
clear() | 0% | ![]() | 0% | 2 | 2 | 1 | 1 | |
equals(Object) | 0% | ![]() | 0% | 2 | 2 | 1 | 1 | |
mult(IntegerPolynomial, int) | 0% | n/a | 1 | 1 | 1 | 1 | ||
fromBinary(byte[], int, int) | 0% | n/a | 1 | 1 | 1 | 1 | ||
fromBinary(InputStream, int, int) | 0% | n/a | 1 | 1 | 1 | 1 | ||
clone() | 0% | n/a | 1 | 1 | 1 | 1 | ||
IntegerPolynomial(int) | 0% | n/a | 1 | 1 | 1 | 1 | ||
fromBinary3Sves(byte[], int) | 0% | n/a | 1 | 1 | 1 | 1 | ||
fromBinary3Tight(byte[], int) | 0% | n/a | 1 | 1 | 1 | 1 | ||
fromBinary3Tight(InputStream, int) | 0% | n/a | 1 | 1 | 1 | 1 | ||
mult(BigIntPolynomial) | 0% | n/a | 1 | 1 | 1 | 1 | ||
add(IntegerPolynomial, int) | 0% | n/a | 1 | 1 | 1 | 1 | ||
sub(IntegerPolynomial, int) | 0% | n/a | 1 | 1 | 1 | 1 | ||
modPositive(int) | 0% | n/a | 1 | 1 | 1 | 1 | ||
IntegerPolynomial(int[]) | 0% | n/a | 1 | 1 | 1 | 1 | ||
toBinary(int) | 0% | n/a | 1 | 1 | 1 | 1 | ||
toBinary3Sves() | 0% | n/a | 1 | 1 | 1 | 1 | ||
toIntegerPolynomial() | 0% | n/a | 1 | 1 | 1 | 1 |