Source file "it/unimi/dsi/fastutil/floats/FloatArrays.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 3,384 of 3,384 | 0% | 364 of 364 | 0% | 236 | 236 | 591 | 591 | 54 | 54 |
| radixSort(float[][], int, int) | 0% | 0% | 17 | 17 | 56 | 56 | 1 | 1 | ||
| radixSortIndirect(int[], float[], float[], int, int, boolean) | 0% | 0% | 19 | 19 | 59 | 59 | 1 | 1 | ||
| radixSortIndirect(int[], float[], int, int, boolean) | 0% | 0% | 17 | 17 | 56 | 56 | 1 | 1 | ||
| radixSort(float[], float[], int, int) | 0% | 0% | 14 | 14 | 58 | 58 | 1 | 1 | ||
| radixSort(float[], int, int) | 0% | 0% | 12 | 12 | 50 | 50 | 1 | 1 | ||
| quickSort(float[], int, int, FloatComparator) | 0% | 0% | 13 | 13 | 32 | 32 | 1 | 1 | ||
| quickSort(float[], int, int) | 0% | 0% | 13 | 13 | 32 | 32 | 1 | 1 | ||
| selectionSort(float[][], int, int, int) | 0% | 0% | 8 | 8 | 17 | 17 | 1 | 1 | ||
| mergeSort(float[], int, int, FloatComparator, float[]) | 0% | 0% | 7 | 7 | 14 | 14 | 1 | 1 | ||
| mergeSort(float[], int, int, float[]) | 0% | 0% | 7 | 7 | 14 | 14 | 1 | 1 | ||
| selectionSort(float[], float[], int, int) | 0% | 0% | 7 | 7 | 12 | 12 | 1 | 1 | ||
| insertionSortIndirect(int[], float[], float[], int, int) | 0% | 0% | 6 | 6 | 11 | 11 | 1 | 1 | ||
| insertionSortIndirect(int[], float[], int, int) | 0% | 0% | 4 | 4 | 11 | 11 | 1 | 1 | ||
| med3(float[], int, int, int, FloatComparator) | 0% | 0% | 6 | 6 | 4 | 4 | 1 | 1 | ||
| selectionSort(float[], int, int, FloatComparator) | 0% | 0% | 5 | 5 | 8 | 8 | 1 | 1 | ||
| insertionSort(float[], int, int, FloatComparator) | 0% | 0% | 4 | 4 | 11 | 11 | 1 | 1 | ||
| selectionSort(float[], int, int) | 0% | 0% | 5 | 5 | 8 | 8 | 1 | 1 | ||
| insertionSort(float[], int, int) | 0% | 0% | 4 | 4 | 11 | 11 | 1 | 1 | ||
| med3(float[], int, int, int) | 0% | 0% | 6 | 6 | 4 | 4 | 1 | 1 | ||
| binarySearch(float[], int, int, float, FloatComparator) | 0% | 0% | 4 | 4 | 10 | 10 | 1 | 1 | ||
| binarySearch(float[], int, int, float) | 0% | 0% | 4 | 4 | 9 | 9 | 1 | 1 | ||
| shuffle(float[], int, int, Random) | 0% | 0% | 2 | 2 | 7 | 7 | 1 | 1 | ||
| reverse(float[]) | 0% | 0% | 2 | 2 | 7 | 7 | 1 | 1 | ||
| grow(float[], int) | 0% | 0% | 2 | 2 | 6 | 6 | 1 | 1 | ||
| grow(float[], int, int) | 0% | 0% | 2 | 2 | 6 | 6 | 1 | 1 | ||
| shuffle(float[], Random) | 0% | 0% | 2 | 2 | 7 | 7 | 1 | 1 | ||
| fill(float[], int, int, float) | 0% | 0% | 4 | 4 | 4 | 4 | 1 | 1 | ||
| equals(float[], float[]) | 0% | 0% | 4 | 4 | 4 | 4 | 1 | 1 | ||
| trim(float[], int) | 0% | 0% | 3 | 3 | 4 | 4 | 1 | 1 | ||
| copy(float[], int, int) | 0% | 0% | 2 | 2 | 4 | 4 | 1 | 1 | ||
| ensureCapacity(float[], int) | 0% | 0% | 2 | 2 | 5 | 5 | 1 | 1 | ||
| setLength(float[], int) | 0% | 0% | 3 | 3 | 3 | 3 | 1 | 1 | ||
| ensureCapacity(float[], int, int) | 0% | 0% | 2 | 2 | 5 | 5 | 1 | 1 | ||
| swap(float[], int, int) | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | ||
| vecSwap(float[], int, int, int) | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| fixFloat(float) | 0% | 0% | 2 | 2 | 2 | 2 | 1 | 1 | ||
| fill(float[], float) | 0% | 0% | 2 | 2 | 3 | 3 | 1 | 1 | ||
| mergeSort(float[], int, int, FloatComparator) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| radixSortIndirect(int[], float[], float[], boolean) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| static {...} | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| mergeSort(float[], int, int) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| binarySearch(float[], float, FloatComparator) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| radixSortIndirect(int[], float[], boolean) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| radixSort(float[][]) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| quickSort(float[], FloatComparator) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| mergeSort(float[], FloatComparator) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| binarySearch(float[], float) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | ||
| radixSort(float[], float[]) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| ensureFromTo(float[], int, int) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| ensureOffsetLength(float[], int, int) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| quickSort(float[]) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| mergeSort(float[]) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| radixSort(float[]) | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | ||
| copy(float[]) | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 |