List

Queue that supports recursive data definitions.

struct List (

T

) {

void insert(T element);

void removeFront();

bool empty [@property getter];

inout(T) front [@property getter];

inout(T) back [@property getter];

Range!T opIndex();

void clear();

}

Members

Functions

clear void clear(): Remove all elements.
insert void insert(T element): Appends element to the list.
opIndex Range!T opIndex()
removeFront void removeFront(): Remove the first element.

Properties

back inout(T) back [@property getter]
empty bool empty [@property getter]
front inout(T) front [@property getter]

Meta

Source

See Implementation

cogito list structs