Thrill
0.1
|
The header structure of each node in-memory. This structure is extended by InnerNode or LeafNode.
Public Member Functions | |
void | initialize (const unsigned short l) |
Delayed initialisation of constructed node. More... | |
bool | is_leafnode () const |
True if this is a leaf node. More... | |
Public Attributes | |
unsigned short | level |
Level in the b-tree, if level == 0 -> leaf node. More... | |
unsigned short | slotuse |
|
inline |
|
inline |
unsigned short level |
unsigned short slotuse |
Number of key slotuse use, so the number of valid children or data pointers
Definition at line 219 of file btree.hpp.
Referenced by BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::iterator::operator++(), BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_iterator::operator++(), BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::reverse_iterator::operator++(), BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_reverse_iterator::operator++(), BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::iterator::operator--(), BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_iterator::operator--(), BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::reverse_iterator::operator--(), and BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::const_reverse_iterator::operator--().