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 | 2,979 of 2,979 | 0% | 272 of 272 | 0% | 181 | 181 | 45 | 45 |
| passesSmallPrimeTest(BigInteger) | 0% | 0% | 3 | 3 | 1 | 1 | ||
| logBKM(double) | 0% | 0% | 3 | 3 | 1 | 1 | ||
| jacobi(BigInteger, BigInteger) | 0% | 0% | 18 | 18 | 1 | 1 | ||
| nextProbablePrime(BigInteger, int) | 0% | 0% | 20 | 20 | 1 | 1 | ||
| static {...} | 0% | n/a | 1 | 1 | 1 | 1 | ||
| isPrime(int) | 0% | 0% | 19 | 19 | 1 | 1 | ||
| squareRoot(BigInteger) | 0% | 0% | 7 | 7 | 1 | 1 | ||
| nextPrime(long) | 0% | 0% | 9 | 9 | 1 | 1 | ||
| extgcd(BigInteger, BigInteger) | 0% | 0% | 3 | 3 | 1 | 1 | ||
| intRoot(int, int) | 0% | 0% | 3 | 3 | 1 | 1 | ||
| modPow(int, int, int) | 0% | 0% | 6 | 6 | 1 | 1 | ||
| log(double) | 0% | 0% | 4 | 4 | 1 | 1 | ||
| order(int, int) | 0% | 0% | 4 | 4 | 1 | 1 | ||
| binomial(int, int) | 0% | 0% | 5 | 5 | 1 | 1 | ||
| extGCD(int, int) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| randomize(BigInteger, SecureRandom) | 0% | 0% | 5 | 5 | 1 | 1 | ||
| leastDiv(int) | 0% | 0% | 6 | 6 | 1 | 1 | ||
| ceilLog256(long) | 0% | 0% | 4 | 4 | 1 | 1 | ||
| leastCommonMultiple(BigInteger[]) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| divideAndRound(BigInteger, BigInteger) | 0% | 0% | 3 | 3 | 1 | 1 | ||
| nextSmallerPrime(int) | 0% | 0% | 6 | 6 | 1 | 1 | ||
| integerToOctets(BigInteger) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| isPower(int, int) | 0% | 0% | 4 | 4 | 1 | 1 | ||
| ceilLog256(int) | 0% | 0% | 4 | 4 | 1 | 1 | ||
| pow(int, int) | 0% | 0% | 3 | 3 | 1 | 1 | ||
| pow(long, int) | 0% | 0% | 3 | 3 | 1 | 1 | ||
| log(long) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| divideAndRound(BigInteger[], BigInteger) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| isIncreasing(int[]) | 0% | 0% | 3 | 3 | 1 | 1 | ||
| floorLog(int) | 0% | 0% | 3 | 3 | 1 | 1 | ||
| octetsToInteger(byte[], int, int) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| maxPower(int) | 0% | 0% | 3 | 3 | 1 | 1 | ||
| bitCount(int) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| ceilLog(BigInteger) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| floorLog(BigInteger) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| ceilLog(int) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| mod(long, long) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| floatPow(float, int) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| reduceInto(BigInteger, BigInteger, BigInteger) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| gcd(int, int) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| modInverse(int, int) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| randomize(BigInteger) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| modInverse(long, long) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| octetsToInteger(byte[]) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| nextProbablePrime(BigInteger) | 0% | n/a | 1 | 1 | 1 | 1 |