![]() |
RTEMS 6.1
|
This header file provides the Red-Black Trees API. More...
#include <rtems/score/rbtree.h>Go to the source code of this file.
Macros | |
| #define | RTEMS_RBTREE_INITIALIZER_EMPTY(name) RBTREE_INITIALIZER_EMPTY(name) |
| RBTree initializer for an empty rbtree with designator name. | |
| #define | RTEMS_RBTREE_DEFINE_EMPTY(name) RBTREE_DEFINE_EMPTY(name) |
| RBTree definition for an empty rbtree with designator name. | |
Typedefs | |
| typedef RBTree_Node | rtems_rbtree_node |
| typedef RBTree_Control | rtems_rbtree_control |
| typedef long | rtems_rbtree_compare_result |
| Integer type for compare results. | |
| typedef rtems_rbtree_compare_result(* | rtems_rbtree_compare) (const RBTree_Node *first, const RBTree_Node *second) |
| Compares two red-black tree nodes. | |
Functions | |
| void | rtems_rbtree_initialize (rtems_rbtree_control *the_rbtree, rtems_rbtree_compare compare, void *starting_address, size_t number_nodes, size_t node_size, bool is_unique) |
| Initialize a RBTree header. | |
| rtems_rbtree_node * | rtems_rbtree_find (const rtems_rbtree_control *the_rbtree, const rtems_rbtree_node *the_node, rtems_rbtree_compare compare, bool is_unique) |
| Tries to find a node for the specified key in the tree. | |
| rtems_rbtree_node * | rtems_rbtree_insert (RBTree_Control *the_rbtree, RBTree_Node *the_node, rtems_rbtree_compare compare, bool is_unique) |
| Inserts the node into the red-black tree. | |
This header file provides the Red-Black Trees API.