Source file "it/unimi/dsi/fastutil/booleans/BooleanArrays.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 1,346 of 1,346 | 0% | 198 of 198 | 0% | 134 | 134 | 228 | 228 | 35 | 35 |
| quickSort(boolean[], int, int) | | 0% | | 0% | 19 | 19 | 32 | 32 | 1 | 1 |
| quickSort(boolean[], int, int, BooleanComparator) | | 0% | | 0% | 13 | 13 | 32 | 32 | 1 | 1 |
| mergeSort(boolean[], int, int, BooleanComparator, boolean[]) | | 0% | | 0% | 7 | 7 | 14 | 14 | 1 | 1 |
| mergeSort(boolean[], int, int, boolean[]) | | 0% | | 0% | 9 | 9 | 14 | 14 | 1 | 1 |
| med3(boolean[], int, int, int) | | 0% | | 0% | 15 | 15 | 4 | 4 | 1 | 1 |
| med3(boolean[], int, int, int, BooleanComparator) | | 0% | | 0% | 6 | 6 | 4 | 4 | 1 | 1 |
| selectionSort(boolean[], int, int, BooleanComparator) | | 0% | | 0% | 5 | 5 | 8 | 8 | 1 | 1 |
| insertionSort(boolean[], int, int, BooleanComparator) | | 0% | | 0% | 4 | 4 | 11 | 11 | 1 | 1 |
| selectionSort(boolean[], int, int) | | 0% | | 0% | 6 | 6 | 8 | 8 | 1 | 1 |
| insertionSort(boolean[], int, int) | | 0% | | 0% | 5 | 5 | 11 | 11 | 1 | 1 |
| shuffle(boolean[], int, int, Random) | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| reverse(boolean[]) | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| grow(boolean[], int) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| grow(boolean[], int, int) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| shuffle(boolean[], Random) | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| fill(boolean[], int, int, boolean) | | 0% | | 0% | 4 | 4 | 4 | 4 | 1 | 1 |
| equals(boolean[], boolean[]) | | 0% | | 0% | 4 | 4 | 4 | 4 | 1 | 1 |
| trim(boolean[], int) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| copy(boolean[], int, int) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| ensureCapacity(boolean[], int) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| setLength(boolean[], int) | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| ensureCapacity(boolean[], int, int) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| swap(boolean[], int, int) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| vecSwap(boolean[], int, int, int) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| fill(boolean[], boolean) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| mergeSort(boolean[], int, int, BooleanComparator) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| static {...} | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| mergeSort(boolean[], int, int) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| quickSort(boolean[], BooleanComparator) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| mergeSort(boolean[], BooleanComparator) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| ensureFromTo(boolean[], int, int) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| ensureOffsetLength(boolean[], int, int) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| quickSort(boolean[]) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| mergeSort(boolean[]) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| copy(boolean[]) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |