| mergeHi(int, int, int, int) |   | 84% | | 76% | 9 | 20 | 13 | 70 | 0 | 1 |
| mergeLo(int, int, int, int) | | 86% | | 76% | 9 | 20 | 11 | 66 | 0 | 1 |
| mergeAt(int) | | 80% | | 62% | 3 | 5 | 4 | 21 | 0 | 1 |
| rangeCheck(int, int, int) | | 34% | | 50% | 3 | 4 | 3 | 7 | 0 | 1 |
| gallopLeft(long, long[], int, int, int, LongTimSort.LongComparator) | | 92% | | 81% | 4 | 12 | 4 | 33 | 0 | 1 |
| gallopRight(long, long[], int, int, int, LongTimSort.LongComparator) | | 92% | | 81% | 4 | 12 | 4 | 33 | 0 | 1 |
| sort(long[], int, int, LongTimSort.LongComparator) | | 94% | | 83% | 2 | 7 | 2 | 25 | 0 | 1 |
| ensureCapacity(int) | | 95% | | 75% | 1 | 3 | 1 | 14 | 0 | 1 |
| countRunAndMakeAscending(long[], int, int, LongTimSort.LongComparator) | | 96% | | 83% | 2 | 7 | 1 | 10 | 0 | 1 |
| binarySort(long[], int, int, int, LongTimSort.LongComparator) | | 98% | | 90% | 1 | 7 | 1 | 20 | 0 | 1 |
| mergeCollapse() | | 98% | | 90% | 1 | 6 | 1 | 10 | 0 | 1 |
| mergeForceCollapse() | | 96% | | 83% | 1 | 4 | 1 | 7 | 0 | 1 |
| LongTimSort(long[], LongTimSort.LongComparator) | | 100% | | 100% | 0 | 5 | 0 | 15 | 0 | 1 |
| reverseRange(long[], int, int) | | 100% | | 100% | 0 | 2 | 0 | 7 | 0 | 1 |
| minRunLength(int) | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| pushRun(int, int) | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| sort(long[], LongTimSort.LongComparator) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |