STX B+ Tree Template Classes 0.8.6
Public Member Functions | Public Attributes

stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node Struct Reference

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

List of all members.

Public Member Functions

void initialize (const unsigned short l)
 Delayed initialisation of constructed node.
bool isleafnode () const
 True if this is a leaf node.

Public Attributes

unsigned short level
 Level in the b-tree, if level == 0 -> leaf node.
unsigned short slotuse
 Number of key slotuse use, so number of valid children or data pointers.

Detailed Description

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>
struct stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node

The header structure of each node in-memory.

This structure is extended by inner_node or leaf_node.

Definition at line 225 of file btree.h.


Member Function Documentation

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>
void stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node::initialize ( const unsigned short  l) [inline]
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>
bool stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node::isleafnode ( ) const [inline]

True if this is a leaf node.

Definition at line 242 of file btree.h.

References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node::level.


Member Data Documentation

template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>
unsigned short stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node::level
template<typename _Key, typename _Data, typename _Value = std::pair<_Key, _Data>, typename _Compare = std::less<_Key>, typename _Traits = btree_default_map_traits<_Key, _Data>, bool _Duplicates = false, typename _Alloc = std::allocator<_Value>>
unsigned short stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node::slotuse

Number of key slotuse use, so number of valid children or data pointers.

Definition at line 232 of file btree.h.

Referenced by stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::end(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::erase_iter_descend(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::erase_one_descend(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::node::initialize(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::insert_start(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::leaf_node::isfew(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::inner_node::isfew(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::leaf_node::isfull(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::inner_node::isfull(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::leaf_node::isunderflow(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::inner_node::isunderflow(), stx::btree< key_type, data_type, value_type, key_compare, traits, false, allocator_type >::merge_leaves(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::const_reverse_iterator::operator++(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator++(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::const_iterator::operator++(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::iterator::operator++(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::const_reverse_iterator::operator--(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::reverse_iterator::operator--(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::const_iterator::operator--(), and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates, _Alloc >::iterator::operator--().


The documentation for this struct was generated from the following file:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines