#include <tree_builder.h>
Callback functions for the leaf node. They are executed as a sequence where the last output tree node is the input node for the next call. The final output node is added to the tree.
Hashing algorithm for the internal nodes.
short KSI_TreeBuilder_st::maxTreeLevel |
Maximum level of the root hash. If adding a leaf would make the level of the root hash greater than this parameter, an error is returned. If the value is less or equal to 0 it is ignored.
size_t KSI_TreeBuilder_st::ref |
Reference counter for the object.
The root node of the computed tree. If set, the computation is finished.
Stack of the root nodes of complete binary trees.
The documentation for this struct was generated from the following file: