RBTree_Control Struct Reference

This is used to manage a RBT. More...

#include <rbtree.h>

Collaboration diagram for RBTree_Control:

Data Fields
RBTree_Node *	permanent_null
	This points to a NULL. More...
RBTree_Node *	root
	This points to the root node of the RBT. More...
RBTree_Node *	first [2]
	This points to the min and max nodes of this RBT. More...

Detailed Description

This is used to manage a RBT.

A rbtree consists of a tree of zero or more nodes.

Note

This implementation does not require special checks for manipulating the root element of the RBT. To accomplish this the RBTree_Control structure can be overlaid with a RBTree_Node structure to act as a "dummy root", which has a NULL parent and its left child is the root.

Field Documentation

first

RBTree_Node* RBTree_Control::first[2]

This points to the min and max nodes of this RBT.

Referenced by _RBTree_Extract(), _RBTree_First(), _RBTree_Get(), and _RBTree_Initialize_empty().

permanent_null

RBTree_Node* RBTree_Control::permanent_null

This points to a NULL.

Useful for finding the root.

Referenced by _RBTree_Initialize_empty().

root

RBTree_Node* RBTree_Control::root

This points to the root node of the RBT.

Referenced by _RBTree_Initialize_empty(), _RBTree_Is_empty(), and _RBTree_Root().

---

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

• /mnt/data0/chrisj/rtems/releases/rtems-release.git/4.11.3/ws-rtems/rtems-4.11.3/cpukit/score/include/rtems/score/rbtree.h