11#ifndef TLX_CONTAINER_BTREE_MULTISET_HEADER
12#define TLX_CONTAINER_BTREE_MULTISET_HEADER
37template <
typename Key_,
38 typename Compare_ = std::less<Key_>,
40 typename Alloc_ = std::allocator<Key_> >
181 template <
class InputIterator>
190 template <
class InputIterator>
194 :
tree_(kcf, alloc) {
215 return tree_.key_comp();
221 return tree_.value_comp();
232 return tree_.get_allocator();
255 return tree_.begin();
267 return tree_.begin();
279 return tree_.rbegin();
291 return tree_.rbegin();
313 return tree_.empty();
319 return tree_.max_size();
324 return tree_.get_stats();
336 return tree_.exists(key);
342 return tree_.find(key);
348 return tree_.find(key);
354 return tree_.count(key);
360 return tree_.lower_bound(key);
366 return tree_.lower_bound(key);
372 return tree_.upper_bound(key);
378 return tree_.upper_bound(key);
383 return tree_.equal_range(key);
389 return tree_.equal_range(key);
458 return tree_.insert(x).first;
464 return tree_.insert(hint, x);
469 template <
typename InputIterator>
470 void insert(InputIterator first, InputIterator last) {
471 InputIterator iter = first;
482 template <
typename Iterator>
484 return tree_.bulk_load(first, last);
495 return tree_.erase_one(key);
501 return tree_.erase(key);
506 return tree_.erase(iter);
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);
Basic class implementing a B+ tree data structure in memory.
static const unsigned short inner_slotmax
static const unsigned short inner_slotmin
static const bool allow_duplicates
static const unsigned short leaf_slotmax
static const bool self_verify
static const unsigned short leaf_slotmin
static const unsigned short inner_slotmax
btree_multiset(InputIterator first, InputIterator last, const allocator_type &alloc=allocator_type())
Constructor initializing a B+ tree with the range [first,last)
BTree< key_type, value_type, key_of_value, key_compare, traits, true, allocator_type > btree_impl
const_reverse_iterator rend() const
Constructs a read-only reverse iterator that points to the first slot in the first leaf of the B+ tre...
btree_impl::reverse_iterator reverse_iterator
bool operator==(const btree_multiset &other) const
Equality relation of B+ trees of the same type.
btree_impl::size_type size_type
iterator insert(iterator hint, const key_type &x)
Attempt to insert a key into the B+ tree.
btree_multiset(const key_compare &kcf, const allocator_type &alloc=allocator_type())
Constructor initializing an empty B+ tree with a special key comparison object.
const_iterator begin() const
Constructs a read-only constant iterator that points to the first slot in the first leaf of the B+ tr...
key_type value_type
Construct the set value_type: the key_type.
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,...
btree_multiset< key_type, key_compare, traits, allocator_type > self
Typedef of our own type.
bool erase_one(const key_type &key)
Erases one (the first) entry of the given key.
~btree_multiset()
Frees up all used B+ tree memory pages.
static const unsigned short inner_slotmin
const_iterator lower_bound(const key_type &key) const
Searches the B+ tree and returns a constant iterator to the first pair equal to or greater than key,...
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...
std::pair< const_iterator, const_iterator > equal_range(const key_type &key) const
Searches the B+ tree and returns both lower_bound() and upper_bound().
static const bool allow_duplicates
btree_impl::const_reverse_iterator const_reverse_iterator
static const unsigned short leaf_slotmax
Alloc_ allocator_type
Fourth template parameter: STL allocator.
bool operator!=(const btree_multiset &other) const
Inequality relation. Based on operator==.
size_type size() const
Return the number of keys in the B+ tree.
btree_impl::value_compare value_compare
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.
bool empty() const
Returns true if there is at least one key in the B+ tree.
btree_multiset(const allocator_type &alloc=allocator_type())
Default constructor initializing an empty B+ tree with the standard key comparison function.
reverse_iterator rend()
Constructs a read/data-write reverse iterator that points to the first slot in the first leaf of the ...
allocator_type get_allocator() const
Return the base node allocator provided during construction.
Compare_ key_compare
Second template parameter: Key comparison function object.
bool operator>=(const btree_multiset &other) const
Greater-equal relation. Based on operator<.
btree_impl::tree_stats tree_stats
const tree_stats & get_stats() const
Return a const reference to the current statistics.
static const bool self_verify
void swap(btree_multiset &from)
Fast swapping of two identical B+ tree objects.
btree_multiset & operator=(const btree_multiset &other)
Assignment operator. All the keys are copied.
void verify() const
Run a thorough verification of all B+ tree invariants.
btree_multiset(const btree_multiset &other)
Copy constructor.
size_type max_size() const
Returns the largest possible size of the B+ Tree.
bool operator<=(const btree_multiset &other) const
Less-equal relation. Based on operator<.
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.
bool operator<(const btree_multiset &other) const
Total ordering relation of B+ trees of the same type.
const_iterator upper_bound(const key_type &key) const
Searches the B+ tree and returns a constant iterator to the first pair greater than key,...
bool exists(const key_type &key) const
Non-STL function checking whether a key is in the B+ tree.
static const unsigned short leaf_slotmin
void insert(InputIterator first, InputIterator last)
Attempt to insert the range [first,last) of key_type into the B+ tree.
value_compare value_comp() const
Constant access to a constructed value_type comparison object.
void clear()
Frees all keys and all nodes of the tree.
iterator end()
Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...
Key_ key_type
First template parameter: The key type of the btree.
const_iterator end() const
Constructs a read-only constant iterator that points to the first invalid slot in the last leaf of th...
reverse_iterator rbegin()
Constructs a read/data-write reverse iterator that points to the first invalid slot in the last leaf ...
bool operator>(const btree_multiset &other) const
Greater relation. Based on operator<.
std::pair< iterator, iterator > equal_range(const key_type &key)
Searches the B+ tree and returns both lower_bound() and upper_bound().
iterator begin()
Constructs a read/data-write iterator that points to the first slot in the first leaf of the B+ tree.
iterator insert(const key_type &x)
Attempt to insert a key into the B+ tree.
Traits_ traits
Third template parameter: Traits object used to define more parameters of the B+ tree.
size_type erase(const key_type &key)
Erases all the entries of the given key.
key_compare key_comp() const
Constant access to the key comparison object sorting the B+ tree.
const_reverse_iterator rbegin() const
Constructs a read-only reverse iterator that points to the first invalid slot in the last leaf of the...
const_iterator find(const key_type &key) const
Tries to locate a key in the B+ tree and returns an constant iterator to the key slot if found.
void erase(iterator iter)
Erase the key/data pair referenced by the iterator.
btree_multiset(InputIterator first, InputIterator last, const key_compare &kcf, const allocator_type &alloc=allocator_type())
Constructor initializing a B+ tree with the range [first,last) and a special key comparison object.
void bulk_load(Iterator first, Iterator last)
Bulk load a sorted range [first,last).
btree_impl::iterator iterator
btree_impl::const_iterator const_iterator
Generates default traits for a B+ tree used as a set or map.
static const key_type & get(const value_type &v)
pull first out of pair