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