DList

Double linked list

struct DList (

T

Allocator = Mallocator

bool GCRangesAllowed = true

) {

struct Node(T);

Range range();

ulong length();

alias insertBack = insert_last;

Node!T* insert_last(T v);

alias insertFront = insert_first;

Node!T* insert_first(T v);

void clear();

bool popFront();

bool popBack();

bool remove(Node!T* n);

void move_to_tail(Node!T* n);

void move_to_head(Node!T* n);

alias front = head;

Node!T* head();

alias back = tail;

Node!T* tail();

}

Destructor

~this ~this(): Undocumented in source.

Postblit

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

Members

Aliases

back alias back = tail: Undocumented in source.
front alias front = head: Undocumented in source.
insertBack alias insertBack = insert_last: insert item at list back.
insertFront alias insertFront = insert_first: insert item at list front

Functions

clear void clear(): remove all items from list
head Node!T* head(): head node
insert_first Node!T* insert_first(T v): insert item at list front
insert_last Node!T* insert_last(T v): insert item at list back.
length ulong length(): Number of items in list
move_to_head void move_to_head(Node!T* n): move to head
move_to_tail void move_to_tail(Node!T* n): move node to tail
popBack bool popBack(): pop last item.
popFront bool popFront(): pop front item.
range Range range(): Iterator over items
remove bool remove(Node!T* n): remove node by pointer. (safe until pointer is correct)
tail Node!T* tail(): Tail node

Structs

Node struct Node(T)

Meta

Source

See Implementation

cachetools containers lists structs