Menu
Search

API Documentation

version 2.098.0

overview

View source code
Display the source code in std/container/dlist.d from which this page was generated on github.
Report a bug
If you spot a problem with this page, click here to create a Bugzilla issue.
Improve this page
Quickly fork, edit online, and submit a pull request for this page. Requires a signed-in GitHub account. This works well for small changes. If you'd like to make larger changes you may want to consider using local clone.

std.container.dlist.DList.stableRemoveFront - multiple declarations

Alias DList.stableRemoveFront

Removes the value at the front/back of the container. The stable version behaves the same, but guarantees that ranges iterating over the container are never invalidated.

struct DList
{
  // ...
  alias stableRemoveFront = removeFront;
  // ...
}

Precondition

!empty

Complexity

Ο(1).

Alias DList.stableRemoveFront

Removes howMany values at the front or back of the container. Unlike the unparameterized versions above, these functions do not throw if they could not remove howMany elements. Instead, if howMany > n, all elements are removed. The returned value is the effective number of elements removed. The stable version behaves the same, but guarantees that ranges iterating over the container are never invalidated.

struct DList
{
  // ...
  alias stableRemoveFront = removeFront;
  // ...
}

Returns

The number of elements removed

Complexity

Ο(howMany).

Authors

Andrei Alexandrescu

License

Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at ).