Stl Quick Reference Card
ADVERTISEMENT
1
2
3
4
5
6
7
8STL Quick Reference – Version 1.29
1
April 20, 2007
[A4]
1
Notations
erase
S:iterator S::
(S::const iterator
first,
void
move x’s [xFirst,xLast) before pos
2.2.2
Members & Operators
post erased
S::const iterator
last);
splice
list::
(iterator
pos,
X::X();
The symbol
const
for const.
list
&
x,
T
push back
void S::
(
const
S::value type& x );
iterator
xFirst,
X::X(
const
X&);
The symbol
for function returned value.
pop back
void S::
();
iterator
xLast);
7.2
X::~X();
Template class parameters lead by outlined
ey
ompare
front
S::reference S::
();
remove
void list::
(
const
& value);
T
character. For example:
,
,
.
X& X::
operator
=
(
const
X&);
T
K
C
redicate
S::const reference S::
front
()
const
;
Interpreted in template definition context.
void list::
remove if
(
pred);
P
begin
X::iterator
X::
();
back
Sometimes class, typename dropped.
S::reference S::
();
X::const iterator
X::
begin
()
const
;
after call:
this iterator
= ( + 1)
unique
Template class parameters dropped,
end
back
void list::
();
remove repeats
X::iterator
X::
();
S::const reference S::
()
const
;
thus C sometimes used instead of C
.
end
const
T
X::const iterator
X::
()
;
void
as before but,
binPred(
( + 1))
inaryPredicate
2.4
Vector
X::reverse iterator
X::
rbegin
();
unique
list::
(
binPred);
B
“See example” by
, its output by
.
rbegin
X::const reverse iterator
X::
()
const
;
#include
vector
Assuming both this and x sorted
rend
X::reverse iterator
X::
();
void list::
merge
(list
& x );
T
2
Containers
template class
,
rend
const
T
X::const reverse iterator
X::
()
;
lloc
merge and assume sorted by cmp
ompare
class
=allocator
A
size
const
merge
X::size type
X::
()
;
void list::
(list
& x,
cmp);
T
C
vector
2.1
Pair
class
;
X::size type
X::
max size
()
const
;
reverse
void list::
();
empty
See also 2.2 and 2.3.
bool
X::
()
const
;
#include
utility
sort
void list::
();
swap
ompare
void
X::
(X& x);
capacity
const
size type vector::
()
;
sort
void list::
(
cmp);
C
template class
1, class
2
T
T
reserve
void vector::
(size type n);
clear
void X::
();
pair
struct
2.7
Sorted Associative
vector::reference
first
second
1
;
2
;
T
T
vector::
operator[ ]
(size type i);
2.2.3
Comparison Operators
Here A any of
pair()
vector::const reference
set, multiset, map, multimap .
pair(
const
1& a,
const
2& b):
T
T
Let,
X v, w. X may also be pair (2.1).
operator[ ]
const
vector::
(size type i)
;
first(a), second(b)
;
v
w
v
w
==
!=
2.7.1
Types
7.1.
v
w
v
w
<
>
2.1.1
Types
For A=[multi]set, columns are the same
v
w
v
w
2.5
Deque
<=
>=
A::
key type
A::
value type
first type
pair::
All done lexicographically and
bool.
#include
deque
keycompare
value compare
second type
A::
A::
pair::
template class
,
T
2.3
Sequence Containers
lloc
2.7.2
Constructors
2.1.2
Functions & Operators
class
=allocator
A
ompare
ompare
deque
A::A(
c=
())
class
;
C
C
See also 2.2.3.
S is any of vector, deque, list
pair
1,
2
T
T
A::A(A::const iterator
first,
Has all of vector functionality (see 2.4).
2.3.1
Constructors
A::const iterator
last,
make pair
const
const
(
1&,
2&);
T
T
ompare
ompare
void deque::
push front
(
const
& x );
T
c=
());
C
C
S::S(S::size type
n,
2.2
Containers — Common
pop front
void deque::
();
const
S::value type&
t);
2.7.3
Members
S::S(S::const iterator
first,
2.6
List
Here X is any of
key comp
const
A::keycompare
A::
()
;
S::const iterator
last);
7.2, 7.3
vector, deque, list,
value comp
const
#include
list
A::value compare
A::
()
;
set, multiset, map, multimap
2.3.2
Members
A::iterator
template class
,
T
2.2.1
Types
lloc
insert
A::
(A::iterator
hint,
S::iterator
inserted copy
class
=allocator
A
const
A::value type&
val);
insert
S::
(S::iterator
before,
list
class
;
value type
X::
const
S::value type&
val);
insert
void A::
(A::iterator
first,
reference
X::
See also 2.2 and 2.3.
A::iterator
last);
S::iterator
inserted copy
const reference
X::
pop front
void list::
();
insert
S::
(S::iterator
before,
A::size type
# erased
iterator
X::
S::size type
nVal,
A::
erase
(
const
A::key type& k );
push front
void list::
(
const
& x );
T
X::
const iterator
const
S::value type&
val);
void A::
erase
(A::iterator p);
void
move all x (&x = this) before pos
reverse iterator
X::
erase
void A::
(A::iterator
first,
S::iterator
inserted copy
splice
list::
(iterator pos, list
& x );
7.2
T
const reverse iterator
A::iterator
last);
X::
insert
S::
(S::iterator
before,
void
move x’s xElemPos before pos
difference type
S::const iterator
first,
X::
A::size type
splice
list::
(iterator
pos,
S::const iterator
last);
count
A::
(
const
A::key type& k )
const
;
size type
X::
list
&
x,
T
erase
find
const
const
Iterators reference value type (See 6).
S:iterator S::
(S::iterator position);
A::iterator A::
(
A::key type& k )
;
iterator
xElemPos);
7.2
Yotam Medini c 1998-2007
ADVERTISEMENT
0 votes
Related Articles
Related forms
Related Categories
Parent category: Education