| Modifier and Type | Field and Description |
|---|---|
| private int | |
| private int | |
| private PicnicEngine | |
| private boolean[] | |
| private boolean[] | |
| private static final Logger | |
| private static final int | |
| pack-priv byte[][] | |
| private int | |
| private int |
| Access | Constructor and Description |
|---|---|
| public |
| Modifier and Type | Method and Description |
|---|---|
| protected int | |
| protected void | |
| private void | |
| private boolean | |
| private boolean | |
| private void | |
| protected void | |
| protected byte[] | |
| protected byte[][] | |
| protected int | |
| private int | |
| private int[] | |
| private int[] | |
| private int | |
| private void | hashSeed(byte[] digest_arr, byte[] inputSeed, byte[] salt, byte hashPrefix, int repIndex, int nodeIndex)
|
| pack-priv boolean | |
| private boolean | |
| private boolean | |
| private boolean | |
| private boolean | |
| protected byte[] | |
| protected int | |
| protected int | reconstructSeeds(int[] hideList, int hideListSize, byte[] input, int inputLen, byte[] salt, int repIndex)
|
| protected int | |
| protected int | |
| protected int |
| dataSize | back to summary |
|---|---|
| private int dataSize | |
| depth | back to summary |
|---|---|
| private int depth | |
| engine | back to summary |
|---|---|
| private PicnicEngine engine | |
| exists | back to summary |
|---|---|
| private boolean[] exists | |
| haveNode | back to summary |
|---|---|
| private boolean[] haveNode | |
| LOG | back to summary |
|---|---|
| private static final Logger LOG | |
| MAX_SEED_SIZE_BYTES | back to summary |
|---|---|
| private static final int MAX_SEED_SIZE_BYTES | |
| nodes | back to summary |
|---|---|
| pack-priv byte[][] nodes | |
| numLeaves | back to summary |
|---|---|
| private int numLeaves | |
| numNodes | back to summary |
|---|---|
| private int numNodes | |
| Tree | back to summary |
|---|---|
| public Tree(PicnicEngine engine, int numLeaves, int dataSize) | |
| addMerkleNodes | back to summary |
|---|---|
| protected int addMerkleNodes(int[] missingLeaves, int missingLeavesSize, byte[] input, int inputSize) | |
| buildMerkleTree | back to summary |
|---|---|
| protected void buildMerkleTree(byte[][] leafData, byte[] salt) | |
| computeParentHash | back to summary |
|---|---|
| private void computeParentHash(int child, byte[] salt) | |
| contains | back to summary |
|---|---|
| private boolean contains(int[] list, int len, int value) | |
| exists | back to summary |
|---|---|
| private boolean exists(int i) | |
| expandSeeds | back to summary |
|---|---|
| private void expandSeeds(byte[] salt, int repIndex) | |
| generateSeeds | back to summary |
|---|---|
| protected void generateSeeds(byte[] rootSeed, byte[] salt, int repIndex) | |
| getLeaf | back to summary |
|---|---|
| protected byte[] getLeaf(int leafIndex) | |
| getLeaves | back to summary |
|---|---|
| protected byte[][] getLeaves() | |
| getLeavesOffset | back to summary |
|---|---|
| protected int getLeavesOffset() | |
| getParent | back to summary |
|---|---|
| private int getParent(int node) | |
| getRevealedMerkleNodes | back to summary |
|---|---|
| private int[] getRevealedMerkleNodes(int[] missingLeaves, int missingLeavesSize, int[] outputSize) | |
| getRevealedNodes | back to summary |
|---|---|
| private int[] getRevealedNodes(int[] hideList, int hideListSize, int[] outputSize) | |
| getSibling | back to summary |
|---|---|
| private int getSibling(int node) | |
| hashSeed | back to summary |
|---|---|
| private void hashSeed(byte[] digest_arr, byte[] inputSeed, byte[] salt, byte hashPrefix, int repIndex, int nodeIndex) | |
| hasLeftChild | back to summary |
|---|---|
| pack-priv boolean hasLeftChild(Tree tree, int node) | |
| hasRightChild | back to summary |
|---|---|
| private boolean hasRightChild(int node) | |
| hasSibling | back to summary |
|---|---|
| private boolean hasSibling(int node) | |
| isLeafNode | back to summary |
|---|---|
| private boolean isLeafNode(int node) | |
| isLeftChild | back to summary |
|---|---|
| private boolean isLeftChild(int node) | |
| openMerkleTree | back to summary |
|---|---|
| protected byte[] openMerkleTree(int[] missingLeaves, int missingLeavesSize, int[] outputSizeBytes) | |
| openMerkleTreeSize | back to summary |
|---|---|
| protected int openMerkleTreeSize(int[] missingLeaves, int missingLeavesSize) | |
| reconstructSeeds | back to summary |
|---|---|
| protected int reconstructSeeds(int[] hideList, int hideListSize, byte[] input, int inputLen, byte[] salt, int repIndex) | |
| revealSeeds | back to summary |
|---|---|
| protected int revealSeeds(int[] hideList, int hideListSize, byte[] output, int outputSize) | |
| revealSeedsSize | back to summary |
|---|---|
| protected int revealSeedsSize(int[] hideList, int hideListSize) | |
| verifyMerkleTree | back to summary |
|---|---|
| protected int verifyMerkleTree(byte[][] leafData, byte[] salt) | |