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

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

Inherited by stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node.

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>
struct stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node

The header structure of each node in-memory.

This structure is extended by inner_node or leaf_node.

Definition at line 219 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>

void stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::initialize

(

const unsigned short

l

)

[inline]

Delayed initialisation of constructed node.

Reimplemented in stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node.

Definition at line 229 of file btree.h.

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

Referenced by stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::initialize(), and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node::initialize().

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>

bool stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::isleafnode

(

)

const [inline]

True if this is a leaf node.

Definition at line 236 of file btree.h.

References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::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>

unsigned short stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::level

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

Definition at line 222 of file btree.h.

Referenced by stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::initialize(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::insert_start(), and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::isleafnode().

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>

unsigned short stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::slotuse

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

Definition at line 226 of file btree.h.

Referenced by stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::end(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::erase_one_descend(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::initialize(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::insert_start(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::isfew(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node::isfew(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::isfull(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node::isfull(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::isunderflow(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node::isunderflow(), stx::btree< _Key, _Data, std::pair< key_type, data_type >, _Compare, _Traits, true >::merge_leaves(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::operator++(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator++(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator++(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::operator++(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_reverse_iterator::operator--(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator--(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::const_iterator::operator--(), and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::operator--().

---

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

• stx/btree.h