tlx
BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::node Struct Reference

The header structure of each node in-memory. More...

Inheritance diagram for BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::node:
BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::InnerNode BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::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
 Number of key slotuse use, so the number of valid children or data pointers. More...
 

Detailed Description

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.

Member Function Documentation

void initialize ( const unsigned short  l)
inline

Delayed initialisation of constructed node.

Definition at line 222 of file btree.hpp.

bool is_leafnode ( ) const
inline

True if this is a leaf node.

Definition at line 228 of file btree.hpp.

Member Data Documentation

unsigned short level

Level in the b-tree, if level == 0 -> leaf node.

Definition at line 215 of file btree.hpp.

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.


The documentation for this struct was generated from the following file: