IntegerPolynomial

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.

ElementMissed InstructionsCov.Missed BranchesCov.MissedCxtyMissedMethods
Total4,879 of 4,8790%210 of 2100%1581585353
static {...}2,5000%20%2211
resultant(int)2170%80%5511
invertF3()2140%180%101011
multRecursive(IntegerPolynomial)2070%120%7711
resultantMultiThread()1970%180%101011
invertFq(int)1910%160%9911
resultant()1900%200%111111
mod2ToModq(IntegerPolynomial, int)900%80%5511
shiftGap(int)840%60%4411
toBinary3Tight()740%60%4411
mult(IntegerPolynomial)530%60%4411
centeredNormSq(int)520%20%2211
modCenter(int)470%60%4411
sort(int[])470%60%4411
mod3()460%60%4411
center0(int)450%60%4411
div(int)400%40%3311
add(IntegerPolynomial)360%40%3311
sub(IntegerPolynomial)360%40%3311
rotate1()350%20%2211
multShiftSub(IntegerPolynomial, int, int, int)310%20%2211
IntegerPolynomial(BigIntPolynomial)270%20%2211
squareSum()270%20%2211
equalsAbsOne()270%60%4411
mult2(int)260%20%2211
mult3(int)260%20%2211
equalsOne()260%60%4411
ensurePositive(int)240%40%3311
sumCoeffs()0%20%2211
count(int)0%40%3311
sub(int)0%20%2211
mult(int)0%20%2211
mod(int)0%20%2211
equalsZero()0%40%3311
degree()0%40%3311
clear()0%20%2211
equals(Object)0%20%2211
mult(IntegerPolynomial, int)0%n/a1111
fromBinary(byte[], int, int)0%n/a1111
fromBinary(InputStream, int, int)0%n/a1111
clone()0%n/a1111
IntegerPolynomial(int)0%n/a1111
fromBinary3Sves(byte[], int)0%n/a1111
fromBinary3Tight(byte[], int)0%n/a1111
fromBinary3Tight(InputStream, int)0%n/a1111
mult(BigIntPolynomial)0%n/a1111
add(IntegerPolynomial, int)0%n/a1111
sub(IntegerPolynomial, int)0%n/a1111
modPositive(int)0%n/a1111
IntegerPolynomial(int[])0%n/a1111
toBinary(int)0%n/a1111
toBinary3Sves()0%n/a1111
toIntegerPolynomial()0%n/a1111