Class files must be compiled with debug information to show line coverage.
Class files must be compiled with debug information to link with source files.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Methods |
| Total | 5,678 of 5,678 | 0% | 758 of 758 | 0% | 469 | 469 | 90 | 90 |
| quickSort1(byte[], int, int, ByteComparator) | | 0% | | 0% | 16 | 16 | 1 | 1 |
| quickSort1(char[], int, int, CharComparator) | | 0% | | 0% | 16 | 16 | 1 | 1 |
| quickSort1(double[], int, int, DoubleComparator) | | 0% | | 0% | 16 | 16 | 1 | 1 |
| quickSort1(float[], int, int, FloatComparator) | | 0% | | 0% | 16 | 16 | 1 | 1 |
| quickSort1(int[], int, int, IntComparator) | | 0% | | 0% | 16 | 16 | 1 | 1 |
| quickSort1(long[], int, int, LongComparator) | | 0% | | 0% | 16 | 16 | 1 | 1 |
| quickSort1(Object[], int, int, Comparator) | | 0% | | 0% | 16 | 16 | 1 | 1 |
| quickSort1(short[], int, int, ShortComparator) | | 0% | | 0% | 16 | 16 | 1 | 1 |
| quickSort1(Object[], int, int) | | 0% | | 0% | 16 | 16 | 1 | 1 |
| inplace_merge(int[], int, int, int) | | 0% | | 0% | 11 | 11 | 1 | 1 |
| mergeSort1(byte[], byte[], int, int, ByteComparator) | | 0% | | 0% | 10 | 10 | 1 | 1 |
| mergeSort1(char[], char[], int, int, CharComparator) | | 0% | | 0% | 10 | 10 | 1 | 1 |
| mergeSort1(double[], double[], int, int, DoubleComparator) | | 0% | | 0% | 10 | 10 | 1 | 1 |
| mergeSort1(float[], float[], int, int, FloatComparator) | | 0% | | 0% | 10 | 10 | 1 | 1 |
| mergeSort1(int[], int[], int, int, IntComparator) | | 0% | | 0% | 10 | 10 | 1 | 1 |
| mergeSort1(long[], long[], int, int, LongComparator) | | 0% | | 0% | 10 | 10 | 1 | 1 |
| mergeSort1(short[], short[], int, int, ShortComparator) | | 0% | | 0% | 10 | 10 | 1 | 1 |
| mergeSort1(double[], double[], int, int) | | 0% | | 0% | 10 | 10 | 1 | 1 |
| mergeSort1(float[], float[], int, int) | | 0% | | 0% | 10 | 10 | 1 | 1 |
| mergeSort1(long[], long[], int, int) | | 0% | | 0% | 10 | 10 | 1 | 1 |
| mergeSort1(byte[], byte[], int, int) | | 0% | | 0% | 10 | 10 | 1 | 1 |
| mergeSort1(char[], char[], int, int) | | 0% | | 0% | 10 | 10 | 1 | 1 |
| mergeSort1(int[], int[], int, int) | | 0% | | 0% | 10 | 10 | 1 | 1 |
| mergeSort1(short[], short[], int, int) | | 0% | | 0% | 10 | 10 | 1 | 1 |
| mergeSort2(double[], int, int) | | 0% | | 0% | 9 | 9 | 1 | 1 |
| mergeSort2(float[], int, int) | | 0% | | 0% | 9 | 9 | 1 | 1 |
| mergeSortInPlace(int[], int, int) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| med3(Object[], int, int, int) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| med3(byte[], int, int, int, ByteComparator) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| med3(char[], int, int, int, CharComparator) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| med3(double[], int, int, int, DoubleComparator) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| med3(float[], int, int, int, FloatComparator) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| med3(int[], int, int, int, IntComparator) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| med3(long[], int, int, int, LongComparator) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| med3(Object[], int, int, int, Comparator) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| med3(short[], int, int, int, ShortComparator) | | 0% | | 0% | 6 | 6 | 1 | 1 |
| binarySearchFromTo(Object[], Object, int, int, Comparator) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| binarySearchFromTo(double[], double, int, int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| binarySearchFromTo(float[], float, int, int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| binarySearchFromTo(long[], long, int, int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| rangeCheck(int, int, int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| binarySearchFromTo(byte[], byte, int, int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| binarySearchFromTo(char[], char, int, int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| binarySearchFromTo(int[], int, int, int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| binarySearchFromTo(short[], short, int, int) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| binarySearchFromTo(int, int, IntComparator) | | 0% | | 0% | 4 | 4 | 1 | 1 |
| lower_bound(int[], int, int, int) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| upper_bound(int[], int, int, int) | | 0% | | 0% | 3 | 3 | 1 | 1 |
| mergeSort(byte[], int, int, ByteComparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| mergeSort(char[], int, int, CharComparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| mergeSort(double[], int, int, DoubleComparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| mergeSort(float[], int, int, FloatComparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| mergeSort(int[], int, int, IntComparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| mergeSort(long[], int, int, LongComparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| mergeSort(short[], int, int, ShortComparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| mergeSort(byte[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| mergeSort(char[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| mergeSort(int[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| mergeSort(long[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| mergeSort(short[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| swap(byte[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| swap(char[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| swap(double[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| swap(float[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| swap(int[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| swap(long[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| swap(Object[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| swap(short[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| vecswap(byte[], int, int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| vecswap(char[], int, int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| vecswap(double[], int, int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| vecswap(float[], int, int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| vecswap(int[], int, int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| vecswap(long[], int, int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| vecswap(Object[], int, int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| vecswap(short[], int, int, int) | | 0% | | 0% | 2 | 2 | 1 | 1 |
| quickSort(byte[], int, int, ByteComparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| quickSort(char[], int, int, CharComparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| quickSort(double[], int, int, DoubleComparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| quickSort(float[], int, int, FloatComparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| quickSort(int[], int, int, IntComparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| quickSort(long[], int, int, LongComparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| quickSort(Object[], int, int, Comparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| quickSort(short[], int, int, ShortComparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| quickSort(Object[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| quickSort(Object[], Comparator) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| quickSort(Object[]) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| mergeSort(double[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| mergeSort(float[], int, int) | | 0% | n/a | 1 | 1 | 1 | 1 | |
| Sorting() | | 0% | n/a | 1 | 1 | 1 | 1 |