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

#include <tpl_b_tree.H>

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

Public Member Functions
	BTreeNode (const bool is_leaf)

Public Attributes
bool	leaf = true
Array< Key >	keys
Array< std::unique_ptr< BTreeNode > >	children

Detailed Description

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

Definition at line 73 of file tpl_b_tree.H.

Constructor & Destructor Documentation

BTreeNode()

template<typename Key >

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

inlineexplicit

Definition at line 79 of file tpl_b_tree.H.

Member Data Documentation

children

template<typename Key >

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

Definition at line 77 of file tpl_b_tree.H.

Referenced by Aleph::Gen_B_Tree< Key, Compare, MinDegree >::borrow_from_next(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::borrow_from_prev(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::clone_node(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::collect_keys(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::contains_in(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::ensure_child_has_extra(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::insert_nonfull(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::lower_bound(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::max_in(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::merge_children(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::min_in(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::remove_from(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::split_child(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::upper_bound(), and Aleph::Gen_B_Tree< Key, Compare, MinDegree >::verify_node().

keys

template<typename Key >

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

Definition at line 76 of file tpl_b_tree.H.

Referenced by Aleph::Gen_B_Tree< Key, Compare, MinDegree >::borrow_from_next(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::borrow_from_prev(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::clone_node(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::collect_keys(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::contains_in(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::insert_nonfull(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::lower_bound(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::max_in(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::merge_children(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::min_in(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::remove_from(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::split_child(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::upper_bound(), and Aleph::Gen_B_Tree< Key, Compare, MinDegree >::verify_node().

leaf

template<typename Key >

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

Definition at line 75 of file tpl_b_tree.H.

Referenced by Aleph::Gen_B_Tree< Key, Compare, MinDegree >::borrow_from_next(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::borrow_from_prev(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::clone_node(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::collect_keys(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::contains_in(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::insert_nonfull(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::lower_bound(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::max_in(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::merge_children(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::min_in(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::remove_from(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::split_child(), Aleph::Gen_B_Tree< Key, Compare, MinDegree >::upper_bound(), and Aleph::Gen_B_Tree< Key, Compare, MinDegree >::verify_node().

---

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

• tpl_b_tree.H