|qmake:||QT += core|
Note: All functions in this class are reentrant.
- 78 public functions inherited from QList
Additional Inherited Members
- 3 static public members inherited from QList
The QQueue class is a generic container that provides a queue.
A queue is a first in, first out (FIFO) structure. Items are added to the tail of the queue using enqueue() and retrieved from the head using dequeue(). The head() function provides access to the head item without removing it.
QQueue<int> queue; queue.enqueue(1); queue.enqueue(2); queue.enqueue(3); while (!queue.isEmpty()) cout << queue.dequeue() << endl;
The example will output 1, 2, 3 in that order.
QQueue inherits from QList. All of QList's functionality also applies to QQueue. For example, you can use isEmpty() to test whether the queue is empty, and you can traverse a QQueue using QList's iterator classes (for example, QListIterator). But in addition, QQueue provides three convenience functions that make it easy to implement FIFO semantics: enqueue(), dequeue(), and head().
Member Function Documentation
Removes the head item in the queue and returns it. This function assumes that the queue isn't empty.
This is the same as QList::takeFirst().
Adds value t to the tail of the queue.
This is the same as QList::append().
Returns a reference to the queue's head item. This function assumes that the queue isn't empty.
This is the same as QList::first().
This is an overloaded function.
void QQueue::swap(QQueue<T> &other)
Swaps queue other with this queue. This operation is very fast and never fails.
This function was introduced in Qt 4.8.
© 2019 The Qt Company Ltd. Documentation contributions included herein are the copyrights of their respective owners. The documentation provided herein is licensed under the terms of the GNU Free Documentation License version 1.3 as published by the Free Software Foundation. Qt and respective logos are trademarks of The Qt Company Ltd. in Finland and/or other countries worldwide. All other trademarks are property of their respective owners.