Queue

FCFS container

struct Queue (

T

) {

size_t length [@property getter];

bool empty [@property getter];

T front [@property getter];

this(T[] vals);

Queue!T opOpAssign(T b);

void limitLength(size_t len);

void push(T[] vals);

void clear();

string toString();

T[] toArray();

}

Constructors

this this(T[] vals): Creates queue filled with vals

Members

Functions

clear void clear(): Removes all elements from queue
limitLength void limitLength(size_t len): Limits length of queue, default is -1 which is limitless. If length is limited and new element is attempted to be pushed when Queue is overfilled nothing will happen.
opOpAssign Queue!T opOpAssign(T b): opOpAssign x += y == x.push(y)
pop T pop(): Returns first value and removes it from queue
push void push(T[] vals): Adds vals at end of queue
toArray T[] toArray(): Undocumented in source. Be warned that the author may not have intended to support it.
toString string toString(): Undocumented in source. Be warned that the author may not have intended to support it.

Properties

empty bool empty [@property getter]: Is queue empty
front T front [@property getter]: Returns first value without removing it from queue
length size_t length [@property getter]: Length of queue

Meta

Source

See Implementation

sily queue structs

Queue