Source file "it/unimi/dsi/fastutil/doubles/DoubleBigArrays.java" was not found during generation of report.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Lines | Missed | Methods |
| Total | 2,505 of 2,505 | 0% | 254 of 254 | 0% | 176 | 176 | 413 | 413 | 49 | 49 |
| radixSort(double[][], double[][], long, long) | | 0% | | 0% | 14 | 14 | 60 | 60 | 1 | 1 |
| radixSort(double[][], long, long) | | 0% | | 0% | 12 | 12 | 52 | 52 | 1 | 1 |
| quickSort(double[][], long, long, DoubleComparator) | | 0% | | 0% | 13 | 13 | 32 | 32 | 1 | 1 |
| quickSort(double[][], long, long) | | 0% | | 0% | 13 | 13 | 32 | 32 | 1 | 1 |
| copy(double[][], long, double[][], long, long) | | 0% | | 0% | 8 | 8 | 33 | 33 | 1 | 1 |
| ensureCapacity(double[][], long, long) | | 0% | | 0% | 9 | 9 | 13 | 13 | 1 | 1 |
| selectionSort(double[][], double[][], long, long) | | 0% | | 0% | 7 | 7 | 12 | 12 | 1 | 1 |
| newBigArray(long) | | 0% | | 0% | 5 | 5 | 9 | 9 | 1 | 1 |
| fill(double[][], long, long, double) | | 0% | | 0% | 4 | 4 | 13 | 13 | 1 | 1 |
| copyToBig(double[], int, double[][], long, long) | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| toString(double[][]) | | 0% | | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| med3(double[][], long, long, long, DoubleComparator) | | 0% | | 0% | 6 | 6 | 4 | 4 | 1 | 1 |
| selectionSort(double[][], long, long, DoubleComparator) | | 0% | | 0% | 5 | 5 | 5 | 5 | 1 | 1 |
| selectionSort(double[][], long, long) | | 0% | | 0% | 5 | 5 | 5 | 5 | 1 | 1 |
| med3(double[][], long, long, long) | | 0% | | 0% | 6 | 6 | 4 | 4 | 1 | 1 |
| shuffle(double[][], long, long, Random) | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| copyFromBig(double[][], long, double[], int, int) | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| binarySearch(double[][], long, long, double, DoubleComparator) | | 0% | | 0% | 4 | 4 | 10 | 10 | 1 | 1 |
| wrap(double[]) | | 0% | | 0% | 4 | 4 | 5 | 5 | 1 | 1 |
| binarySearch(double[][], long, long, double) | | 0% | | 0% | 4 | 4 | 9 | 9 | 1 | 1 |
| trim(double[][], long) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| equals(double[][], double[][]) | | 0% | | 0% | 5 | 5 | 8 | 8 | 1 | 1 |
| shuffle(double[][], Random) | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| swap(double[][], long, long) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| vecSwap(double[][], long, long, long) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| setLength(double[][], long) | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| copy(double[][]) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| length(double[][]) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| grow(double[][], long, long) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| copy(double[][], long, long) | | 0% | n/a | 1 | 1 | 4 | 4 | 1 | 1 | |
| grow(double[][], long) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| fill(double[][], double) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| fixDouble(double) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| add(double[][], long, double) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| mul(double[][], long, double) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| incr(double[][], long) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| decr(double[][], long) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| set(double[][], long, double) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| static {...} | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| get(double[][], long) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| binarySearch(double[][], double, DoubleComparator) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| quickSort(double[][], DoubleComparator) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| binarySearch(double[][], double) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| radixSort(double[][], double[][]) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| ensureCapacity(double[][], long) | | 0% | n/a | 1 | 1 | 1 | 1 | 1 | 1 | |
| ensureFromTo(double[][], long, long) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| ensureOffsetLength(double[][], long, long) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| quickSort(double[][]) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 | |
| radixSort(double[][]) | | 0% | n/a | 1 | 1 | 2 | 2 | 1 | 1 |