|
template<typename T > |
T::iterator | erase (T &x, typename T::iterator f, typename T::iterator l) |
|
template<typename T , typename R > |
T::iterator | erase (T &x, const R &r) |
|
template<typename T > |
T::iterator | erase (T &x, typename T::iterator f) |
|
template<typename T , typename P > |
void | erase_if (T &x, typename T::iterator f, typename T::iterator l, P p) |
|
template<typename T , typename P > |
void | erase_if (T &x, P p) |
|
The current erase
member function on containers does not have a uniform interface. The erase
algorithm here provides a normalized interface to erase on all containers.
The erase_if
algorithm erases any value from the container (within the optionally supplied range) which satisfies the predicate. The erase is handled efficiently for any container type.
- Complexity Guarantees:
- Linear. Exactly
last - first
applications of pred
.
§ erase() [1/3]
T::iterator adobe::erase |
( |
T & |
x, |
|
|
typename T::iterator |
f, |
|
|
typename T::iterator |
l |
|
) |
| |
§ erase() [2/3]
T::iterator adobe::erase |
( |
T & |
x, |
|
|
const R & |
r |
|
) |
| |
§ erase() [3/3]
T::iterator adobe::erase |
( |
T & |
x, |
|
|
typename T::iterator |
f |
|
) |
| |
§ erase_if() [1/2]
void adobe::erase_if |
( |
T & |
x, |
|
|
typename T::iterator |
f, |
|
|
typename T::iterator |
l, |
|
|
P |
p |
|
) |
| |
§ erase_if() [2/2]
void adobe::erase_if |
( |
T & |
x, |
|
|
P |
p |
|
) |
| |