The OpenD Programming Language

DList.removeFront

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. void removeFront()
  2. size_t removeFront(size_t howMany)
    struct DList(T)
    size_t
    removeFront
    (
    size_t howMany
    )

Return Value

Type: size_t

The number of elements removed

Complexity: O(howMany).

Meta