#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. Required by the reverse_iterator. | |
| typedef value_type * | pointer |
| Pointer to the value_type. Required by the reverse_iterator. | |
| typedef std::bidirectional_iterator_tag | iterator_category |
| STL-magic iterator category. | |
| typedef ptrdiff_t | difference_type |
| STL-magic. | |
| typedef iterator | self |
| Our own type. | |
Public Member Functions | |
| iterator (typename btree::leaf_node *l, unsigned short s) | |
| Constructor of 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. | |
Friends | |
| class | btree< key_type, data_type, value_type, key_compare, traits, allow_duplicates >::const_iterator |
| 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 352 of file btree.h.
| typedef btree::key_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::key_type |
| typedef btree::data_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::data_type |
| typedef btree::value_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::value_type |
| typedef btree::pair_type stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::pair_type |
| typedef value_type& stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::reference |
| typedef value_type* stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::pointer |
| typedef std::bidirectional_iterator_tag stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::iterator_category |
| typedef ptrdiff_t stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::difference_type |
| typedef iterator stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::self |
| stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::iterator | ( | typename btree::leaf_node * | l, | |
| unsigned short | s | |||
| ) | [inline] |
| reference stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::operator * | ( | ) | const [inline] |
| pointer stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::operator-> | ( | ) | const [inline] |
| const key_type& stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::key | ( | ) | const [inline] |
| data_type& stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::data | ( | ) | const [inline] |
Writable reference to the current data object.
Definition at line 434 of file btree.h.
Referenced by stx::btree_map< _Key, _Data, _Compare, _Traits >::operator[]().
| self& stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::operator++ | ( | ) | [inline] |
| self stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::operator++ | ( | int | ) | [inline] |
| self& stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::operator-- | ( | ) | [inline] |
| self stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::operator-- | ( | int | ) | [inline] |
| bool stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::operator== | ( | const self & | x | ) | const [inline] |
Equality of iterators.
Definition at line 516 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::currnode, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::currslot.
| bool stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::operator!= | ( | const self & | x | ) | const [inline] |
Inequality of iterators.
Definition at line 522 of file btree.h.
References stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::currnode, and stx::btree< _Key, _Data, _Value, _Compare, _Traits, _Duplicates >::iterator::currslot.
friend class btree< key_type, data_type, value_type, key_compare, traits, allow_duplicates >::const_iterator [friend] |
Friendly to the const_iterator, so it may access the two data items directly.
1.5.2