#include <redblack.h>

Collaboration diagram for bu_rb_node:

Data Fields
uint32_t	rbn_magic

struct bu_rb_tree *	rbn_tree

struct bu_rb_node **	rbn_parent

struct bu_rb_node **	rbn_left

struct bu_rb_node **	rbn_right

char *	rbn_color

int *	rbn_size

struct bu_rb_package **	rbn_package

int	rbn_pkg_refs

size_t	rbn_list_pos

Detailed Description

For the most part, there is a one-to-one correspondence between nodes and chunks of application data. When a node is created, all of its package pointers (one per order of the tree) point to the same chunk of data. However, subsequent deletions usually muddy this tidy state of affairs.

Definition at line 206 of file redblack.h.

Field Documentation

◆ rbn_magic

uint32_t rbn_magic

Magic no. for integrity check

Definition at line 208 of file redblack.h.

◆ rbn_tree

struct bu_rb_tree* rbn_tree

Tree containing this node

Definition at line 209 of file redblack.h.

◆ rbn_parent

struct bu_rb_node** rbn_parent

Parents

Definition at line 210 of file redblack.h.

◆ rbn_left

struct bu_rb_node** rbn_left

Left subtrees

Definition at line 211 of file redblack.h.

◆ rbn_right

struct bu_rb_node** rbn_right

Right subtrees

Definition at line 212 of file redblack.h.

◆ rbn_color

char* rbn_color

Colors of this node

Definition at line 213 of file redblack.h.

◆ rbn_size

int* rbn_size

Sizes of subtrees rooted here

Definition at line 214 of file redblack.h.

◆ rbn_package

struct bu_rb_package** rbn_package

Contents of this node

Definition at line 215 of file redblack.h.

◆ rbn_pkg_refs

int rbn_pkg_refs

How many orders are being used?

Definition at line 216 of file redblack.h.

◆ rbn_list_pos

size_t rbn_list_pos

Place in the list of all nodes

Definition at line 217 of file redblack.h.

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

include/bu/redblack.h

Data Fields