Aleph::detail::BPlusTreeNode< Key > Struct Template Reference

#include <tpl_bplus_tree.H>

Collaboration diagram for Aleph::detail::BPlusTreeNode< Key >:

Public Member Functions
	BPlusTreeNode (const bool is_leaf)

Public Attributes
bool	leaf = true
Array< Key >	keys
Array< std::unique_ptr< BPlusTreeNode > >	children
BPlusTreeNode *	next = nullptr

Detailed Description

template<typename Key>
struct Aleph::detail::BPlusTreeNode< Key >

Definition at line 74 of file tpl_bplus_tree.H.

Constructor & Destructor Documentation

BPlusTreeNode()

template<typename Key >

Aleph::detail::BPlusTreeNode< Key >::BPlusTreeNode ( const bool  is_leaf )

inlineexplicit

Definition at line 81 of file tpl_bplus_tree.H.

Member Data Documentation

children

template<typename Key >

Array<std::unique_ptr<BPlusTreeNode> > Aleph::detail::BPlusTreeNode< Key >::children

Definition at line 78 of file tpl_bplus_tree.H.

Referenced by Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::borrow_from_next(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::borrow_from_prev(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::clone_node(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::find_leaf(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::fix_underflow(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::insert_nonfull(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::leftmost_leaf(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::merge_children(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::rebuild_separators(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::remove_from(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::rightmost_leaf(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::split_child(), and Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::verify_node().

keys

template<typename Key >

Array<Key> Aleph::detail::BPlusTreeNode< Key >::keys

Definition at line 77 of file tpl_bplus_tree.H.

Referenced by Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::Iterator::Iterator(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::borrow_from_next(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::borrow_from_prev(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::child_index(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::clone_node(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::contains_in(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::Iterator::get_curr(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::insert_nonfull(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::lower_bound(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::merge_children(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::rebuild_separators(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::remove_from(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::Iterator::skip_past_end(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::split_child(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::subtree_max_ptr(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::subtree_min_ptr(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::upper_bound(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::verify_leaf_chain(), and Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::verify_node().

leaf

template<typename Key >

bool Aleph::detail::BPlusTreeNode< Key >::leaf = true

Definition at line 76 of file tpl_bplus_tree.H.

Referenced by Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::borrow_from_next(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::borrow_from_prev(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::clone_node(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::find_leaf(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::insert_nonfull(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::leftmost_leaf(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::merge_children(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::rebuild_separators(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::remove_from(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::rightmost_leaf(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::split_child(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::verify_leaf_chain(), and Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::verify_node().

next

template<typename Key >

BPlusTreeNode* Aleph::detail::BPlusTreeNode< Key >::next = nullptr

Definition at line 79 of file tpl_bplus_tree.H.

Referenced by Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::lower_bound(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::merge_children(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::Iterator::skip_past_end(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::split_child(), Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::upper_bound(), and Aleph::Gen_BPlus_Tree< Key, Compare, MinDegree >::verify_leaf_chain().

---

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

• tpl_bplus_tree.H