|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Red-Black tree node with rank (subtree count). More...
#include <tpl_binNode.H>Go to the source code of this file.
Classes | |
| class | Aleph::RbNodeRk_Data |
| Red-Black node data with color and subtree count. More... | |
| class | Aleph::RbNodeRk< Key > |
| Extended Red-Black node with subtree counter. More... | |
| class | Aleph::RbNodeRkVtl< Key > |
Namespaces | |
| namespace | Aleph |
| Main namespace for Aleph-w library functions. | |
Macros | |
| #define | COLOR(p) ((p)->getColor()) |
| #define | RED (0) |
| #define | BLACK (1) |
Typedefs | |
| typedef unsigned char | Aleph::Color |
Functions | |
| template<class Node > | |
| bool | Aleph::test_black_condition_rk (Node *p, int &max, int bh=0) |
| Test the black height condition for a red-black tree. | |
| template<class Node > | |
| bool | Aleph::is_red_black_rk (Node *node) |
| Verify if tree rooted at node is a valid red-black tree. | |
| template<class Node > | |
| bool | Aleph::is_red_black_tree_rk (Node *node) |
| Verify if tree is a valid red-black tree with correct counters. | |
| template<class Node , class Compare > | |
| bool | Aleph::is_red_black_bst_rk (Node *node, Compare &cmp) |
| Verify that tree rooted at node is a valid red-black BST with counters. | |
Red-Black tree node with rank (subtree count).
Extends RbNode with subtree size for order statistics.
Definition in file rbNodeRk.H.
| #define BLACK (1) |
Definition at line 53 of file rbNodeRk.H.
| #define COLOR | ( | p | ) | ((p)->getColor()) |
Definition at line 51 of file rbNodeRk.H.
| #define RED (0) |
Definition at line 52 of file rbNodeRk.H.