const_iterator Class
(QLinkedList::const_iterator)The QLinkedList::const_iterator class provides an STL-style const iterator for QLinkedList. More...
Header: | #include <const_iterator> |
qmake: | QT += core |
Public Functions
const_iterator() | |
const_iterator(Node *n) | |
const_iterator(iterator ci) | |
const_iterator(const const_iterator &other) |
Public Variables
QLinkedList::Node * | i |
Detailed Description
The QLinkedList::const_iterator class provides an STL-style const iterator for QLinkedList.
QLinkedList features both STL-style iterators and Java-style iterators. The STL-style iterators are more low-level and more cumbersome to use; on the other hand, they are slightly faster and, for developers who already know STL, have the advantage of familiarity.
QLinkedList<T>::const_iterator allows you to iterate over a QLinkedList<T>. If you want modify the QLinkedList as you iterate over it, you must use QLinkedList::iterator instead. It is generally good practice to use QLinkedList::const_iterator on a non-const QLinkedList as well, unless you need to change the QLinkedList through the iterator. Const iterators are slightly faster, and can improve code readability.
The default QLinkedList::const_iterator constructor creates an uninitialized iterator. You must initialize it using a function like QLinkedList::constBegin(), QLinkedList::constEnd(), or QLinkedList::insert() before you can start iterating. Here's a typical loop that prints all the items stored in a list:
QLinkedList<QString> list; list.append("January"); list.append("February"); ... list.append("December"); QLinkedList<QString>::const_iterator i; for (i = list.constBegin(); i != list.constEnd(); ++i) cout << *i << endl;
STL-style iterators can be used as arguments to generic algorithms. For example, here's how to find an item in the list using the qFind() algorithm:
QLinkedList<QString> list; ... QLinkedList<QString>::iterator it = qFind(list.constBegin(), list.constEnd(), "Joel"); if (it != list.constEnd()) cout << "Found Joel" << endl;
Multiple iterators can be used on the same list. If you add items to the list, existing iterators will remain valid. If you remove items from the list, iterators that point to the removed items will become dangling iterators.
Warning: Iterators on implicitly shared containers do not work exactly like STL-iterators. You should avoid copying a container while iterators are active on that container. For more information, read Implicit sharing iterator problem.
See also QLinkedList::iterator and QLinkedListIterator.
Member Function Documentation
const_iterator::const_iterator()
Default constructs an instance of const_iterator.
const_iterator::const_iterator(Node *n)
Default constructs an instance of const_iterator.
const_iterator::const_iterator(iterator ci)
Default constructs an instance of const_iterator.
const_iterator::const_iterator(const const_iterator &other)
Default constructs an instance of const_iterator.