| hash(Range) |  | 0% | | 0% | 4 | 4 | 8 | 8 | 1 | 1 |
| tryMoveOffHeap() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| getMerkleTree(Token) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| difference(MerkleTrees, MerkleTrees) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| size() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| validateNonOverlapping(MerkleTree) | | 0% | | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
| rowCount() | | 0% | | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
| addTree(MerkleTree) | | 0% | | 0% | 2 | 2 | 3 | 3 | 1 | 1 |
| logRowCountPerLeaf(Logger) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| logRowSizePerLeaf(Logger) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| MerkleTrees(IPartitioner, Collection) | | 0% | | n/a | 1 | 1 | 5 | 5 | 1 | 1 |
| addMerkleTrees(int, Collection) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| init() | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| addMerkleTree(int, byte, Range) | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| addTrees(Collection) | | 0% | | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
| release() | | 0% | | n/a | 1 | 1 | 3 | 3 | 1 | 1 |
| MerkleTrees(IPartitioner) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| init(Range) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| maxsize(Range, int) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| addMerkleTree(int, Range) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| get(Token) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| split(Token) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| invalidate(Token) | | 0% | | n/a | 1 | 1 | 2 | 2 | 1 | 1 |
| getMerkleTree(Range) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| rangeIterator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| iterator() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| lambda$hash$0(ByteArrayOutputStream, MerkleTree.Node) | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| static {...} | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| ranges() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |
| partitioner() | | 0% | | n/a | 1 | 1 | 1 | 1 | 1 | 1 |