tlx
Loading...
Searching...
No Matches
BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::reverse_iterator Class Reference

STL-like mutable reverse iterator object for B+ tree items. More...

#include <btree.hpp>

Public Types

typedef BTree::key_type key_type
 The key type of the btree. Returned by key().
 
typedef BTree::value_type value_type
 The value type of the btree. Returned by operator*().
 
typedef value_typereference
 Reference to the value_type. STL required.
 
typedef value_typepointer
 Pointer to the value_type. STL required.
 
typedef std::bidirectional_iterator_tag iterator_category
 STL-magic iterator category.
 
typedef ptrdiff_t difference_type
 STL-magic.
 
typedef reverse_iterator self
 Our own type.
 

Public Member Functions

 reverse_iterator ()
 Default-Constructor of a reverse iterator.
 
 reverse_iterator (typename BTree::LeafNode *l, unsigned short s)
 Initializing-Constructor of a mutable reverse iterator.
 
 reverse_iterator (const iterator &it)
 Copy-constructor from a mutable iterator.
 
reference operator* () const
 Dereference the iterator.
 
pointer operator-> () const
 Dereference the iterator.
 
const key_typekey () const
 Key of the current slot.
 
reverse_iteratoroperator++ ()
 Prefix++ advance the iterator to the next slot.
 
reverse_iterator operator++ (int)
 Postfix++ advance the iterator to the next slot.
 
reverse_iteratoroperator-- ()
 Prefix– backstep the iterator to the last slot.
 
reverse_iterator operator-- (int)
 Postfix– backstep the iterator to the last slot.
 
bool operator== (const reverse_iterator &x) const
 Equality of iterators.
 
bool operator!= (const reverse_iterator &x) const
 Inequality of iterators.
 

Private Attributes

BTree::LeafNodecurr_leaf
 The currently referenced leaf node of the tree.
 
unsigned short curr_slot
 One slot past the current key/data slot referenced.
 
 TLX_BTREE_FRIENDS
 

Friends

class iterator
 Friendly to the const_iterator, so it may access the two data items directly.
 
class const_iterator
 Also friendly to the const_iterator, so it may access the two data items directly.
 
class const_reverse_iterator
 Also friendly to the const_iterator, so it may access the two data items directly.
 

Detailed Description

template<typename Key, typename Value, typename KeyOfValue, typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
class tlx::BTree< Key, Value, KeyOfValue, Compare, Traits, Duplicates, Allocator >::reverse_iterator

STL-like mutable reverse iterator object for B+ tree items.

The iterator points to a specific slot number in a leaf.

Definition at line 680 of file btree.hpp.

Member Typedef Documentation

◆ difference_type

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
typedef ptrdiff_t difference_type

STL-magic.

Definition at line 701 of file btree.hpp.

◆ iterator_category

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
typedef std::bidirectional_iterator_tag iterator_category

STL-magic iterator category.

Definition at line 698 of file btree.hpp.

◆ key_type

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
typedef BTree::key_type key_type

The key type of the btree. Returned by key().

Definition at line 686 of file btree.hpp.

◆ pointer

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
typedef value_type* pointer

Pointer to the value_type. STL required.

Definition at line 695 of file btree.hpp.

◆ reference

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
typedef value_type& reference

Reference to the value_type. STL required.

Definition at line 692 of file btree.hpp.

◆ self

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
typedef reverse_iterator self

Our own type.

Definition at line 704 of file btree.hpp.

◆ value_type

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
typedef BTree::value_type value_type

The value type of the btree. Returned by operator*().

Definition at line 689 of file btree.hpp.

Constructor & Destructor Documentation

◆ reverse_iterator() [1/3]

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
reverse_iterator ( )
inline

Default-Constructor of a reverse iterator.

Definition at line 736 of file btree.hpp.

◆ reverse_iterator() [2/3]

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
reverse_iterator ( typename BTree::LeafNode l,
unsigned short  s 
)
inline

Initializing-Constructor of a mutable reverse iterator.

Definition at line 741 of file btree.hpp.

◆ reverse_iterator() [3/3]

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
reverse_iterator ( const iterator it)
inline

Copy-constructor from a mutable iterator.

Definition at line 746 of file btree.hpp.

Member Function Documentation

◆ key()

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
const key_type & key ( ) const
inline

Key of the current slot.

Definition at line 763 of file btree.hpp.

◆ operator!=()

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
bool operator!= ( const reverse_iterator x) const
inline

Inequality of iterators.

Definition at line 846 of file btree.hpp.

◆ operator*()

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
reference operator* ( ) const
inline

Dereference the iterator.

Definition at line 751 of file btree.hpp.

◆ operator++() [1/2]

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
reverse_iterator & operator++ ( )
inline

Prefix++ advance the iterator to the next slot.

Definition at line 769 of file btree.hpp.

◆ operator++() [2/2]

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
reverse_iterator operator++ ( int  )
inline

Postfix++ advance the iterator to the next slot.

Definition at line 786 of file btree.hpp.

◆ operator--() [1/2]

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
reverse_iterator & operator-- ( )
inline

Prefix– backstep the iterator to the last slot.

Definition at line 805 of file btree.hpp.

◆ operator--() [2/2]

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
reverse_iterator operator-- ( int  )
inline

Postfix– backstep the iterator to the last slot.

Definition at line 822 of file btree.hpp.

◆ operator->()

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
pointer operator-> ( ) const
inline

Dereference the iterator.

Definition at line 757 of file btree.hpp.

◆ operator==()

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
bool operator== ( const reverse_iterator x) const
inline

Equality of iterators.

Definition at line 841 of file btree.hpp.

Friends And Related Symbol Documentation

◆ const_iterator

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
friend class const_iterator
friend

Also friendly to the const_iterator, so it may access the two data items directly.

Definition at line 721 of file btree.hpp.

◆ const_reverse_iterator

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
friend class const_reverse_iterator
friend

Also friendly to the const_iterator, so it may access the two data items directly.

Definition at line 725 of file btree.hpp.

◆ iterator

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
friend class iterator
friend

Friendly to the const_iterator, so it may access the two data items directly.

Definition at line 717 of file btree.hpp.

Member Data Documentation

◆ curr_leaf

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
BTree::LeafNode* curr_leaf
private

The currently referenced leaf node of the tree.

Definition at line 710 of file btree.hpp.

◆ curr_slot

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
unsigned short curr_slot
private

One slot past the current key/data slot referenced.

Definition at line 713 of file btree.hpp.

◆ TLX_BTREE_FRIENDS

template<typename Key , typename Value , typename KeyOfValue , typename Compare = std::less<Key>, typename Traits = btree_default_traits<Key, Value>, bool Duplicates = false, typename Allocator = std::allocator<Value>>
TLX_BTREE_FRIENDS
private

Definition at line 730 of file btree.hpp.


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