QueueImpl

Doubly-indexed queue, can be used as a FIFO or stack.

deprecated final

class QueueImpl (

T

OverflowPolicy overflowPolicy

) {

this(size_t initialCapacity);

bool isFull [@property getter];

size_t capacity [@property getter];

void pushBack(T x);

void pushFront(T x);

T popFront();

void clear();

size_t length();

T opIndex(size_t index);

Range opSlice();

Range opSlice(size_t i, size_t j);

}

Constructors

this this(size_t initialCapacity): Create a QueueImpl with specified initial capacity.

Members

Functions

back T back()
clear void clear(): Removes all items from the queue.
front T front()
length size_t length()
opIndex T opIndex(size_t index)
opSlice Range opSlice()
opSlice Range opSlice(size_t i, size_t j)
popBack T popBack(): Removes an item from the back of the queue.
popFront T popFront(): Removes an item from the front of the queue.
pushBack void pushBack(T x): Adds an item on the back of the queue.
pushFront void pushFront(T x): Adds an item on the front of the queue.

Properties

capacity size_t capacity [@property getter]
isFull bool isFull [@property getter]

Structs

Range struct Range: Undocumented in source.

Bugs

Doesn't call struct destructors, don't scan memory. You should probably only put POD types in them.

Meta

Source

See Implementation

gfm core queue classes

QueueImpl

templates