| partition(int, int) |  | 0% | | 0% | 7 | 7 | 18 | 18 | 1 | 1 |
| compactLookupAsIntervals() | | 0% | | 0% | 7 | 7 | 20 | 20 | 1 | 1 |
| quickSort(int, int) | | 0% | | 0% | 8 | 8 | 22 | 22 | 1 | 1 |
| addSorted(int, int) | | 0% | | 0% | 9 | 9 | 16 | 16 | 1 | 1 |
| addOrReplaceUnique(int, int) | | 0% | | 0% | 7 | 7 | 19 | 19 | 1 | 1 |
| addUnique(int, int) | | 0% | | 0% | 8 | 8 | 20 | 20 | 1 | 1 |
| addUnsorted(int, int) | | 0% | | 0% | 8 | 8 | 14 | 14 | 1 | 1 |
| fastQuickSort() | | 0% | | 0% | 3 | 3 | 15 | 15 | 1 | 1 |
| add(int, int) | | 0% | | 0% | 6 | 6 | 16 | 16 | 1 | 1 |
| binaryFirstSearch() | | 0% | | 0% | 5 | 5 | 17 | 17 | 1 | 1 |
| compare(int) | | 0% | | 0% | 6 | 6 | 11 | 11 | 1 | 1 |
| removeKey(int) | | 0% | | 0% | 5 | 5 | 12 | 12 | 1 | 1 |
| binaryEmptySlotSearch() | | 0% | | 0% | 4 | 4 | 13 | 13 | 1 | 1 |
| lessThan(int, int) | | 0% | | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
| swap(int, int) | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| lookup(long, long) | | 0% | | 0% | 5 | 5 | 9 | 9 | 1 | 1 |
| binarySlotSearch(boolean) | | 0% | | 0% | 3 | 3 | 11 | 11 | 1 | 1 |
| addUnsorted(LongLookup) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| addUnsorted(long, long) | | 0% | | 0% | 5 | 5 | 5 | 5 | 1 | 1 |
| add(long, long) | | 0% | | 0% | 5 | 5 | 5 | 5 | 1 | 1 |
| insertionSort(int, int) | | 0% | | 0% | 5 | 5 | 7 | 7 | 1 | 1 |
| remove(int) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| addCount(int, int) | | 0% | | 0% | 2 | 2 | 7 | 7 | 1 | 1 |
| moveAndInsertRow(int, int) | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| removeRange(int, int) | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| doubleCapacity() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| DoubleIntIndex(int, boolean) | | 0% | | n/a | 1 | 1 | 9 | 9 | 1 | 1 |
| copyTo(DoubleIntIndex) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| ensureCapacityToAdd(int) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| lookup(int) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| lookupFirstGreaterEqual(int) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| setLongValue(int, long) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| setKey(int, int) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| setValue(int, int) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| lookup(int, int) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| getTotalValues() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| getLongKey(int) | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| lookup(long) | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| fastQuickSortRecursive() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| moveRows(int, int, int) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| getKey(int) | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| getValue(int) | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| removeAll() | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| sort() | | 0% | | 0% | 3 | 3 | 4 | 4 | 1 | 1 |
| pop() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| findFirstGreaterEqualKeyIndex(int) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| findFirstGreaterEqualSlotIndex(int) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| duplicate() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| findFirstEqualKeyIndex(int) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| setValuesSearchTarget() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| setKeysSearchTarget() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| peekKey() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| peekValue() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getLongValue(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| sortOnKeys() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| sortOnValues() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| DoubleIntIndex(int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| addCount(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| push(int, int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| setSize(int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| size() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| capacity() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getKeys() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getValues() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| clear() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |