Queue

class mono::Queue

A pointer based FIFO style Queue.

See

GenericQueue

Subclassed by mono::GenericQueue< mono::redpine::ManagementFrame >, mono::GenericQueue< mono::TouchResponder >, mono::GenericQueue< mono::ui::View >, mono::GenericQueue< Item >

Public Functions

void Enqueue(IQueueItem *item)

Add a new element to the back of the queue Insert a pointer to an element on the back of the queue.

IQueueItem *Dequeue()

Returns and removes the oldest element in the queue.

IQueueItem *Peek()

Return the oldest element in the queue, without removing it.

IQueueItem *Next(IQueueItem *item)

Get the next element in the queue, after the one you provide.

NOTE: There is no check if the item belongs in the parent queue at all!

Return

The next element in the queue, after the item you provided.

Parameters

• item -

  A pointer to an item in the queue

bool Exists(IQueueItem *item)

Check that an object already exists in the queue. Because of the stack based nature of this queue, all objects can only exist one replace in the queue. You cannot add the same object to two different positions in the queue.

Parameters

• item -

  The element to search for in the queue