We have two type of node that both are implemented using the same data structure. More...

#include <array_list.h>

Data Fields
array_list_elem_t *	children
	We allocate children to be a buffer of AL_BR number of pointers.

Detailed Description

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.

Definition at line 157 of file array_list.h.

Field Documentation

array_list_elem_t* array_list_node_t::children

We allocate children to be a buffer of AL_BR number of pointers.

Definition at line 159 of file array_list.h.

The documentation for this struct was generated from the following file: