| tandemMerge(Object[], long[], Object[], long[], int[], int, int, int, int, Comparator) |  | 0% | | 0% | 6 | 6 | 23 | 23 | 1 | 1 |
| blockyTandemMergeSortRecursion(Object[], long[], Object[], long[], int[], int, int, Comparator) | | 0% | | 0% | 6 | 6 | 11 | 11 | 1 | 1 |
| reset() | | 0% | | 0% | 2 | 2 | 12 | 12 | 1 | 1 |
| getQuantiles(double[], QuantileSearchCriteria) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| getRanks(Object[], QuantileSearchCriteria) | | 0% | | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| merge(KllSketch) | | 0% | | 0% | 5 | 5 | 7 | 7 | 1 | 1 |
| update(Object, long) | | 0% | | 0% | 5 | 5 | 7 | 7 | 1 | 1 |
| toString(boolean, boolean) | | 0% | | 0% | 4 | 4 | 6 | 6 | 1 | 1 |
| updateMinMax(Object) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| blockyTandemMergeSort(Object[], long[], int[], int, Comparator) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| KllItemsSketch(KllSketch.SketchStructure, Comparator, ArrayOfItemsSerDe) | | 0% | | n/a | 1 | 1 | 7 | 7 | 1 | 1 |
| update(Object) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| getCDF(Object[], QuantileSearchCriteria) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| getPartitionBoundariesFromNumParts(int, QuantileSearchCriteria) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| getPartitionBoundariesFromPartSize(long, QuantileSearchCriteria) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| getPMF(Object[], QuantileSearchCriteria) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| getQuantile(double, QuantileSearchCriteria) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| getRank(Object, QuantileSearchCriteria) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| refreshSortedView() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| wrap(Memory, Comparator, ArrayOfItemsSerDe) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getQuantileLowerBound(double) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getQuantileUpperBound(double) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getSortedView() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| iterator() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| newHeapInstance(Comparator, ArrayOfItemsSerDe) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getRankLowerBound(double) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getRankUpperBound(double) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| newHeapInstance(int, Comparator, ArrayOfItemsSerDe) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| static {...} | | 0% | | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| heapify(Memory, Comparator, ArrayOfItemsSerDe) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getTotalItemsByteArr() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getTotalItemsNumBytes() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| setWritableMemory(WritableMemory) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getClassOfT() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| toByteArray() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getComparator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getSerDe() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getMemoryRequestServer() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| incNumLevels() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| setNumLevels(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |