IntegerFunctions

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
Total2,979 of 2,9790%272 of 2720%1811814545
passesSmallPrimeTest(BigInteger)9810%40%3311
logBKM(double)4420%40%3311
jacobi(BigInteger, BigInteger)1550%340%181811
nextProbablePrime(BigInteger, int)1280%380%202011
static {...}1010%n/a1111
isPrime(int)900%360%191911
squareRoot(BigInteger)880%120%7711
nextPrime(long)740%160%9911
extgcd(BigInteger, BigInteger)660%40%3311
intRoot(int, int)570%40%3311
modPow(int, int, int)500%100%6611
log(double)500%60%4411
order(int, int)450%60%4411
binomial(int, int)420%80%5511
extGCD(int, int)380%n/a1111
randomize(BigInteger, SecureRandom)350%80%5511
leastDiv(int)320%100%6611
ceilLog256(long)300%60%4411
leastCommonMultiple(BigInteger[])300%20%2211
divideAndRound(BigInteger, BigInteger)280%40%3311
nextSmallerPrime(int)270%100%6611
integerToOctets(BigInteger)260%20%2211
isPower(int, int)250%60%4411
ceilLog256(int)240%60%4411
pow(int, int)240%40%3311
pow(long, int)240%40%3311
log(long)230%n/a1111
divideAndRound(BigInteger[], BigInteger)220%20%2211
isIncreasing(int[])210%40%3311
floorLog(int)200%40%3311
octetsToInteger(byte[], int, int)200%n/a1111
maxPower(int)180%40%3311
bitCount(int)170%20%2211
ceilLog(BigInteger)160%20%2211
floorLog(BigInteger)160%20%2211
ceilLog(int)150%20%2211
mod(long, long)140%20%2211
floatPow(float, int)120%20%2211
reduceInto(BigInteger, BigInteger, BigInteger)100%n/a1111
gcd(int, int)90%n/a1111
modInverse(int, int)90%n/a1111
randomize(BigInteger)0%20%2211
modInverse(long, long)0%n/a1111
octetsToInteger(byte[])0%n/a1111
nextProbablePrime(BigInteger)0%n/a1111