|
C Container Collection (CCC)
|
#include <private_tree_map.h>

An entry is a way to store a node or the information needed to insert a node without a second query. The user can then take different actions depending on the Occupied or Vacant status of the entry.
Data Fields | |
| struct CCC_Tree_map * | map |
| CCC_Order | last_order |
| struct CCC_Entry | entry |
| struct CCC_Entry CCC_Tree_map_entry::entry |
The stored node or it's parent if it does not exist.
| CCC_Order CCC_Tree_map_entry::last_order |
The result of the last comparison to find the user specified node. Equal if found or indicates the direction the node should be inserted from the parent we currently store in the entry.
| struct CCC_Tree_map* CCC_Tree_map_entry::map |
The tree associated with this query.