std.container.dlist.d_list.stable_remove_front - multiple declarations
- Alias DList.stableRemoveFront
- Alias DList.stableRemoveFront
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.
Declaration
struct DList
{
// ...
alias stableRemoveFront = removeFront;
// ...
}
Returns
The number of elements removed
Complexity
Ο(howMany).
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.
Declaration
struct DList
{
// ...
alias stableRemoveFront = removeFront;
// ...
}
Precondition
Complexity
Ο(1).
Authors
Steven Schveighoffer, Andrei Alexandrescu
License
Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at ).