DList.removeBack - multiple declarations

Function DList.removeBack

Removes the front or back element.

void removeBack();

Precondition

!empty

Example

DList!int l;

l.insertFront(8);
l.insertFront(9);
assert(l.front == 9);
l.removeFront();
assert(l.front == 8);
l.removeFront();
assert(l.empty);

Example

auto l = DList!int([9, 8]);

assert(l.back == 8);
l.removeBack();
assert(l.back == 9);
l.removeFront();
assert(l.empty);

Function DList.removeBack

Removes howMany elements from the list.

size_t removeBack (
  size_t howMany
);

Unlike removeFront() and removeBack(), this method doesn't fail, if it could not remove howMany elements. Instead, if howMany is greater than the list length, all elements are removed.

Parameters

NameDescription
howMany How many elements should be removed.

Returns

The number of elements removed.

Example

DList!int l = DList!int([8, 5, 4]);

assert(l.removeFront(0) == 0);
assert(l.removeFront(2) == 2);
assert(l.removeFront(3) == 1);
assert(l.removeFront(3) == 0);

Example

DList!int l = DList!int([8, 5, 4]);

assert(l.removeBack(0) == 0);
assert(l.removeBack(2) == 2);
assert(l.removeBack(3) == 1);
assert(l.removeBack(3) == 0);