template<typename Key, typename Value, typename KeyOfValue, typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
struct tlx::BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::node
The header structure of each node in-memory.
This structure is extended by InnerNode or LeafNode.
Definition at line 213 of file btree.hpp.
template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
void initialize |
( |
const unsigned short | l | ) |
|
|
inline |
Delayed initialisation of constructed node.
Definition at line 222 of file btree.hpp.
template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
bool is_leafnode |
( |
| ) |
const |
|
inline |
True if this is a leaf node.
Definition at line 228 of file btree.hpp.
template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
Level in the b-tree, if level == 0 -> leaf node.
Definition at line 215 of file btree.hpp.
template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
Number of key slotuse use, so the number of valid children or data pointers.
Definition at line 219 of file btree.hpp.