Doubly-linked list/Definition: Difference between revisions

 

=={{header|D}}==

{

Node!(T) head, tail;

/** Iterate in the forward direction. */

int opApply (int delegate(uint, Node!(T)) dg)

return result;

}

static LinkedList!(T) fromArray (T[] array)

{

LinkedList!(T) parent;

T value;

this (Node!(T) next, Node!(T) previous, T value, LinkedList!(T) parent)

in

this.value = value;

this.parent = parent;

if (parent.head == next)

parent.head = this;

parent.tail = this;

}

/** Insert an element after this one. */

void insertAfter (T value)

{

}

/** Insert an element before this one. */

void insertBefore (T value)

{

}

/** Remove the current node from the list. */

void remove ()

void main ()

{

for (auto elem = list.head; elem; elem = elem.next)

{