| KllHeapItemsSketch(Memory, Comparator, ArrayOfItemsSerDe) |  | 0% | | 0% | 4 | 4 | 33 | 33 | 1 | 1 |
| KllHeapItemsSketch(int, int, Comparator, ArrayOfItemsSerDe) | | 0% | | n/a | 1 | 1 | 14 | 14 | 1 | 1 |
| KllHeapItemsSketch(int, int, Object, long, Comparator, ArrayOfItemsSerDe) | | 0% | | n/a | 1 | 1 | 14 | 14 | 1 | 1 |
| getMinMaxByteArr() | | 0% | | n/a | 1 | 1 | 6 | 6 | 1 | 1 |
| getTotalItemsArray() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| getRetainedItemsArray() | | 0% | | n/a | 1 | 1 | 4 | 4 | 1 | 1 |
| getSingleItem() | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| getMinMaxSizeBytes() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| getItemAsString(int) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| getMaxItem() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| getMaxItemAsString() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| getMinItem() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| getMinItemAsString() | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| getRetainedItemsByteArr() | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| incN(int) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getSingleItemByteArr() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getSingleItemSizeBytes() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| setItemsArrayAt(int, Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getRetainedItemsSizeBytes() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| setLevelZeroSorted(boolean) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setMinK(int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setN(long) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setItemsArray(Object[]) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setMaxItem(Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| setMinItem(Object) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getK() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getN() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getM() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getMinK() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| isLevelZeroSorted() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| getWritableMemory() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |