Template Class BPlusTree
Defined in File BPlusTree.h
Nested Relationships
Nested Types
Class Documentation
-
template<std::totally_ordered K, class V>
class BPlusTree a B+-tree of order m, without the removal
Public Types
-
using size_type = std::size_t
-
using difference_type = std::ptrdiff_t
-
using reference = value_type
-
using const_reference = value_type
-
using iterator = const_iterator
Public Functions
-
explicit BPlusTree(int m)
an empty B+-tree of order m > 2, the root a leaf
-
~BPlusTree()
-
std::size_t size(void) const
-
int order(void) const
the order m
-
std::vector<std::pair<K, V>> range(const K &A, const K &B) const
the pairs with keys in [ A , B ], read along the list of the leaves
-
std::vector<std::vector<std::vector<K>>> levels(void) const
the keys of the nodes, level by level from the root, each level from left to right: the shape of the tree, as in Figura 6.7
-
void check(void) const
checks the shape [see shaped()] whatever the level of the contracts; it throws contract_violation if it fails
-
inline const_iterator begin(void) const
-
inline const_iterator end(void) const
-
inline const_iterator cbegin(void) const
-
inline const_iterator cend(void) const
-
class const_iterator
Public Types
-
using difference_type = std::ptrdiff_t
-
using iterator_concept = std::bidirectional_iterator_tag
-
using iterator_category = std::input_iterator_tag
Public Functions
-
const_iterator(void) = default
-
inline const_iterator &operator++(void)
-
inline const_iterator &operator--(void)
-
inline const_iterator operator++(int)
-
inline const_iterator operator--(int)
-
inline bool operator==(const const_iterator &o) const
-
using difference_type = std::ptrdiff_t
-
using size_type = std::size_t