CCC_Array_adaptive_map_node Struct Reference

#include <private_array_adaptive_map.h>

Detailed Description

Runs the top down splay tree algorithm with the addition of a free list for providing new nodes within the buffer. The parent field normally tracks parent when in the tree for iteration purposes. When a node is removed from the tree it is added to the free singly linked list. The free list is a LIFO push to front stack.

Data Fields
size_t	branch [2]
union {
size_t   parent
size_t   next_free
};

Field Documentation

branch

size_t CCC_Array_adaptive_map_node::branch[2]

Child nodes in array to unify Left and Right.

next_free

size_t CCC_Array_adaptive_map_node::next_free

Points to next free when not allocated.

parent

size_t CCC_Array_adaptive_map_node::parent

Parent of splay tree node when allocated.

---

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

• ccc/private/private_array_adaptive_map.h