Rabbit Tree
Radix bit tries for implementing associative arrays and sets in C.
|
Linked list for implementing RBT_NODE_TRAVERSE_WITH_KEY's dynamic stack. More...
#include <node.h>
Data Fields | |
RBT_KEY_SIZE_T | bytes_in_key_prefix |
The number of bytes in the key prefix for this node. | |
RBT_KEY_SIZE_T | height |
The height of the node above the root node (or the depth, depending on how you look at it). | |
struct _RBT_NODE_TRAVERSE_WITH_KEY_STACK_T * | next |
The next item in the stack. | |
RBT_NODE_T * | node |
The node on the stack. | |
Linked list for implementing RBT_NODE_TRAVERSE_WITH_KEY's dynamic stack.