| Rabbit Tree
    Radix bit tries for implementing associative arrays and sets in C. | 
Rabbit Tree key data type with associated node. More...
#include <node.h>

| Data Fields | |
| RBT_KEY_SIZE_T | bits | 
| Number of significant bits in the key. | |
| RBT_KEY_SIZE_T | bytes | 
| Number of significant bits in the key.  More... | |
| RBT_PIN_T * | key | 
| The key.  More... | |
| RBT_NODE_T * | node | 
| The associated node. | |
Rabbit Tree key data type with associated node.
This is intended for use in tree traversal functions that require the full associated keys.
| RBT_KEY_SIZE_T RBT_KEY_DATA_T::bytes | 
Number of significant bits in the key.
This value will always be equal to bits/8. It is included because the value is often calculated simultaneously with the bits in various traversal functions. 
| RBT_PIN_T* RBT_KEY_DATA_T::key | 
The key.
The key is a pointer to an array of unsigned integers. The type of the integers is determined by the RBT_PIN_T macro.
 1.9.3
 1.9.3