public final class ListProofBranch extends java.lang.Object implements ListProofNode
ListProofNode
.
A branch node always has a left child, but there might not be a right child (if the underlying Merkle tree is not a full binary tree).
Constructor and Description |
---|
ListProofBranch(ListProofNode left,
ListProofNode right) |
Modifier and Type | Method and Description |
---|---|
void |
accept(ListProofVisitor visitor)
Applies the visitor to this proof node.
|
ListProofNode |
getLeft()
Returns the left child in the proof tree.
|
java.util.Optional<ListProofNode> |
getRight()
Returns the right child in the proof tree.
|
public ListProofBranch(ListProofNode left, @Nullable ListProofNode right)
public void accept(ListProofVisitor visitor)
ListProofNode
Most implementations simply call visitor.visit(this);
accept
in interface ListProofNode
visitor
- a visitor to apply to this nodepublic ListProofNode getLeft()
public java.util.Optional<ListProofNode> getRight()
There might not be a right child if the Merkle tree of the ProofList is not a full binary tree.
Copyright © 2018 Exonum. All rights reserved.