55 return _queue[queue].empty();
73 _queue[queue].push_back(&q);
74 std::list<Queueable *>::iterator ref = --
_queue[queue].end();
82 const std::list<Queueable *>::iterator &ref) {
94 for (std::list<Queueable *>::iterator q =
_queue[queue].begin();
95 q !=
_queue[queue].end(); ++q)
96 (*q)->kickedOut(queue);
The graphics queue manager.
std::list< Queueable * >::iterator addToQueue(QueueType queue, Queueable &q)
std::list< Queueable * > _queue[kQueueMAX]
void lockQueue(QueueType queue)
void sortQueue(QueueType queue)
Common::Mutex _queueMutex[kQueueMAX]
#define DECLARE_SINGLETON(T)
Note that you need to use this macro from the global namespace.
const std::list< Queueable * > & getQueue(QueueType queue) const
static bool queueComp(Queueable *a, Queueable *b)
The graphics queue manager.
Convenience class that locks a mutex on creation and unlocks it on destruction.
void unlockQueue(QueueType queue)
void removeFromQueue(QueueType queue, const std::list< Queueable *>::iterator &ref)
An object that can be stored in a queue.
void clearQueue(QueueType queue)
bool isQueueEmpty(QueueType queue)