|
Serene Runtime 1.0.0
C runtime for the Serene programming language
|
We have two type of node that both are implemented using the same data structure. More...
#include <seq.h>
Data Fields | |
| seq_elem_t * | children |
We allocate children to be a buffer of SEQ_BR number of pointers. | |
We have two type of node that both are implemented using the same data structure.
Inner nodes that point to other inner nodes or leaf nodes, and leaf nodes which points to actual elements of the sequence.
The main factor in determining the nature of the node is the depth of the trie. Depth zero, means a leaf node and an inner node otherwise.
| seq_elem_t* seq_node_t::children |