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

Extended structure of a inner node in-memory. More...

Inherits stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node.

List of all members.

Public Member Functions
void	initialize (const unsigned short l)
	Set variables to initial values.
bool	isfull () const
	True if the node's slots are full.
bool	isfew () const
	True if few used entries, less than half full.
bool	isunderflow () const
	True if node has too few entries.
Public Attributes
key_type	slotkey [innerslotmax]
	Keys of children or data pointers.
node *	childid [innerslotmax+1]
	Pointers to children.

---

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 >::inner_node

Extended structure of a inner node in-memory.

Contains only keys and no data items.

Definition at line 244 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 >::inner_node::initialize

(

const unsigned short

l

)

[inline]

Set variables to initial values.

Reimplemented from stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node.

Definition at line 253 of file btree.h.

References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::initialize().

Referenced by stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::allocate_inner().

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 >::inner_node::isfull

(

)

const [inline]

True if the node's slots are full.

Definition at line 259 of file btree.h.

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

Referenced by stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::split_inner_node().

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 >::inner_node::isfew

(

)

const [inline]

True if few used entries, less than half full.

Definition at line 265 of file btree.h.

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

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 >::inner_node::isunderflow

(

)

const [inline]

True if node has too few entries.

Definition at line 271 of file btree.h.

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

Referenced by stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::verify_node().

---

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>

key_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node::slotkey[innerslotmax]

Keys of children or data pointers.

Definition at line 247 of file btree.h.

Referenced by stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::copy_recursive(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::erase_one_descend(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::insert_start(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::merge_inner(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::print_node(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::shift_left_inner(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::shift_left_leaf(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::shift_right_inner(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::shift_right_leaf(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::split_inner_node(), and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::verify_node().

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>

node* stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::inner_node::childid[innerslotmax+1]

Pointers to children.

Definition at line 250 of file btree.h.

Referenced by stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::copy_recursive(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::erase_one_descend(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::insert_descend(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::insert_start(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::merge_inner(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::print_node(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::restore_node(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::shift_left_inner(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::shift_left_leaf(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::shift_right_inner(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::shift_right_leaf(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::split_inner_node(), and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::verify_node().

---

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

• stx/btree.h

---