1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
|
hi(remove_if)
itemization(
it() Header file: tt(<algorithm>)
it() Function prototype:
itemization(
itt(ForwardIterator remove_if(ForwardIterator first,
ForwardIterator last, UnaryPredicate pred);)
)
it() Description:
itemization(
it() The elements in the range pointed to by rangett(first, last)
are reordered such that all values for which the unary predicate tt(pred)
evaluates as tt(false) are placed at the beginning of the range, while their
relative order is kept. The returned forward iterator points to the
first element, after reordering, for which tt(pred) returns tt(true). The
range rangett(returnvalue, last) is called the em(leftover) of the
algorithm. The leftover may contain elements for which the predicate tt(pred)
returns tt(false), but these can safely be removed, as such elements are also
present in the range rangett(first, returnvalue). Such duplication is the
result of the fact that the algorithm em(copies), rather than em(moves)
elements into new locations.
)
it() Example:verbinclude(-a examples/removeif.cc)
)
|
