Rabbit Tree
Radix bit tries for implementing associative arrays and sets in C.
RBT_KEY_DATA_T Struct Reference

Rabbit Tree key data type with associated node. More...

#include <node.h>

Collaboration diagram for RBT_KEY_DATA_T:

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_Tnode
 The associated node.
 

Detailed Description

Rabbit Tree key data type with associated node.

This is intended for use in tree traversal functions that require the full associated keys.

Field Documentation

◆ bytes

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.

◆ key

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.


The documentation for this struct was generated from the following file:
Contact
echo xyne.archlinux.org | sed 's/\./@/'