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