SList

A singly linked list based on theAllocator from std.experimental.allocator.

struct SList (

T

) {

bool empty();

void popFront();

void insertFront(T value);

void popBack();

void insertBack(T value);

size_t removeAll(T value);

void clear();

auto opSlice();

}

Destructor

~this ~this(): Undocumented in source.

Postblit

this(this) this(this): Undocumented in source.

Members

Functions

back T back(): Get the back element or throw an error if the list is empty. Part of the bidirectional range interface.
clear void clear()
empty bool empty(): A boolean property indicating whether there are list items. Part of the bidirectional range interface.
front T front(): Get the front element or throw an error if the list is empty. Part of the bidirectional range interface.
insertBack void insertBack(T value)
insertFront void insertFront(T value)
opSlice auto opSlice()
popBack void popBack(): Pop the back element or throw an error if the list is empty. Part of the bidirectional range interface.
popFront void popFront(): Pop the front element or throw an error if the list is empty. Part of the bidirectional range interface.
removeAll size_t removeAll(T value): Remove all occurrences of a given value.
save auto save(): Copies the list to allow multiple range-like iteration. Part of the bidirectional range interface.

Parameters

T: The type of the list items.

Meta

Source

See Implementation

subscribed slist classes

SListException

structs

SList