![]() |
CopperSpice API
1.9.2
|
STL style const iterator for QMap. More...
Public Typedefs | |
using | iterator_category = std::bidirectional_iterator_tag |
Public Methods | |
const_iterator () = default | |
const_iterator (iterator iter) | |
const Key & | key () const |
bool | operator!= (const_iterator other) const |
const Val & | operator* () const |
const_iterator | operator+ (size_type n) const |
const_iterator & | operator++ () |
const_iterator | operator++ (int) |
const_iterator & | operator+= (size_type n) |
const_iterator | operator- (size_type n) const |
const_iterator & | operator-- () |
const_iterator | operator-- (int) |
const_iterator & | operator-= (size_type n) |
const Val * | operator-> () const |
bool | operator== (const_iterator other) const |
const std::pair< const Key, Val > & | pair () const |
const Val & | value () const |
Friends | |
bool | operator!= (iterator iter1, const_iterator iter2) |
bool | operator== (iterator iter1, const_iterator iter2) |
class | QMap< Key, Val, C > |
The QMap::const_iterator class provides an STL style const iterator for QMap. QMap features both STL style iterators and Java style iterators.
QMap::const_iterator allows you to iterate over a QMap. If you want to modify the QMap as you iterate over it use QMap::iterator instead.
After construction you must initialize the iterator using a method like QMap::constBegin(), QMap::constEnd(), or QMap::find() before you can start iterating.
The following example prints all of the (key, value) pairs in the map.
Unlike QHash which stores its items in an arbitrary order, QMap stores its items ordered by key.
QMap< Key, Val, C >::const_iterator::iterator_category |
Equivalent to std::bidirectional_iterator_tag indicating this iterator is a bidirectional iterator.
|
default |
Constructs an uninitialized iterator.
Methods like key(), value(), and operator++() must not be called on an uninitialized iterator. Use operator=() to assign a value to it before using it.
|
inline |
Constructs a copy of iter.
|
inline |
Returns the current item's key.
|
inline |
Returns true if other points to a different item than this iterator, otherwise it returns false.
|
inline |
|
inline |
Returns an iterator to the item at n positions forward from this iterator. If n is negative the iterator goes backward.
This operation can be slow for large values of n.
|
inline |
The prefix ++ operator (++i
) advances the iterator to the next item in the map and returns an iterator to the new current item.
Calling this method on QMap::end() leads to undefined behavior.
|
inline |
The postfix ++ operator (i++
) advances the iterator to the next item in the map and returns an iterator to the previously current item.
|
inline |
Advances the iterator by n items. If n is negative the iterator goes backward.
This operation can be slow for large values of n.
|
inline |
Returns an iterator to the item at n positions backward from this iterator. If n is negative the iterator goes forward.
This operation can be slow for large values of n.
|
inline |
The prefix – operator (–i
) makes the preceding item current and returns an iterator pointing to the new current item.
Calling this method on QMap::begin() leads to undefined behavior.
|
inline |
The postfix – operator (i–
) makes the preceding item current and returns an iterator pointing to the previously current item.
|
inline |
Makes the iterator go back by n items. If n is negative the iterator goes forward.
This operation can be slow for large values of n.
|
inline |
Returns a pointer to the current item's value.
|
inline |
Returns true if other points to the same item as this iterator, otherwise it returns false.
|
inline |
Returns the current item's key and value as a pair.
|
inline |
Returns the current item's value.
|
friend |
Returns true if iter1 points to a different item than iter2, otherwise it returns false.
|
friend |
Returns true if iter1 points to the same item as iter2, otherwise it returns false.