Class files must be compiled with debug information to show line coverage.
Class files must be compiled with debug information to link with source files.
| Element | Missed Instructions | Cov. | Missed Branches | Cov. | Missed | Cxty | Missed | Methods |
| Total | 927 of 927 | 0% | 122 of 122 | 0% | 79 | 79 | 18 | 18 |
| verifySubtreeConsistencyProof(long, long, long, byte[], byte[], List, MerkleTreeHash) | 0% | 0% | 18 | 18 | 1 | 1 | ||
| findCoveringSubtrees(long, long) | 0% | 0% | 4 | 4 | 1 | 1 | ||
| subtreeSubProof(long, long, MerkleTreeNodeSource, long, long, boolean, MerkleTreeHash, List) | 0% | 0% | 6 | 6 | 1 | 1 | ||
| evaluateSubtreeInclusionProof(long, long, long, byte[], List, MerkleTreeHash) | 0% | 0% | 10 | 10 | 1 | 1 | ||
| path(long, MerkleTreeNodeSource, long, long, MerkleTreeHash, List) | 0% | 0% | 3 | 3 | 1 | 1 | ||
| mth(MerkleTreeNodeSource, long, long, MerkleTreeHash) | 0% | 0% | 3 | 3 | 1 | 1 | ||
| isValidSubtree(long, long) | 0% | 0% | 7 | 7 | 1 | 1 | ||
| generateSubtreeInclusionProof(long, long, long, MerkleTreeNodeSource, MerkleTreeHash) | 0% | 0% | 4 | 4 | 1 | 1 | ||
| generateSubtreeInclusionProof(long, long, long, List, MerkleTreeHash) | 0% | 0% | 4 | 4 | 1 | 1 | ||
| checkRange(MerkleTreeNodeSource, long, long) | 0% | 0% | 4 | 4 | 1 | 1 | ||
| generateSubtreeConsistencyProof(long, long, long, MerkleTreeNodeSource, MerkleTreeHash) | 0% | 0% | 3 | 3 | 1 | 1 | ||
| isFullSubtree(long, long) | 0% | 0% | 5 | 5 | 1 | 1 | ||
| generateSubtreeConsistencyProof(long, long, long, List, MerkleTreeHash) | 0% | 0% | 3 | 3 | 1 | 1 | ||
| computeMerkleTreeHash(List, long, long, MerkleTreeHash) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| verifySubtreeInclusionProof(long, long, long, byte[], byte[], List, MerkleTreeHash) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| computeMerkleTreeHash(MerkleTreeNodeSource, long, long, MerkleTreeHash) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| largestPowerOfTwoBelow(long) | 0% | n/a | 1 | 1 | 1 | 1 | ||
| MerkleTreePrimitives() | 0% | n/a | 1 | 1 | 1 | 1 |