Source file "it/unimi/dsi/fastutil/booleans/BooleanBigArrays.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 1,671 of 1,671 | 0% | 212 of 212 | 0% | 141 | 141 | 254 | 254 | 35 | 35 |
| quickSort(boolean[][], long, long) | 0% | 0% | 19 | 19 | 32 | 32 | 1 | 1 | ||
| quickSort(boolean[][], long, long, BooleanComparator) | 0% | 0% | 13 | 13 | 32 | 32 | 1 | 1 | ||
| copy(boolean[][], long, boolean[][], long, long) | 0% | 0% | 8 | 8 | 33 | 33 | 1 | 1 | ||
| ensureCapacity(boolean[][], long, long) | 0% | 0% | 9 | 9 | 13 | 13 | 1 | 1 | ||
| med3(boolean[][], long, long, long) | 0% | 0% | 15 | 15 | 4 | 4 | 1 | 1 | ||
| newBigArray(long) | 0% | 0% | 5 | 5 | 9 | 9 | 1 | 1 | ||
| fill(boolean[][], long, long, boolean) | 0% | 0% | 4 | 4 | 13 | 13 | 1 | 1 | ||
| copyToBig(boolean[], int, boolean[][], long, long) | 0% | 0% | 3 | 3 | 11 | 11 | 1 | 1 | ||
| toString(boolean[][]) | 0% | 0% | 4 | 4 | 9 | 9 | 1 | 1 | ||
| med3(boolean[][], long, long, long, BooleanComparator) | 0% | 0% | 6 | 6 | 4 | 4 | 1 | 1 | ||
| selectionSort(boolean[][], long, long, BooleanComparator) | 0% | 0% | 5 | 5 | 5 | 5 | 1 | 1 | ||
| selectionSort(boolean[][], long, long) | 0% | 0% | 6 | 6 | 5 | 5 | 1 | 1 | ||
| shuffle(boolean[][], long, long, Random) | 0% | 0% | 2 | 2 | 7 | 7 | 1 | 1 | ||
| copyFromBig(boolean[][], long, boolean[], int, int) | 0% | 0% | 3 | 3 | 11 | 11 | 1 | 1 | ||
| wrap(boolean[]) | 0% | 0% | 4 | 4 | 5 | 5 | 1 | 1 | ||
| trim(boolean[][], long) | 0% | 0% | 3 | 3 | 7 | 7 | 1 | 1 | ||
| equals(boolean[][], boolean[][]) | 0% | 0% | 5 | 5 | 8 | 8 | 1 | 1 | ||
| shuffle(boolean[][], Random) | 0% | 0% | 2 | 2 | 7 | 7 | 1 | 1 | ||
| swap(boolean[][], long, long) | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| vecSwap(boolean[][], long, long, long) | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| setLength(boolean[][], long) | 0% | 0% | 3 | 3 | 4 | 4 | 1 | 1 | ||
| copy(boolean[][]) | 0% | 0% | 2 | 2 | 3 | 3 | 1 | 1 | ||
| length(boolean[][]) | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| grow(boolean[][], long, long) | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| copy(boolean[][], long, long) | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| grow(boolean[][], long) | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| fill(boolean[][], boolean) | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| set(boolean[][], long, boolean) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| static {...} | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| get(boolean[][], long) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| quickSort(boolean[][], BooleanComparator) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| ensureCapacity(boolean[][], long) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| ensureFromTo(boolean[][], long, long) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| ensureOffsetLength(boolean[][], long, long) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| quickSort(boolean[][]) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 |