hash(Range) |  | 0% |  | 0% | 4 | 4 | 8 | 8 | 1 | 1 |
getMerkleTree(Token) |  | 0% |  | 0% | 3 | 3 | 5 | 5 | 1 | 1 |
rowCount() |  | 0% |  | 0% | 2 | 2 | 5 | 5 | 1 | 1 |
addMerkleTrees(int, Collection) |  | 0% |  | 0% | 2 | 2 | 4 | 4 | 1 | 1 |
addTree(MerkleTree) |   | 65% |   | 50% | 1 | 2 | 0 | 3 | 0 | 1 |
maxsize(Range, int) |  | 0% | | n/a | 1 | 1 | 2 | 2 | 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 |
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 |
validateNonOverlapping(MerkleTree) |   | 90% |   | 75% | 1 | 3 | 1 | 5 | 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 |
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 |
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 |
addMerkleTree(int, Range) |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
getMerkleTree(Range) |  | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
rangeIterator() |  | 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 |