rbtree_node_t Struct Reference

Collaboration diagram for rbtree_node_t:

[legend]

Data Fields
rbtree_node_t *	left
rbtree_node_t *	right
rbtree_node_t *	parent
void *	key
void *	data
int	color
int	count

---

Detailed Description

Definition at line 44 of file rbtree.c.

---

Field Documentation

int rbtree_node_t::color

Definition at line 48 of file rbtree.c.

Referenced by rb_insert(), and rb_unlink_leaf().

int rbtree_node_t::count

Definition at line 49 of file rbtree.c.

Referenced by rb_allocate(), rb_delete(), rb_index(), rb_insert(), rb_rotate_left(), and rb_rotate_right().

void* rbtree_node_t::data

Definition at line 47 of file rbtree.c.

Referenced by rb_allocate(), rb_delete(), rb_find(), rb_index(), rb_insert(), rb_release(), rb_search(), and rb_walk().

void* rbtree_node_t::key

Definition at line 46 of file rbtree.c.

Referenced by rb_allocate(), rb_delete(), rb_exists(), rb_find(), rb_insert(), rb_release(), rb_search(), and rb_walk().

struct rbtree_node_t* rbtree_node_t::left

Definition at line 45 of file rbtree.c.

Referenced by rb_delete(), rb_destroy(), rb_exists(), rb_find(), rb_find_minimum(), rb_find_predecessor_node(), rb_find_successor_node(), rb_index(), rb_insert(), rb_release(), rb_rotate_left(), rb_rotate_right(), rb_search(), rb_unlink_leaf(), and rb_walk().

struct rbtree_node_t * rbtree_node_t::parent

Definition at line 45 of file rbtree.c.

Referenced by rb_allocate(), rb_destroy(), rb_find_predecessor_node(), rb_find_successor_node(), rb_insert(), rb_release(), rb_rotate_left(), rb_rotate_right(), rb_unlink_leaf(), and rb_walk().

struct rbtree_node_t * rbtree_node_t::right

Definition at line 45 of file rbtree.c.

Referenced by rb_delete(), rb_destroy(), rb_exists(), rb_find(), rb_find_maximum(), rb_find_predecessor_node(), rb_find_successor_node(), rb_index(), rb_insert(), rb_release(), rb_rotate_left(), rb_rotate_right(), rb_search(), rb_unlink_leaf(), and rb_walk().

---

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

• src/rbtree.c

---