#include <bu.h>
Collaboration diagram for bu_rb_tree:
Data Fields | |
| long | rbt_magic |
| Magic no. for integrity check. | |
| int | rbt_nm_nodes |
| Number of nodes. | |
| void(* | rbt_print )() |
| Data pretty-print function. | |
| int | rbt_debug |
| Debug bits. | |
| char * | rbt_description |
| Comment for diagnostics. | |
| int | rbt_nm_orders |
| Number of simultaneous orders. | |
| int(** | rbt_order )() |
| Comparison functions. | |
| bu_rb_node ** | rbt_root |
| The actual trees. | |
| char * | rbt_unique |
| Uniqueness flags. | |
| bu_rb_node * | rbt_current |
| Current node. | |
| bu_rb_list | rbt_nodes |
| All nodes. | |
| bu_rb_list | rbt_packages |
| All packages. | |
| bu_rb_node * | rbt_empty_node |
| Sentinel representing nil. | |
This is the only data structure used in the red-black tree package to which application software need make any explicit reference.
The members of this structure are grouped into three classes: Class I: Reading is appropriate, when necessary, but applications should not modify. Class II: Reading and modifying are both appropriate, when necessary. Class III: All access should be through routines provided in the package. Touch these at your own risk!
Definition at line 1519 of file bu.h.
|
|
Magic no. for integrity check.
|
|
|
Number of nodes.
|
|
|
Data pretty-print function.
|
|
|
Debug bits.
|
|
|
Comment for diagnostics.
|
|
|
Number of simultaneous orders.
|
|
|
Comparison functions.
|
|
|
The actual trees.
|
|
|
Uniqueness flags.
|
|
|
Current node.
|
|
|
All nodes.
|
|
|
All packages.
|
|
|
Sentinel representing nil.
|
1.4.6