CCC_Array_tree_map_node Struct Reference

#include <private_array_tree_map.h>

Detailed Description

Runs the standard WAVL tree algorithms with the addition of a free list. The parent field tracks the parent for an allocated node in the tree that the user has inserted into the array. When the user removes a node it is added to the front of a free list. The map will track the first free node. The list is push to front LIFO stack.

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

Field Documentation

branch

size_t CCC_Array_tree_map_node::branch[2]

Child nodes in array to unify Left and Right.

next_free

size_t CCC_Array_tree_map_node::next_free

Points to next free when not allocated.

parent

size_t CCC_Array_tree_map_node::parent

Parent of WAVL node when allocated.

---

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

• ccc/private/private_array_tree_map.h