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

Rabbit Tree node type. More...

#include <node.h>

Collaboration diagram for RBT_NODE_T:

Data Fields

RBT_KEY_SIZE_T bits
 Number of significant bits in the key. More...
 
RBT_PIN_T * key
 Key segment associated with this node. More...
 
struct RBT_NODE_Tleft
 Left child node. More...
 
struct RBT_NODE_Tright
 Right child node. More...
 
RBT_VALUE_T value
 Value associated with the node. More...
 

Detailed Description

Rabbit Tree node type.

Field Documentation

◆ bits

RBT_KEY_SIZE_T RBT_NODE_T::bits

Number of significant bits in the key.

If a node has no children then all of the bits in its key are significant, otherwise all bits until the first bit that differs between the child node keys.

◆ key

RBT_PIN_T* RBT_NODE_T::key

Key segment associated with this node.

The key is a pointer to an array of unsigned integers. The type of the integers is determined by the RBT_PIN_T macro.

◆ left

struct RBT_NODE_T* RBT_NODE_T::left

Left child node.

The first additional significant bit of this child is 0.

◆ right

struct RBT_NODE_T* RBT_NODE_T::right

Right child node.

The first additional significant bit of this child is 1.

◆ value

RBT_VALUE_T RBT_NODE_T::value

Value associated with the node.

The value is considered empty if RBT_VALUE_IS_NULL returns non-zero.


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