View source code
Display the source code in std/container/array.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.array.Array.removeBack - multiple declarations

Function Array.removeBack

Removes the value from the back of the array. Both stable and non-stable versions behave the same and guarantee that ranges iterating over the array are never invalidated.

void removeBack();

Precondition

empty == false

Complexity

Ο(1).

Throws

Exception if the array is empty.

Function Array.removeBack

Removes howMany values from the back of the array. 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. Both stable and non-stable versions behave the same and guarantee that ranges iterating over the array are never invalidated.

size_t removeBack (
  size_t howMany
);

Returns

The number of elements removed.

Complexity

Ο(howMany).

Function Array.removeBack

Removes the value from the back of the array. Both stable and non-stable versions behave the same and guarantee that ranges iterating over the array are never invalidated.

void removeBack();

Precondition

empty == false

Complexity

Ο(1).

Throws

Exception if the array is empty.

Function Array.removeBack

Removes howMany values from the back of the array. 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. Both stable and non-stable versions behave the same and guarantee that ranges iterating over the array are never invalidated.

size_t removeBack (
  size_t howMany
);

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