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