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,625 of 2,625 | 0% | 164 of 164 | 0% | 127 | 127 | 45 | 45 |
| decode(short[], byte[], short[], int, int, int) | | 0% | | 0% | 11 | 11 | 1 | 1 |
| getOneThirdInverseInRQ(short[], byte[], int, int) | | 0% | | 0% | 8 | 8 | 1 | 1 |
| isInvertiblePolynomialInR3(byte[], byte[], int) | | 0% | | 0% | 9 | 9 | 1 | 1 |
| multiplicationInRQ(short[], short[], byte[], int, int) | | 0% | | 0% | 7 | 7 | 1 | 1 |
| multiplicationInR3(byte[], byte[], byte[], int) | | 0% | | 0% | 7 | 7 | 1 | 1 |
| encode(byte[], short[], short[], int, int) | | 0% | | 0% | 7 | 7 | 1 | 1 |
| getDecodedSmallPolynomial(byte[], byte[], int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| getUnsignedDivMod(int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| cryptoSort(int[], int) | | 0% | | 0% | 9 | 9 | 1 | 1 |
| getEncodedSmallPolynomial(byte[], byte[], int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| expand(int[], byte[]) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| checkForSmallPolynomial(byte[], byte[], int, int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| getSignedDivMod(int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| sortGenerateShortPolynomial(byte[], int[], int, int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| getRoundedDecodedPolynomial(short[], byte[], int, int) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| minmax(int[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| getRoundedEncodedPolynomial(byte[], short[], int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| getDecodedPolynomial(short[], byte[], int, int) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| getEncodedPolynomial(byte[], short[], int, int) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| getHashWithPrefix(byte[], byte[]) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| top(byte[], short[], byte[], int, int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| right(byte[], short[], byte[], int, int, int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| getRandomInputs(SecureRandom, byte[]) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| getTopDecodedPolynomial(byte[], byte[]) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| getRandomUnsignedInteger(SecureRandom) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| generatePolynomialInRQFromSeed(short[], byte[], int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| getTopEncodedPolynomial(byte[], byte[]) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| getEncodedInputs(byte[], byte[]) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| updateDiffMask(byte[], byte[], int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| generateAES256CTRStream(byte[], byte[], byte[], byte[]) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| getRandomSmallPolynomial(SecureRandom, byte[]) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| roundPolynomial(short[], short[]) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| getRandomShortPolynomial(SecureRandom, byte[], int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| scalarMultiplicationInRQ(short[], short[], int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| getInverseInRQ(int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| getModFreeze(int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| transformRQToR3(byte[], short[]) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| toIntExact(long) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| checkNotEqualToZero(int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| getUnsignedMod(int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| checkLessThanZero(int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| iToUnsignedLong(int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| bToUnsignedInt(byte) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| sToUnsignedInt(short) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| Utils() | | 0% | n/a | 1 | 1 | 1 | 1 |