| addEmptyTopLevelToCompletelyFullSketch(KllSketch) |  | 0% | | 0% | 24 | 24 | 98 | 98 | 1 | 1 |
| toStringImpl(KllSketch, boolean, boolean, ArrayOfItemsSerDe) | | 0% | | 0% | 11 | 11 | 45 | 45 | 1 | 1 |
| outputDataDetail(KllSketch) | | 0% | | 0% | 8 | 8 | 31 | 31 | 1 | 1 |
| getGrowthSchemeForGivenN(int, int, long, KllSketch.SketchType, boolean) | | 0% | | 0% | 5 | 5 | 26 | 26 | 1 | 1 |
| toByteArray(KllSketch, boolean) | | 0% | | 0% | 11 | 11 | 48 | 48 | 1 | 1 |
| getFinalSketchStatsAtNumLevels(int, int, int, boolean) | | 0% | | 0% | 4 | 4 | 17 | 17 | 1 | 1 |
| static {...} | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| outputLevels(int, int, int, int[]) | | 0% | | 0% | 2 | 2 | 12 | 12 | 1 | 1 |
| memorySpaceMgmt(KllSketch, int, int) | | 0% | | 0% | 6 | 6 | 13 | 13 | 1 | 1 |
| levelCapacity(int, int, int, int) | | 0% | | 0% | 9 | 9 | 5 | 5 | 1 | 1 |
| getKFromEpsilon(double, boolean) | | 0% | | 0% | 3 | 3 | 8 | 8 | 1 | 1 |
| createLevelsArray(long) | | 0% | | 0% | 3 | 3 | 9 | 9 | 1 | 1 |
| findLevelToCompact(int, int, int, int[]) | | 0% | | 0% | 4 | 4 | 8 | 8 | 1 | 1 |
| sumTheSampleWeights(int, int[]) | | 0% | | 0% | 2 | 2 | 6 | 6 | 1 | 1 |
| intCapAuxAux(long, int) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| checkK(int, int) | | 0% | | 0% | 3 | 3 | 3 | 3 | 1 | 1 |
| intCapAux(int, int) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| checkM(int) | | 0% | | 0% | 4 | 4 | 3 | 3 | 1 | 1 |
| convertToCumulative(long[]) | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| computeTotalItemCapacity(int, int, int) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| getNormalizedRankError(int, boolean) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| currentLevelSizeItems(int, int, int[]) | | 0% | | 0% | 2 | 2 | 2 | 2 | 1 | 1 |
| getNumRetainedAboveLevelZero(int, int[]) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| ubOnNumLevels(long) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| KllHelper() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| printf(String, Object[]) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| println(Object) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |