The OpenD Programming Language

SList.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.

  1. alias stableRemoveFront = removeFront
  2. alias stableRemoveFront = removeFront
    import std.container.slist;
    struct SList(T)
    alias stableRemoveFront = removeFront

Return Value

The number of elements removed

Complexity: O(howMany * log(n)).

Meta