Stl Quick Reference Card (Page 2 of 8) in pdf

STL Quick Reference – Version 1.29

April 20, 2007

[A4]

2.10.2

Members

A::iterator

multimap::const iterator

void

ontainer

lower bound

push

A::

(

const

A::key type& k )

const

;

multimap::

(

queue::

(

const

::value type& x);

map

const

multimap::key type& k )

const

;

(

pop

A::iterator

void queue::

();

ompare

ontainer

A::

upper bound

(

const

A::key type& k )

const

;

const

& cmp=

());

multimap::const iterator

const

::value type&

upper bound

multimap::

(

pair A::iterator, A::iterator

see 4.3.1

pair map::iterator, bool

bool = if new

front

const

queue::

()

;

const

multimap::key type& k )

;

insert

ontainer

A::

equal range

(

const

A::key type& k )

const

;

map::

(

const

map::value type& x );

front

pair multimap::const iterator,

::value type& queue::

();

ontainer

operator[ ]

map:

(

const

map::key type&);

multimap::const iterator

const

::value type&

2.8

Set

equal range

multimap::

(

map::const iterator

queue::

back

()

const

;

const

multimap::key type& k )

const

;

lower bound

map::

(

ontainer

back

#include

set

::value type& queue::

();

const

map::key type& k )

;

Comparision Operators

Container Adaptors

map::const iterator

template class

ompare

upper bound

map::

(

bool

operator

= =

(

const

queue& q0,

class

=less

const

map::key type& k )

;

lloc

const

queue& q1);

class

=allocator

3.1

Stack Adaptor

pair map::const iterator, map::const iterator

operator

const

bool

(

queue& q0,

set

class

;

equal range

map::

(

const

queue& q1);

#include

stack

See also 2.2 and 2.7.

ompare

const

map::key type& k )

;

3.3

Priority Queue

set

(

const

& cmp=

());

template class

Example

ontainer

pair set::iterator, bool

bool = if new

class

=deque

#include

queue

insert

set::

(

const

set::value type& x );

stack

class

;

typedef map<string, int> MSI;

MSI

nam2num;

ontainer

Default constructor.

must have

template class

nam2num.insert(MSI::value_type("one", 1));

2.9

Multiset

ontainer

back(), push back(), pop back(). So vector,

nam2num.insert(MSI::value_type("two", 2));

class

=vector

ompare

list and deque can be used.

nam2num.insert(MSI::value_type("three", 3));

#include

multiset.h

class

=less

int n3 = nam2num["one"] + nam2num["two"];

bool stack::

empty

()

const

;

priority queue

class

;

cout << n3 << " called ";

ontainer

template class

size

ontainer

::size type stack::

()

const

;

ompare

for (MSI::const_iterator i = nam2num.begin();

must provide random access iterator

class

=less

i != nam2num.end();

++i)

lloc

void

ontainer

and have empty(), size(), front(), push back()

class

=allocator

if ((*i).second == n3)

push

const

stack::

(

::value type& x);

and pop back(). So vector and deque can be

multiset

{cout << (*i).first << endl;}

class

;

pop

used.

void stack::

();

ontainer

3 called three

Mostly implemented as heap.

See also 2.2 and 2.7.

const

::value type&

top

stack::

()

const

;

multiset

(

ompare

2.11

Multimap

3.3.1

Constructors

ontainer

const

& cmp=

());

top

void

::value type& stack::

();

multiset

(

explicit

priority queue::priority queue

(

Comparision Operators

#include

multimap.h

nputIterator

ompare

ﬁrst,

const

& comp=

());

nputIterator

operator

bool

= =

(

const

stack& s0,

last,

template class

, class

priority queue::priority queue

const

stack& s1);

(

ompare

nputIterator

const

cmp=

());

class

=less

ﬁrst,

operator

const

lloc

bool

(

stack& s0,

nputIterator

class

=allocator

const

stack& s1);

last,

multiset::iterator

inserted copy

ompare

multimap

class

;

insert

multiset::

(

const

multiset::value type& x );

const

comp=

());

3.2

Queue Adaptor

See also 2.2 and 2.7.

3.3.2

Members

2.10

Map

#include

queue

2.11.1

Types

empty

bool priority queue::

()

const

;

#include

map

ontainer

::size type

value type

const

multimap::

pair

template class

size

const

priority queue::

()

;

ontainer

template class

, class

ompare

ontainer

class

=deque

class

=less

const

::value type&

2.11.2

Members

lloc

queue

class

;

top

priority queue::

()

const

;

class

=allocator

ontainer

class

map

;

multimap

(

Default constructor.

must have

::value type& priority queue::

top

();

ompare

empty(), size(), back(), front(), push back()

const

& cmp=

());

See also 2.2 and 2.7.

push

void priority queue::

(

and

. So list and deque can be

ontainer

multimap

(

const

::value type& x);

used.

nputIterator

2.10.1

Types

ﬁrst,

void priority queue::

pop

();

nputIterator

empty

bool queue::

()

const

;

last,

ontainer

ompare

No comparision operators.

value type

const

size

const

map::

pair

::size type queue::

()

;

const

cmp=

());

Yotam Medini c 1998-2007

Stl Quick Reference Card Page 2

Related Articles

Related forms

Related Categories