|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Red-Black node data with color and subtree count. More...
#include <rbNodeRk.H>
Public Member Functions | |
| RbNodeRk_Data () noexcept | |
| RbNodeRk_Data (SentinelCtor) noexcept | |
| Color & | getColor () noexcept |
| size_t & | getCount () noexcept |
| void | reset () noexcept |
Private Attributes | |
| Color | color |
| size_t | count |
Red-Black node data with color and subtree count.
This class stores the color (RED or BLACK) for Red-Black balancing and a count field for the number of nodes in the subtree rooted at this node. The count enables O(log n) select and position operations.
Definition at line 61 of file rbNodeRk.H.
|
inlinenoexcept |
Definition at line 68 of file rbNodeRk.H.
|
inlinenoexcept |
Definition at line 70 of file rbNodeRk.H.
|
inlinenoexcept |
Definition at line 72 of file rbNodeRk.H.
References color.
|
inlinenoexcept |
Definition at line 74 of file rbNodeRk.H.
References count.
|
inlinenoexcept |
Definition at line 76 of file rbNodeRk.H.
|
private |
Definition at line 63 of file rbNodeRk.H.
Referenced by getColor(), and reset().
|
private |
Definition at line 64 of file rbNodeRk.H.
Referenced by getCount(), and reset().