#include <tree_builder.h>
◆ KSI_LIST()
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.
◆ algo
Hashing algorithm for the internal nodes.
◆ ctx
◆ hsr
◆ ref
| size_t KSI_TreeBuilder_st::ref |
Reference counter for the object.
◆ rootNode
The root node of the computed tree. If set, the computation is finished.
◆ stack
Stack of the root nodes of complete binary trees.
The documentation for this struct was generated from the following file: