|
tlx
|
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(). More... | |
| typedef BTree::value_type | value_type |
| The value type of the btree. Returned by operator*(). More... | |
| typedef value_type & | reference |
| Reference to the value_type. STL required. More... | |
| typedef value_type * | pointer |
| Pointer to the value_type. STL required. More... | |
| typedef std::bidirectional_iterator_tag | iterator_category |
| STL-magic iterator category. More... | |
| typedef ptrdiff_t | difference_type |
| STL-magic. More... | |
| typedef reverse_iterator | self |
| Our own type. More... | |
Public Member Functions | |
| reverse_iterator () | |
| Default-Constructor of a reverse iterator. More... | |
| reverse_iterator (typename BTree::LeafNode *l, unsigned short s) | |
| Initializing-Constructor of a mutable reverse iterator. More... | |
| reverse_iterator (const iterator &it) | |
| Copy-constructor from a mutable iterator. More... | |
| reference | operator* () const |
| Dereference the iterator. More... | |
| pointer | operator-> () const |
| Dereference the iterator. More... | |
| const key_type & | key () const |
| Key of the current slot. More... | |
| reverse_iterator & | operator++ () |
| Prefix++ advance the iterator to the next slot. More... | |
| reverse_iterator | operator++ (int) |
| Postfix++ advance the iterator to the next slot. More... | |
| reverse_iterator & | operator-- () |
| Prefix– backstep the iterator to the last slot. More... | |
| reverse_iterator | operator-- (int) |
| Postfix– backstep the iterator to the last slot. More... | |
| bool | operator== (const reverse_iterator &x) const |
| Equality of iterators. More... | |
| bool | operator!= (const reverse_iterator &x) const |
| Inequality of iterators. More... | |
Private Attributes | |
| BTree::LeafNode * | curr_leaf |
| The currently referenced leaf node of the tree. More... | |
| unsigned short | curr_slot |
| One slot past the current key/data slot referenced. More... | |
| TLX_BTREE_FRIENDS | |
Friends | |
| class | iterator |
| Friendly to the const_iterator, so it may access the two data items directly. More... | |
| class | const_iterator |
| Also friendly to the const_iterator, so it may access the two data items directly. More... | |
| class | const_reverse_iterator |
| Also friendly to the const_iterator, so it may access the two data items directly. More... | |
STL-like mutable reverse iterator object for B+ tree items.
The iterator points to a specific slot number in a leaf.
| typedef ptrdiff_t difference_type |
| typedef std::bidirectional_iterator_tag iterator_category |
| typedef BTree::key_type key_type |
| typedef value_type* pointer |
| typedef value_type& reference |
| typedef reverse_iterator self |
| typedef BTree::value_type value_type |
The value type of the btree. Returned by operator*().
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
friend |
Also friendly to the const_iterator, so it may access the two data items directly.
|
friend |
Also friendly to the const_iterator, so it may access the two data items directly.
|
friend |
Friendly to the const_iterator, so it may access the two data items directly.
|
private |
|
private |