| tandemMerge(long[], long[], long[], long[], int[], int, int, int, int) |  | 0% |  | 0% | 6 | 6 | 23 | 23 | 1 | 1 |
| updateLong(long[], int, int) |  | 0% |  | 0% | 6 | 6 | 21 | 21 | 1 | 1 |
| blockyTandemMergeSortRecursion(long[], long[], long[], long[], int[], int, int) |  | 0% |  | 0% | 6 | 6 | 11 | 11 | 1 | 1 |
| update(long, long) |  | 0% |  | 0% | 6 | 6 | 9 | 9 | 1 | 1 |
| updateLong(KllLongsSketch, long) |  | 0% |  | 0% | 6 | 6 | 13 | 13 | 1 | 1 |
| reset() |  | 0% |  | 0% | 2 | 2 | 12 | 12 | 1 | 1 |
| wrap(Memory) |  | 0% |  | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| getQuantiles(double[], QuantileSearchCriteria) |  | 0% |  | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| getRanks(long[], QuantileSearchCriteria) |  | 0% |  | 0% | 3 | 3 | 7 | 7 | 1 | 1 |
| writableWrap(WritableMemory, MemoryRequestServer) |  | 0% |  | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| merge(KllSketch) |  | 0% |  | 0% | 5 | 5 | 7 | 7 | 1 | 1 |
| toString(boolean, boolean) |  | 0% |  | 0% | 5 | 5 | 6 | 6 | 1 | 1 |
| updateMinMax(long[], int, int) |  | 0% |  | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| updateMinMax(long) |  | 0% |  | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| blockyTandemMergeSort(long[], long[], int[], int) |  | 0% |  | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| update(long[], int, int) |  | 0% |  | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| getCDF(long[], QuantileSearchCriteria) |  | 0% |  | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| getPMF(long[], QuantileSearchCriteria) |  | 0% |  | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| getQuantile(double, QuantileSearchCriteria) |  | 0% |  | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| getRank(long, QuantileSearchCriteria) |  | 0% |  | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| refreshSortedView() |  | 0% |  | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| update(long) |  | 0% |  | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| newDirectInstance(int, WritableMemory, MemoryRequestServer) |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| getQuantileLowerBound(double) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getQuantileUpperBound(double) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| iterator() |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getSingleItemByteArr() |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| getRankLowerBound(double) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getRankUpperBound(double) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| KllLongsSketch(KllSketch.SketchStructure) |  | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| getTotalItemsNumBytes() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| static {...} |  | 0% |  | 0% | 2 | 2 | 1 | 1 | 1 | 1 |
| heapify(Memory) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| newHeapInstance(int) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getSortedView() |  | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| newDirectInstance(WritableMemory, MemoryRequestServer) |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getRetainedItemsSizeBytes() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| toByteArray() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| newHeapInstance() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getMinMaxSizeBytes() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getSerDe() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getSingleItemSizeBytes() |  | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |