Go to the documentation of this file.
11 #ifndef TLX_CONTAINER_BTREE_MULTISET_HEADER
12 #define TLX_CONTAINER_BTREE_MULTISET_HEADER
37 template <
typename Key_,
38 typename Compare_ = std::less<Key_>,
39 typename Traits_ = btree_default_traits<Key_, Key_>,
40 typename Alloc_ = std::allocator<Key_> >
95 typedef typename btree_impl::tree_stats
tree_stats;
140 typedef typename btree_impl::iterator
iterator;
181 template <
class InputIterator>
190 template <
class InputIterator>
194 :
tree_(kcf, alloc) {
387 std::pair<const_iterator, const_iterator>
equal_range(
401 return (
tree_ == other.tree_);
406 return (
tree_ != other.tree_);
412 return (
tree_ < other.tree_);
417 return (
tree_ > other.tree_);
422 return (
tree_ <= other.tree_);
427 return (
tree_ >= other.tree_);
469 template <
typename InputIterator>
470 void insert(InputIterator first, InputIterator last) {
471 InputIterator iter = first;
482 template <
typename Iterator>
483 void bulk_load(Iterator first, Iterator last) {
509 #ifdef TLX_BTREE_TODO
519 #ifdef TLX_BTREE_DEBUG
528 void print(std::ostream& os)
const {
533 void print_leaves(std::ostream& os)
const {
534 tree_.print_leaves(os);
557 #endif // !TLX_CONTAINER_BTREE_MULTISET_HEADER
~btree_multiset()
Frees up all used B+ tree memory pages.
void verify() const
Run a thorough verification of all B+ tree invariants.
btree_multiset(const allocator_type &alloc=allocator_type())
Default constructor initializing an empty B+ tree with the standard key comparison function.
iterator insert(const key_type &x)
Attempt to insert a key into the B+ tree.
static const unsigned short leaf_slotmin
Computed B+ tree parameter: The minimum number of key slots used in a leaf.
value_compare value_comp() const
Constant access to a constructed value_type comparison object.
btree_impl::reverse_iterator reverse_iterator
create mutable reverse iterator by using STL magic
static const key_type & get(const value_type &v)
pull first out of pair
static const unsigned short inner_slotmax
Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...
void verify() const
Run a thorough verification of all B+ tree invariants.
btree_impl::iterator iterator
STL-like iterator object for B+ tree items.
const struct tree_stats & get_stats() const
Return a const reference to the current statistics.
allocator_type get_allocator() const
Return the base node allocator provided during construction.
void clear()
Frees all keys and all nodes of the tree.
void clear()
Frees all key/data pairs and all nodes of the tree.
key_compare key_comp() const
Constant access to the key comparison object sorting the B+ tree.
void bulk_load(Iterator ibegin, Iterator iend)
Bulk load a sorted range.
btree_impl::const_iterator const_iterator
STL-like iterator object for B+ tree items.
static const unsigned short inner_slotmin
Computed B+ tree parameter: The minimum number of key slots used in an inner node.
static const bool debug
Debug parameter: Prints out lots of debug information about how the algorithms change the tree.
std::pair< iterator, iterator > equal_range(const key_type &key)
Searches the B+ tree and returns both lower_bound() and upper_bound().
static const unsigned short inner_slotmax
Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...
bool operator<(const btree_multiset &other) const
Total ordering relation of B+ trees of the same type.
btree_impl::size_type size_type
Size type used to count keys.
iterator end()
Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...
bool operator>=(const btree_multiset &other) const
Greater-equal relation. Based on operator<.
size_type count(const key_type &key) const
Tries to locate a key in the B+ tree and returns the number of identical key entries found.
std::pair< iterator, bool > insert(const value_type &x)
Attempt to insert a key/data pair into the B+ tree.
btree_multiset & operator=(const btree_multiset &other)
Assignment operator. All the keys are copied.
static const unsigned short leaf_slotmax
Base B+ tree parameter: The number of key/data slots in each leaf.
size_type max_size() const
Returns the largest possible size of the B+ Tree.
bool exists(const key_type &key) const
Non-STL function checking whether a key is in the B+ tree.
btree_impl::const_reverse_iterator const_reverse_iterator
create constant reverse iterator by using STL magic
reverse_iterator rend()
Constructs a read/data-write reverse iterator that points to the first slot in the first leaf of the ...
bool operator==(const btree_multiset &other) const
Equality relation of B+ trees of the same type.
bool erase_one(const key_type &key)
Erases one (the first) of the key/data pairs associated with the given key.
bool operator<=(const btree_multiset &other) const
Less-equal relation. Based on operator<.
btree_impl::tree_stats tree_stats
Small structure containing statistics about the tree.
size_type erase(const key_type &key)
Erases all the entries of the given key.
static const unsigned short inner_slotmin
Computed B+ tree parameter: The minimum number of key slots used in an inner node.
key_compare key_comp() const
Constant access to the key comparison object sorting the B+ tree.
void swap(btree_multiset &from)
Fast swapping of two identical B+ tree objects.
iterator upper_bound(const key_type &key)
Searches the B+ tree and returns an iterator to the first pair greater than key, or end() if all keys...
Traits_ traits
Third template parameter: Traits object used to define more parameters of the B+ tree.
std::pair< iterator, iterator > equal_range(const key_type &key)
Searches the B+ tree and returns both lower_bound() and upper_bound().
allocator_type get_allocator() const
Return the base node allocator provided during construction.
static const bool self_verify
Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...
value_compare value_comp() const
Constant access to a constructed value_type comparison object.
size_type size() const
Return the number of key/data pairs in the B+ tree.
bool empty() const
Returns true if there is at least one key in the B+ tree.
iterator lower_bound(const key_type &key)
Searches the B+ tree and returns an iterator to the first pair equal to or greater than key,...
key_type value_type
Construct the set value_type: the key_type.
Key_ key_type
First template parameter: The key type of the btree.
btree_impl tree_
The contained implementation object.
reverse_iterator rend()
Constructs a read/data-write reverse iterator that points to the first slot in the first leaf of the ...
iterator begin()
Constructs a read/data-write iterator that points to the first slot in the first leaf of the B+ tree.
Alloc_ allocator_type
Fourth template parameter: STL allocator.
size_type erase(const key_type &key)
Erases all the key/data pairs associated with the given key.
Specialized B+ tree template class implementing STL's multiset container.
size_type count(const key_type &key) const
Tries to locate a key in the B+ tree and returns the number of identical key entries found.
void bulk_load(Iterator first, Iterator last)
Bulk load a sorted range [first,last).
void swap(CountingPtr< A, D > &a1, CountingPtr< A, D > &a2) noexcept
swap enclosed object with another counting pointer (no reference counts need change)
size_type max_size() const
Returns the largest possible size of the B+ Tree.
iterator find(const key_type &key)
Tries to locate a key in the B+ tree and returns an iterator to the key/data slot if found.
Basic class implementing a B+ tree data structure in memory.
reverse_iterator rbegin()
Constructs a read/data-write reverse iterator that points to the first invalid slot in the last leaf ...
iterator end()
Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...
static const bool debug
Debug parameter: Prints out lots of debug information about how the algorithms change the tree.
iterator lower_bound(const key_type &key)
Searches the B+ tree and returns an iterator to the first pair equal to or greater than key,...
Compare_ key_compare
Second template parameter: Key comparison function object.
bool empty() const
Returns true if there is at least one key/data pair in the B+ tree.
BTree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type > btree_impl
Implementation type of the btree_base.
bool operator!=(const btree_multiset &other) const
Inequality relation. Based on operator==.
static const bool allow_duplicates
Operational parameter: Allow duplicate keys in the btree.
bool exists(const key_type &key) const
Non-STL function checking whether a key is in the B+ tree.
iterator find(const key_type &key)
Tries to locate a key in the B+ tree and returns an iterator to the key slot if found.
static const unsigned short leaf_slotmin
Computed B+ tree parameter: The minimum number of key/data slots used in a leaf.
iterator begin()
Constructs a read/data-write iterator that points to the first slot in the first leaf of the B+ tree.
size_type size() const
Return the number of keys in the B+ tree.
bool erase_one(const key_type &key)
Erases one (the first) entry of the given key.
const tree_stats & get_stats() const
Return a const reference to the current statistics.
bool operator>(const btree_multiset &other) const
Greater relation. Based on operator<.
iterator upper_bound(const key_type &key)
Searches the B+ tree and returns an iterator to the first pair greater than key, or end() if all keys...
static const bool allow_duplicates
Sixth template parameter: Allow duplicate keys in the B+ tree.
size_t size_type
Size type used to count keys.
reverse_iterator rbegin()
Constructs a read/data-write reverse iterator that points to the first invalid slot in the last leaf ...
btree_impl::value_compare value_compare
Function class comparing two value_type keys.
static const bool self_verify
Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...
static const unsigned short leaf_slotmax
Base B+ tree parameter: The number of key/data slots in each leaf.