Class Blake2b.Tree
java.lang.Object
net.sourceforge.plantuml.argon2.blake2.Blake2b.Tree
- Enclosing interface:
- Blake2b
Note that Tree is just a convenience class; incremental hash (tree) can be
done directly with the Digest class.
Further node, that tree does NOT accumulate the leaf hashes -- you need to do that
Further node, that tree does NOT accumulate the leaf hashes -- you need to do that
-
Constructor Summary
ConstructorsConstructorDescriptionTree
(int depth, int fanout, int leaf_length, int inner_length, int digest_length) -
Method Summary
Modifier and TypeMethodDescriptionfinal Blake2b.Digest
getNode
(int depth, int offset) returns the Digest for tree node @ (depth, offset)final Blake2b.Digest
getRoot()
returns the Digest for root node
-
Constructor Details
-
Tree
public Tree(int depth, int fanout, int leaf_length, int inner_length, int digest_length) - Parameters:
fanout
-depth
-leaf_length
- size of data input for leaf nodes.inner_length
- note this is used also as digest-length for non-root nodes.digest_length
- final hash out digest-length for the tree
-
-
Method Details
-
getNode
returns the Digest for tree node @ (depth, offset) -
getRoot
returns the Digest for root node
-