1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
|
hi(partition) hi(stable_partition) hi(partition_point)
itemization(
it() Header file: tt(<algorithm>)
it() Function prototype:
itemization(
itt(BidirectionalIterator partition([ExecPol,]
BidirectionalIterator first, BidirectionalIterator last,
UnaryPredicate pred);)
itt(BidirectionalIterator stable_partition([ExecPol,]
BidirectionalIterator first, BidirectionalIterator last, UnaryPredicate
pred);)
itt(ForwardIterator partition_point( ForwardIterator first,
ForwardIterator last, UnaryPredicate pred );)
)
it() Description:
itemization(
it() The first prototype: all elements in the range rangett(first,
last) for which the unary predicate tt(pred) evaluates as tt(true) are placed
before the elements which evaluate as tt(false).
it() The second prototype: identical to the first prototype, but
the relative order of all elements for which the predicate evaluates to
tt(false) and the relative order of all elements for which the predicate
evaluates to tt(true) is kept.
it() The third prototype: does not reorder the elements in the
rangett(first, last) range, but returns an iterator to the first element for
which tt(pred) returns tt(false). If tt(pred) returns tt(true) for all
elements then tt(last) is returned.
)
The return value points just beyond the last element in the
partitioned range for which tt(pred) evaluates as tt(true).
it() Example:
verbinclude(-a examples/partition.cc)
)
|
