|
|
The QQueue class is a template class that provides a queue. More...
#include <qqueue.h>
QQueue is implemented as a template class. Define a template instance QQueue<X> to create a queue that operates on pointers to X, or X*.
A queue is a First In, First Out (FIFO) structure. Items are added to the back of the queue with enqueue() and retrieved from the front with dequeue().
See also Collection Classes
Creates an empty queue.
Creates a queue from another.
Only the pointers are copied (shallow copy).
Destroys the list. Items in the list are destroyed if autoDelete() is TRUE.
Returns a reference to the front item in the queue. The queue is not changed.
The same as QCollection::autoDelete().
See also setAutoDelete().
[virtual]Removes all items from the queue, deleting them if if autoDelete() is TRUE.
See also remove().
Reimplemented from QCollection.
[virtual]Returns the number of items in the queue.
See also isEmpty().
Reimplemented from QCollection.
Returns a reference to the front item in the queue. The queue is not changed.
Takes the front item from the queue. First in, first out.
Adds an item to the back of the queue. First in, first out.
Returns a reference to the front item in the queue. The queue is not changed.
Returns TRUE if there are no items to be dequeued
Assigns queue to this queue and returns a reference to this queue.
This queue is first cleared, then each item in queue is enqueued to this queue. Only the pointers are copied (shallow copy).
Removes the front item from the queue. First in, first out. The item is deleted if autoDelete() is TRUE. Returns TRUE if there was an item to remove.
The same as QCollection::setAutoDelete().
See also autoDelete().
Search the documentation, FAQ, qt-interest archive and more (uses
www.trolltech.com):
This file is part of the Qt toolkit, copyright © 1995-2000 Trolltech, all rights reserved.
| Copyright İ 2000 Trolltech | Trademarks | Qt version 2.2.1
|