Node object.
More...
#include <orbtree_node.h>
|
|
| Node (const KeyValue &kv_) |
| |
|
| Node (KeyValue &&kv_) |
| |
|
template<class... T> |
| | Node (T &&... args) |
| |
|
KeyValue & | get_key_value () |
| |
|
const KeyValue & | get_key_value () const |
| |
|
bool | is_red () const |
| |
|
bool | is_black () const |
| |
|
void | set_red () |
| |
|
void | set_black () |
| |
|
NodeHandle | get_parent () const |
| |
|
NodeHandle | get_left () const |
| |
|
NodeHandle | get_right () const |
| |
|
void | set_parent (NodeHandle p) |
| |
|
void | set_left (NodeHandle x) |
| |
|
void | set_right (NodeHandle x) |
| |
|
void | set_deleted () |
| | Set a flag indicating this node has been deleted (but memory has not been freed yet).
|
| |
|
bool | is_deleted () const |
| | Check if this node is deleted.
|
| |
|
void | swap (Node &n) |
| |
|
|
KeyValue | kv |
| | Key and (optionally) value stored in this node.
|
| |
|
IndexType | parent |
| | Parent node reference, actually an index in a vector; also stores red-black flag.
|
| |
|
IndexType | left |
| | Left child.
|
| |
|
IndexType | right |
| | Right child.
|
| |
|
|
class | NodeAllocatorCompact< KeyValueT, NVTypeT, IndexType > |
| |
template<class KeyValueT, class NVTypeT, class IndexType>
struct orbtree::NodeAllocatorCompact< KeyValueT, NVTypeT, IndexType >::Node
Node object.
The documentation for this struct was generated from the following file:
