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 | 17,410 of 17,410 | 0% | 92 of 92 | 0% | 68 | 68 | 22 | 22 |
| static {...} | 0% | n/a | 1 | 1 | 1 | 1 | ||
| poly_uniform(long[], byte[], int) | 0% | 0% | 11 | 11 | 1 | 1 | ||
| sparse_mul8(long[], int, byte[], int, int[], short[]) | 0% | 0% | 5 | 5 | 1 | 1 | ||
| sparse_mul32(long[], int, int[], int, int[], short[]) | 0% | 0% | 5 | 5 | 1 | 1 | ||
| nttinv(long[], int, long[]) | 0% | 0% | 4 | 4 | 1 | 1 | ||
| nttinv(long[], long[]) | 0% | 0% | 4 | 4 | 1 | 1 | ||
| sparse_mul8(long[], byte[], int[], short[]) | 0% | 0% | 5 | 5 | 1 | 1 | ||
| ntt(long[], long[]) | 0% | 0% | 4 | 4 | 1 | 1 | ||
| sparse_mul16(int[], int[], int[], short[]) | 0% | 0% | 5 | 5 | 1 | 1 | ||
| sparse_mul32(int[], int[], int[], short[]) | 0% | 0% | 5 | 5 | 1 | 1 | ||
| poly_add_correct(long[], int, long[], int, long[], int) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| poly_sub_correct(int[], int[], int[]) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| poly_sub(long[], int, long[], int, long[], int) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| poly_pointwise(long[], int, long[], int, long[]) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| poly_pointwise(long[], long[], long[]) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| reduce(long) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| poly_add(long[], long[], long[]) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| poly_ntt(long[], long[]) | 0% | 0% | 2 | 2 | 1 | 1 | ||
| barr_reduce(long) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| poly_mul(long[], int, long[], int, long[]) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| poly_mul(long[], long[], long[]) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| QTesla3p.QTesla3PPolynomial() | 0% | n/a | 1 | 1 | 1 | 1 |