Source file "it/unimi/dsi/fastutil/objects/ObjectArrays.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 1,428 of 1,428 | 0% | 176 of 176 | 0% | 128 | 128 | 253 | 253 | 40 | 40 |
| quickSort(Object[], int, int, Comparator) | 0% | 0% | 13 | 13 | 32 | 32 | 1 | 1 | ||
| quickSort(Object[], int, int) | 0% | 0% | 13 | 13 | 32 | 32 | 1 | 1 | ||
| mergeSort(Object[], int, int, Comparator, Object[]) | 0% | 0% | 7 | 7 | 14 | 14 | 1 | 1 | ||
| mergeSort(Object[], int, int, Object[]) | 0% | 0% | 7 | 7 | 14 | 14 | 1 | 1 | ||
| med3(Object[], int, int, int) | 0% | 0% | 6 | 6 | 4 | 4 | 1 | 1 | ||
| selectionSort(Object[], int, int) | 0% | 0% | 5 | 5 | 8 | 8 | 1 | 1 | ||
| med3(Object[], int, int, int, Comparator) | 0% | 0% | 6 | 6 | 4 | 4 | 1 | 1 | ||
| selectionSort(Object[], int, int, Comparator) | 0% | 0% | 5 | 5 | 8 | 8 | 1 | 1 | ||
| insertionSort(Object[], int, int) | 0% | 0% | 4 | 4 | 11 | 11 | 1 | 1 | ||
| insertionSort(Object[], int, int, Comparator) | 0% | 0% | 4 | 4 | 11 | 11 | 1 | 1 | ||
| binarySearch(Object[], int, int, Object) | 0% | 0% | 4 | 4 | 10 | 10 | 1 | 1 | ||
| binarySearch(Object[], int, int, Object, Comparator) | 0% | 0% | 4 | 4 | 10 | 10 | 1 | 1 | ||
| shuffle(Object[], int, int, Random) | 0% | 0% | 2 | 2 | 7 | 7 | 1 | 1 | ||
| reverse(Object[]) | 0% | 0% | 2 | 2 | 7 | 7 | 1 | 1 | ||
| equals(Object[], Object[]) | 0% | 0% | 6 | 6 | 4 | 4 | 1 | 1 | ||
| grow(Object[], int) | 0% | 0% | 2 | 2 | 6 | 6 | 1 | 1 | ||
| grow(Object[], int, int) | 0% | 0% | 2 | 2 | 6 | 6 | 1 | 1 | ||
| shuffle(Object[], Random) | 0% | 0% | 2 | 2 | 7 | 7 | 1 | 1 | ||
| fill(Object[], int, int, Object) | 0% | 0% | 4 | 4 | 4 | 4 | 1 | 1 | ||
| newArray(Object[], int) | 0% | 0% | 3 | 3 | 3 | 3 | 1 | 1 | ||
| ensureCapacity(Object[], int) | 0% | 0% | 2 | 2 | 5 | 5 | 1 | 1 | ||
| ensureCapacity(Object[], int, int) | 0% | 0% | 2 | 2 | 5 | 5 | 1 | 1 | ||
| trim(Object[], int) | 0% | 0% | 2 | 2 | 4 | 4 | 1 | 1 | ||
| setLength(Object[], int) | 0% | 0% | 3 | 3 | 3 | 3 | 1 | 1 | ||
| copy(Object[], int, int) | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| swap(Object[], int, int) | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| vecSwap(Object[], int, int, int) | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| fill(Object[], Object) | 0% | 0% | 2 | 2 | 3 | 3 | 1 | 1 | ||
| mergeSort(Object[], int, int, Comparator) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| static {...} | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| mergeSort(Object[], int, int) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| binarySearch(Object[], Object, Comparator) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| quickSort(Object[], Comparator) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| mergeSort(Object[], Comparator) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| binarySearch(Object[], Object) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| ensureFromTo(Object[], int, int) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| ensureOffsetLength(Object[], int, int) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| quickSort(Object[]) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| mergeSort(Object[]) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| copy(Object[]) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |