#include <btree.h>
Public Types | |
| typedef btree::key_type | key_type |
| The key type of the btree. Returned by key(). | |
| typedef btree::data_type | data_type |
| The data type of the btree. Returned by data(). | |
| typedef btree::value_type | value_type |
| The value type of the btree. Returned by operator*(). | |
| typedef btree::pair_type | pair_type |
| The pair type of the btree. | |
| typedef value_type & | reference |
| Reference to the value_type. STL required. | |
| typedef value_type * | pointer |
| 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::leaf_node *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, this is not a value_type& because key and value are not stored together. | |
| pointer | operator-> () const |
| Dereference the iterator. | |
| const key_type & | key () const |
| Key of the current slot. | |
| data_type & | data () const |
| Writable reference to the current data object. | |
| self & | operator++ () |
| Prefix++ advance the iterator to the next slot. | |
| self | operator++ (int) |
| Postfix++ advance the iterator to the next slot. | |
| self & | operator-- () |
| Prefix-- backstep the iterator to the last slot. | |
| self | operator-- (int) |
| Postfix-- backstep the iterator to the last slot. | |
| bool | operator== (const self &x) const |
| Equality of iterators. | |
| bool | operator!= (const self &x) const |
| Inequality of iterators. | |
Private Attributes | |
| btree::leaf_node * | currnode |
| The currently referenced leaf node of the tree. | |
| unsigned short | currslot |
| One slot past the current key/data slot referenced. | |
| value_type | temp_value |
| Evil! A temporary value_type to STL-correctly deliver operator* and operator->. | |
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. | |
The iterator points to a specific slot number in a leaf.
Definition at line 769 of file btree.h.
| typedef btree::key_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::key_type |
| typedef btree::data_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::data_type |
| typedef btree::value_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::value_type |
| typedef btree::pair_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::pair_type |
| typedef value_type& stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::reference |
| typedef value_type* stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::pointer |
| typedef std::bidirectional_iterator_tag stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::iterator_category |
| typedef ptrdiff_t stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::difference_type |
| typedef reverse_iterator stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::self |
| stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::reverse_iterator | ( | ) | [inline] |
| stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::reverse_iterator | ( | typename btree::leaf_node * | l, | |
| unsigned short | s | |||
| ) | [inline] |
| stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::reverse_iterator | ( | const iterator & | it | ) | [inline] |
| reference stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator* | ( | ) | const [inline] |
Dereference the iterator, this is not a value_type& because key and value are not stored together.
Definition at line 848 of file btree.h.
References BTREE_ASSERT, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currnode, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currslot, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::slotdata, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::slotkey, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::temp_value.
| pointer stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator-> | ( | ) | const [inline] |
Dereference the iterator.
Do not use this if possible, use key() and data() instead. The B+ tree does not stored key and data together.
Definition at line 859 of file btree.h.
References BTREE_ASSERT, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currnode, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currslot, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::slotdata, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::slotkey, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::temp_value.
| const key_type& stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::key | ( | ) | const [inline] |
Key of the current slot.
Definition at line 868 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currnode, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currslot, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::slotkey.
| data_type& stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::data | ( | ) | const [inline] |
Writable reference to the current data object.
Definition at line 874 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currnode, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currslot, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::slotdata.
| self& stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator++ | ( | ) | [inline] |
Prefix++ advance the iterator to the next slot.
Definition at line 880 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currnode, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currslot, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::prevleaf, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::slotuse.
| self stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator++ | ( | int | ) | [inline] |
Postfix++ advance the iterator to the next slot.
Definition at line 898 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currnode, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currslot, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::prevleaf, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::slotuse.
| self& stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator-- | ( | ) | [inline] |
Prefix-- backstep the iterator to the last slot.
Definition at line 918 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currnode, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currslot, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::nextleaf, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::slotuse.
| self stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator-- | ( | int | ) | [inline] |
Postfix-- backstep the iterator to the last slot.
Definition at line 936 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currnode, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currslot, stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::leaf_node::nextleaf, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::node::slotuse.
| bool stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator== | ( | const self & | x | ) | const [inline] |
Equality of iterators.
Definition at line 956 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currnode, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currslot.
| bool stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator!= | ( | const self & | x | ) | const [inline] |
Inequality of iterators.
Definition at line 962 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currnode, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currslot.
friend class iterator [friend] |
Friendly to the const_iterator, so it may access the two data items directly.
friend class const_iterator [friend] |
Also friendly to the const_iterator, so it may access the two data items directly.
friend class const_reverse_iterator [friend] |
Also friendly to the const_iterator, so it may access the two data items directly.
btree::leaf_node* stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currnode [private] |
The currently referenced leaf node of the tree.
Definition at line 805 of file btree.h.
Referenced by stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::data(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::key(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator!=(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator*(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator++(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator--(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator->(), and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator==().
unsigned short stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::currslot [private] |
One slot past the current key/data slot referenced.
Definition at line 808 of file btree.h.
Referenced by stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::data(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::key(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator!=(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator*(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator++(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator--(), stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator->(), and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator==().
value_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::temp_value [mutable, private] |
Evil! A temporary value_type to STL-correctly deliver operator* and operator->.
Definition at line 821 of file btree.h.
Referenced by stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator*(), and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::reverse_iterator::operator->().
1.5.5