#include <rbTree.h>
Collaboration diagram for rbTree:

Data Fields | |
| rbTree * | next |
| rbTreeNode * | root |
| int | n |
| int(* | compare )(void *, void *) |
| rbTreeNode ** | stack |
| lm * | lm |
| rbTreeNode * | freeList |
Definition at line 22 of file rbTree.h.
struct rbTree* rbTree::next [read] |
struct rbTreeNode* rbTree::root [read] |
Definition at line 25 of file rbTree.h.
Referenced by rbTreeAdd(), rbTreeDump(), rbTreeFind(), rbTreeNewDetailed(), rbTreeRemove(), rbTreeTraverse(), rbTreeTraverseRange(), and restructure().
| int rbTree::n |
Definition at line 26 of file rbTree.h.
Referenced by rbTreeAdd(), rbTreeNewDetailed(), and rbTreeRemove().
| int(* rbTree::compare)(void *, void *) |
Referenced by rbTreeAdd(), rbTreeFind(), rbTreeNewDetailed(), rbTreeRemove(), rbTreeTraverse(), and rbTreeTraverseRange().
struct rbTreeNode** rbTree::stack [read] |
Definition at line 28 of file rbTree.h.
Referenced by rangeTreeNewDetailed(), rbTreeAdd(), rbTreeNewDetailed(), rbTreeRemove(), and restructure().
struct lm* rbTree::lm [read] |
Definition at line 29 of file rbTree.h.
Referenced by rangeTreeAdd(), rbTreeAdd(), rbTreeFree(), and rbTreeNewDetailed().
struct rbTreeNode* rbTree::freeList [read] |
1.5.2