Stl Quick Reference Card Page 3
ADVERTISEMENT
1
2
3
4
5
6
7
8STL Quick Reference – Version 1.29
3
April 20, 2007
[A4]
utputIterator
orwardIterator
4
Algorithms
1
2
bi-pointing to first binPred-mismatch
= bop(
)
as above but using pred
O
F
nputIterator
nputIterator
nputIterator
orwardIterator
pair
1,
2
I
I
transform
remove if
(
first,
(
1
first1,
F
I
nputIterator
nputIterator
orwardIterator
mismatch
(
1
first1,
I
last,
1
last1,
F
#include
algorithm
I
nputIterator
nputIterator
redicate
1
last1,
I
2
first2,
pred);
I
P
nputIterator
utputIterator
STL algorithms use iterator type parameters.
utputIterator
2
first2,
I
result,
O
inaryPredicate
Their names suggest their category (See 6.1).
inaryOperation
past last copied
O
nputIterator
binPred);
B
bop);
B
remove copy
(
first,
For abbreviation, the clause —
I
nputIterator
oo
bool
orwardIterator
last,
nputIterator
I
utputIterator
is dropped. The
void
replace
(
first,
template class
F
, ...
F
equal
(
1
first1,
orwardIterator
I
result,
nputIterator
O
last,
F
outlined leading character can suggest the
1
last1,
I
const
&
value);
T
nputIterator
const
&
oldVal,
template context.
T
utputIterator
2
first2);
I
as above but using pred
const
&
newVal);
O
T
Note:
When looking at two sequences:
nputIterator
bool
remove copy if
nputIterator
(
first,
= [first
last
) and
= [first
?) or
I
1
1
1
2
2
nputIterator
equal
(
1
first1,
void
I
= [? last
) — caller is responsible that
nputIterator
orwardIterator
last,
2
2
I
utputIterator
1
last1,
replace if
function will not overflow
.
(
first,
I
F
2
nputIterator
orwardIterator
result,
O
redicate
2
first2,
last,
I
F
inaryPredicate
redicate
pred);
P
binPred);
&
pred,
B
P
4.1
Query Algorithms
unique
All variants of
template functions
const
&
newVal);
T
[first
last
)
[first
last
)
unction
remove consecutive (binPred-) duplicates. Thus
2
2
1
1
orwardIterator
f not changing [first, last)
utputIterator
F
usefull after sort (See 4.3).
1
nputIterator
F
orwardIterator
result
+ #[first last)
orwardIterator
O
for each
(
first,
2
I
nputIterator
search
(
1
first1,
nputIterator
F
[
,last) gets repetitions
F
orwardIterator
replace copy
(
first,
orwardIterator
I
last,
I
nputIterator
1
last1,
unction
F
unique
(
first,
F
orwardIterator
last,
orwardIterator
I
f );
7.4
F
utputIterator
2
first2,
F
last);
F
orwardIterator
nputIterator
result,
O
orwardIterator
2
last2);
first i so i==last or *i==val
F
I
nputIterator
const
&
oldVal,
as above but using binPred
T
F
orwardIterator
find
(
first,
I
[first
last
)
binPred [first
last
)
unique
nputIterator
2
2
1
1
const
&
newVal);
(
first,
orwardIterator
T
F
orwardIterator
last,
I
1
F
last,
orwardIterator
utputIterator
F
inaryPredicate
const
val);
7.2
T
search
as above but using pred
(
1
first1,
O
F
binPred);
orwardIterator
nputIterator
B
nputIterator
replace copy if
utputIterator
1
last1,
(
first,
F
I
first i so i==last or pred(i)
I
orwardIterator
nputIterator
past last copied
nputIterator
O
nputIterator
2
first2,
last,
F
I
find if
(
first,
I
orwardIterator
utputIterator
unique copy
(
first,
nputIterator
I
nputIterator
2
last2,
result,
F
O
last,
I
inaryPredicate
redicate
last,
redicate
I
utputIterator
binPred);
&
pred,
B
P
pred);
7.7
P
result,
O
const
orwardIterator
&
newVal);
T
const
4.2
Mutating Algorithms
&
result);
first duplicate
T
F
orwardIterator
orwardIterator
utputIterator
adjacent find
(
first,
fill
F
void
(
first,
F
as above but using binPred
O
orwardIterator
utputIterator
orwardIterator
nputIterator
last);
F
first
+ (last
first
)
last,
unique copy
O
F
(
first,
2
1
1
I
nputIterator
nputIterator
orwardIterator
copy
const
(
first1,
&
value);
I
T
last,
I
first binPred-duplicate
nputIterator
F
utputIterator
orwardIterator
last1,
orwardIterator
I
result,
adjacent find
O
(
first,
utputIterator
F
inaryPredicate
orwardIterator
void
fill n
(
first,
F
first2);
O
ize
binPred);
B
last,
F
inaryPredicate
n,
S
last
(last
first
)
binPred);
void
B
2
1
1
idirectionalIterator
const
&
value);
idirectionalIterator
T
2
reverse
B
(
first,
B
void
n = # equal val
idirectionalIterator
orwardIterator
copy backward
(
void
by calling gen()
last);
B
count
idirectionalIterator
(
first,
F
orwardIterator
orwardIterator
utputIterator
1
first1,
B
generate
(
first,
F
idirectionalIterator
last,
past last copied
F
orwardIterator
O
idirectionalIterator
1
last1,
B
last,
F
const
idirectionalIterator
reverse copy
val,
(
first,
T
enerator
B
ize
idirectionalIterator
2
last2);
B
gen);
G
&
n);
last,
S
B
utputIterator
swap
void
(
& x,
& y);
T
T
result);
O
void
n = # satisfying pred
void
n calls to gen()
orwardIterator
orwardIterator
orwardIterator
count if
2
first
+ #[first
last
)
void
with first moved to middle
(
first,
F
generate n
F
(
first,
2
1
1
F
orwardIterator
orwardIterator
orwardIterator
ize
swap ranges
rotate
last,
(
1
first1,
(
first,
F
F
F
n,
orwardIterator
S
redicate
orwardIterator
enerator
pred,
1
last1,
middle,
P
F
F
gen);
orwardIterator
G
ize
orwardIterator
&
n);
2
first2);
last);
S
F
F
All variants of
remove
and
unique
return
utputIterator
utputIterator
iterator to new end or past last copied.
bi-pointing to first !=
result + (last
first
)
first to middle position
O
O
1
1
nputIterator
nputIterator
nputIterator
orwardIterator
orwardIterator
pair
1,
2
transform
(
first,
[
,last) is all value
rotate copy
(
first,
I
I
I
F
F
nputIterator
nputIterator
orwardIterator
orwardIterator
mismatch
remove
(
1
first1,
last,
(
first,
middle,
I
I
F
F
nputIterator
utputIterator
orwardIterator
orwardIterator
1
last1,
result,
last,
last,
I
O
F
F
nputIterator
naryOperation
utputIterator
2
first2);
op);
7.6
const
&
value);
result);
I
U
T
O
Yotam Medini c 1998-2007
ADVERTISEMENT
0 votes
Related Articles
Related forms
Related Categories
Parent category: Education