map Class Reference

#include <stdapis/stlport/stl/_map.h>

Link against: hswidgetpublisher.lib

class map

Nested Classes and Structures

Public Member Type Definitions
typedef map< _Key, _Tp, _Compare, _Alloc > _Self
typedef _Rep_type::allocator_type allocator_type
typedef _Rep_type::const_iterator const_iterator
typedef _Rep_type::const_pointer const_pointer
typedef _Rep_type::const_reference const_reference
typedef_Rep_type::const_reverse_iterator const_reverse_iterator
typedef_Tp data_type
typedef _Rep_type::difference_type difference_type
typedef _Rep_type::iterator iterator
typedef_Compare key_compare
typedef_Key key_type
typedef_Tp mapped_type
typedef _Rep_type::pointer pointer
typedef _Rep_type::reference reference
typedef_Rep_type::reverse_iterator reverse_iterator
typedef _Rep_type::size_type size_type
typedef pair< const _Key, _Tp > value_type
Public Member Functions
map()
map(const _Compare &, const allocator_type &)
map(const value_type *, const value_type *)
map(const value_type *, const value_type *, const _Compare &, const allocator_type &)
map(const_iterator, const_iterator)
map(const_iterator, const_iterator, const _Compare &, const allocator_type &)
map(const map< _Key, _Tp, _Compare, _Alloc > &)
iterator begin()
const_iterator begin()
voidclear()
size_type count(const key_type &)
boolempty()
iterator end()
const_iterator end()
pair< iterator, iterator >equal_range(const key_type &)
pair< const_iterator, const_iterator >equal_range(const key_type &)
voiderase(iterator)
size_type erase(const key_type &)
voiderase(iterator, iterator)
iterator find(const key_type &)
const_iterator find(const key_type &)
allocator_type get_allocator()
pair< iterator, bool >insert(const value_type &)
iterator insert(iterator, const value_type &)
voidinsert(const value_type *, const value_type *)
voidinsert(const_iterator, const_iterator)
key_compare key_comp()
iterator lower_bound(const key_type &)
const_iterator lower_bound(const key_type &)
size_type max_size()
map< _Key, _Tp, _Compare, _Alloc > &operator=(const map< _Key, _Tp, _Compare, _Alloc > &)
_Tp &operator[](const key_type &)
reverse_iterator rbegin()
const_reverse_iterator rbegin()
reverse_iterator rend()
const_reverse_iterator rend()
size_type size()
voidswap(map< _Key, _Tp, _Compare, _Alloc > &)
iterator upper_bound(const key_type &)
const_iterator upper_bound(const key_type &)
value_compare value_comp()

Member Type Definition Documentation

Typedef _Self

typedef map< _Key, _Tp, _Compare, _Alloc >_Self

Typedef allocator_type

typedef _Rep_type::allocator_type allocator_type

Typedef const_iterator

typedef _Rep_type::const_iterator const_iterator

Typedef const_pointer

typedef _Rep_type::const_pointer const_pointer

Typedef const_reference

typedef _Rep_type::const_reference const_reference

Typedef const_reverse_iterator

typedef _Rep_type::const_reverse_iteratorconst_reverse_iterator

Typedef data_type

typedef _Tpdata_type

Typedef difference_type

typedef _Rep_type::difference_type difference_type

Typedef iterator

typedef _Rep_type::iterator iterator

Typedef key_compare

typedef _Comparekey_compare

Typedef key_type

typedef _Keykey_type

Typedef mapped_type

typedef _Tpmapped_type

Typedef pointer

typedef _Rep_type::pointer pointer

Typedef reference

typedef _Rep_type::reference reference

Typedef reverse_iterator

typedef _Rep_type::reverse_iteratorreverse_iterator

Typedef size_type

typedef _Rep_type::size_type size_type

Typedef value_type

typedef pair< const _Key, _Tp >value_type

Constructor & Destructor Documentation

map ( )

__WORKAROUND_RENAME()map()[inline]

map ( const _Compare &, const allocator_type & )

__WORKAROUND_RENAME()map(const _Compare &__comp,
const allocator_type &__a =  allocator_type()
)[inline, explicit]

map ( const value_type *, const value_type * )

__WORKAROUND_RENAME()map(const value_type *__first,
const value_type *__last
)[inline]

map ( const value_type *, const value_type *, const _Compare &, const allocator_type & )

__WORKAROUND_RENAME()map(const value_type *__first,
const value_type *__last,
const _Compare &__comp,
const allocator_type &__a =  allocator_type()
)[inline]

map ( const_iterator, const_iterator )

__WORKAROUND_RENAME()map(const_iterator__first,
const_iterator__last
)[inline]

map ( const_iterator, const_iterator, const _Compare &, const allocator_type & )

__WORKAROUND_RENAME()map(const_iterator__first,
const_iterator__last,
const _Compare &__comp,
const allocator_type &__a =  allocator_type()
)[inline]

map ( const map< _Key, _Tp, _Compare, _Alloc > & )

__WORKAROUND_RENAME()map(const map< _Key, _Tp, _Compare, _Alloc > &__x)[inline]

Member Function Documentation

begin ( )

iterator begin()[inline]

begin ( )

const_iterator begin()const [inline]

clear ( )

voidclear()[inline]

count ( const key_type & )

size_type count(const key_type &__x)const [inline]

empty ( )

boolempty()const [inline]

end ( )

iterator end()[inline]

end ( )

const_iterator end()const [inline]

equal_range ( const key_type & )

pair< iterator, iterator >equal_range(const key_type &__x)[inline]

equal_range ( const key_type & )

pair< const_iterator, const_iterator >equal_range(const key_type &__x)const [inline]

erase ( iterator )

voiderase(iterator__position)[inline]

erase ( const key_type & )

size_type erase(const key_type &__x)[inline]

erase ( iterator, iterator )

voiderase(iterator__first,
iterator__last
)[inline]

find ( const key_type & )

iterator find(const key_type &__x)[inline]

find ( const key_type & )

const_iterator find(const key_type &__x)const [inline]

get_allocator ( )

allocator_type get_allocator()const [inline]

insert ( const value_type & )

pair< iterator, bool >insert(const value_type &__x)[inline]

insert ( iterator, const value_type & )

iterator insert(iteratorposition,
const value_type &__x
)[inline]

insert ( const value_type *, const value_type * )

voidinsert(const value_type *__first,
const value_type *__last
)[inline]

insert ( const_iterator, const_iterator )

voidinsert(const_iterator__first,
const_iterator__last
)[inline]

key_comp ( )

key_compare key_comp()const [inline]

lower_bound ( const key_type & )

iterator lower_bound(const key_type &__x)[inline]

lower_bound ( const key_type & )

const_iterator lower_bound(const key_type &__x)const [inline]

max_size ( )

size_type max_size()const [inline]

operator= ( const map< _Key, _Tp, _Compare, _Alloc > & )

map< _Key, _Tp, _Compare, _Alloc > &operator=(const map< _Key, _Tp, _Compare, _Alloc > &__x)[inline]

operator[] ( const key_type & )

_Tp &operator[](const key_type &__k)[inline]

rbegin ( )

reverse_iterator rbegin()[inline]

rbegin ( )

const_reverse_iterator rbegin()const [inline]

rend ( )

reverse_iterator rend()[inline]

rend ( )

const_reverse_iterator rend()const [inline]

size ( )

size_type size()const [inline]

swap ( map< _Key, _Tp, _Compare, _Alloc > & )

voidswap(map< _Key, _Tp, _Compare, _Alloc > &__x)[inline]

upper_bound ( const key_type & )

iterator upper_bound(const key_type &__x)[inline]

upper_bound ( const key_type & )

const_iterator upper_bound(const key_type &__x)const [inline]

value_comp ( )

value_compare value_comp()const [inline]
© Nokia 2011.