| Package | Description |
|---|---|
| com.github.jtendermint.merkletree.iavl |
| Modifier and Type | Method and Description |
|---|---|
Node<K> |
Node.createCopy() |
Node<K> |
RmResult.getNode() |
Node<K> |
AddResult.getNode() |
Node<K> |
AVLTree.getRoot() |
Node<K> |
Node.init(K value) |
Node<K> |
Node.init(K value,
int height,
int size,
byte[] leftHash,
Node<K> leftNode,
byte[] rightHash,
Node<K> rightNode) |
Node<K> |
Node.init(K key,
Node<K> leftNode,
Node<K> rightNode) |
protected Node<K> |
Node.newNode() |
Node<K> |
Node.setHashFunction(Hashing<K> hash) |
| Modifier and Type | Method and Description |
|---|---|
IterateFunct.Loop |
IterateFunct.currentNode(Node<K> node)
Function to Iterate nodes
|
Node<K> |
Node.init(K value,
int height,
int size,
byte[] leftHash,
Node<K> leftNode,
byte[] rightHash,
Node<K> rightNode) |
Node<K> |
Node.init(K value,
int height,
int size,
byte[] leftHash,
Node<K> leftNode,
byte[] rightHash,
Node<K> rightNode) |
Node<K> |
Node.init(K key,
Node<K> leftNode,
Node<K> rightNode) |
Node<K> |
Node.init(K key,
Node<K> leftNode,
Node<K> rightNode) |
| Constructor and Description |
|---|
AddResult(Node<K> node,
boolean updated) |
RmResult(byte[] hash,
Node<K> node,
K value,
boolean removed) |
Copyright © 2018. All rights reserved.