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