Queue

Simple queue implemented as a singly linked list with a tail pointer.

Needed in some D:YAML code that needs a queue-like structure without too much reallocation that goes with an array.

Allocations are non-GC and are damped by a free-list based on the nodes that are removed. Note that elements lifetime must be managed outside.

Destructor

A destructor is present on this object, but not explicitly documented in the source.

Postblit

Copying this object is disabled.

A postblit is present on this object, but not explicitly documented in the source.

Members

Functions

empty
bool empty()
insert
void insert(T item, const size_t idx)

Insert a new item putting it to specified index in the linked list.

iterationOver
bool iterationOver()
length
size_t length()
next
const(T) next()
peek
inout(T) peek()
pop
T pop()
push
void push(T item)

Push a new item to the queue.

startIteration
void startIteration()

Start iterating over the queue.

Meta