net.corda.core.crypto / PartialMerkleTree / PartialTree
PartialTree
sealed class PartialTree
The structure is a little different than that of Merkle Tree.
Partial Tree might not be a full binary tree. Leaves represent either original Merkle tree leaves
or cut subtree node with stored hash. We differentiate between the leaves that are included in a filtered
transaction and leaves that just keep hashes needed for calculation. Reason for this approach: during verification
its easier to extract hashes used as a base for this tree.
Types
IncludedLeaf |
class IncludedLeaf : PartialTree |
Leaf |
class Leaf : PartialTree |
Node |
class Node : PartialTree |
Inheritors
IncludedLeaf |
class IncludedLeaf : PartialTree |
Leaf |
class Leaf : PartialTree |
Node |
class Node : PartialTree |