hash_map Class Reference

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

class hash_map
Public Member Type Definitions
typedef_Ht::value_type _value_type
typedef_Ht::allocator_type allocator_type
typedef_Ht::const_iterator const_iterator
typedef_Ht::const_pointer const_pointer
typedef_Ht::const_reference const_reference
typedef_Tp data_type
typedef_Ht::difference_type difference_type
typedef_Ht::hasher hasher
typedef_Ht::iterator iterator
typedef_Ht::key_equal key_equal
typedef_Ht::key_type key_type
typedef_Tp mapped_type
typedef_Ht::pointer pointer
typedef_Ht::reference reference
typedef_Ht::size_type size_type
typedef_Ht::value_type value_type
Public Member Functions
hash_map()
hash_map(size_type)
hash_map(const _Self &)
hash_map(size_type, const hasher &)
hash_map(size_type, const hasher &, const key_equal &, const allocator_type &)
hash_map(const value_type *, const value_type *)
hash_map(const value_type *, const value_type *, size_type)
hash_map(const value_type *, const value_type *, size_type, const hasher &)
hash_map(const value_type *, const value_type *, size_type, const hasher &, const key_equal &, const allocator_type &)
hash_map(const_iterator, const_iterator)
hash_map(const_iterator, const_iterator, size_type)
hash_map(const_iterator, const_iterator, size_type, const hasher &)
hash_map(const_iterator, const_iterator, size_type, const hasher &, const key_equal &, const allocator_type &)
bool _STLP_CALL_M_equal(const _Self &, const _Self &)
iterator begin()
const_iterator begin()
size_type bucket_count()
voidclear()
size_type count(const key_type &)
size_type elems_in_bucket(size_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 &)
size_type erase(const key_type &)
voiderase(iterator)
voiderase(iterator, iterator)
iterator find(const key_type &)
const_iterator find(const key_type &)
allocator_type get_allocator()
hasher hash_funct()
pair< iterator, bool >insert(const value_type &)
voidinsert(const value_type *, const value_type *)
voidinsert(const_iterator, const_iterator)
pair< iterator, bool >insert_noresize(const value_type &)
key_equal key_eq()
size_type max_bucket_count()
size_type max_size()
_Tp &operator[](const key_type &)
voidresize(size_type)
size_type size()
voidswap(_Self &)

Member Type Definition Documentation

Typedef _value_type

typedef _Ht::value_type_value_type

Typedef allocator_type

typedef _Ht::allocator_typeallocator_type

Typedef const_iterator

typedef _Ht::const_iteratorconst_iterator

Typedef const_pointer

typedef _Ht::const_pointerconst_pointer

Typedef const_reference

typedef _Ht::const_referenceconst_reference

Typedef data_type

typedef _Tpdata_type

Typedef difference_type

typedef _Ht::difference_typedifference_type

Typedef hasher

typedef _Ht::hasherhasher

Typedef iterator

typedef _Ht::iteratoriterator

Typedef key_equal

typedef _Ht::key_equalkey_equal

Typedef key_type

typedef _Ht::key_typekey_type

Typedef mapped_type

typedef _Tpmapped_type

Typedef pointer

typedef _Ht::pointerpointer

Typedef reference

typedef _Ht::referencereference

Typedef size_type

typedef _Ht::size_typesize_type

Typedef value_type

typedef _Ht::value_typevalue_type

Constructor & Destructor Documentation

hash_map ( )

__WORKAROUND_RENAME()hash_map()[inline]

hash_map ( size_type )

__WORKAROUND_RENAME()hash_map(size_type__n)[inline, explicit]

hash_map ( const _Self & )

__WORKAROUND_RENAME()hash_map(const _Self &__o)[inline]

hash_map ( size_type, const hasher & )

__WORKAROUND_RENAME()hash_map(size_type__n,
const hasher &__hf
)[inline]

hash_map ( size_type, const hasher &, const key_equal &, const allocator_type & )

__WORKAROUND_RENAME()hash_map(size_type__n,
const hasher &__hf,
const key_equal &__eql,
const allocator_type &__a =  allocator_type()
)[inline]

hash_map ( const value_type *, const value_type * )

__WORKAROUND_RENAME()hash_map(const value_type *__f,
const value_type *__l
)[inline]

hash_map ( const value_type *, const value_type *, size_type )

__WORKAROUND_RENAME()hash_map(const value_type *__f,
const value_type *__l,
size_type__n
)[inline]

hash_map ( const value_type *, const value_type *, size_type, const hasher & )

__WORKAROUND_RENAME()hash_map(const value_type *__f,
const value_type *__l,
size_type__n,
const hasher &__hf
)[inline]

hash_map ( const value_type *, const value_type *, size_type, const hasher &, const key_equal &, const allocator_type & )

__WORKAROUND_RENAME()hash_map(const value_type *__f,
const value_type *__l,
size_type__n,
const hasher &__hf,
const key_equal &__eql,
const allocator_type &__a =  allocator_type()
)[inline]

hash_map ( const_iterator, const_iterator )

__WORKAROUND_RENAME()hash_map(const_iterator__f,
const_iterator__l
)[inline]

hash_map ( const_iterator, const_iterator, size_type )

__WORKAROUND_RENAME()hash_map(const_iterator__f,
const_iterator__l,
size_type__n
)[inline]

hash_map ( const_iterator, const_iterator, size_type, const hasher & )

__WORKAROUND_RENAME()hash_map(const_iterator__f,
const_iterator__l,
size_type__n,
const hasher &__hf
)[inline]

hash_map ( const_iterator, const_iterator, size_type, const hasher &, const key_equal &, const allocator_type & )

__WORKAROUND_RENAME()hash_map(const_iterator__f,
const_iterator__l,
size_type__n,
const hasher &__hf,
const key_equal &__eql,
const allocator_type &__a =  allocator_type()
)[inline]

Member Function Documentation

_M_equal ( const _Self &, const _Self & )

bool _STLP_CALL_M_equal(const _Self &__x,
const _Self &__y
)[static, inline]

begin ( )

iterator begin()[inline]

begin ( )

const_iterator begin()const [inline]

bucket_count ( )

size_type bucket_count()const [inline]

clear ( )

voidclear()[inline]

count ( const key_type & )

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

elems_in_bucket ( size_type )

size_type elems_in_bucket(size_type__n)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 &__key)[inline]

equal_range ( const key_type & )

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

erase ( const key_type & )

size_type erase(const key_type &__key)[inline]

erase ( iterator )

voiderase(iterator__it)[inline]

erase ( iterator, iterator )

voiderase(iterator__f,
iterator__l
)[inline]

find ( const key_type & )

iterator find(const key_type &__key)[inline]

find ( const key_type & )

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

get_allocator ( )

allocator_type get_allocator()const [inline]

hash_funct ( )

hasher hash_funct()const [inline]

insert ( const value_type & )

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

insert ( const value_type *, const value_type * )

voidinsert(const value_type *__f,
const value_type *__l
)[inline]

insert ( const_iterator, const_iterator )

voidinsert(const_iterator__f,
const_iterator__l
)[inline]

insert_noresize ( const value_type & )

pair< iterator, bool >insert_noresize(const value_type &__obj)[inline]

key_eq ( )

key_equal key_eq()const [inline]

max_bucket_count ( )

size_type max_bucket_count()const [inline]

max_size ( )

size_type max_size()const [inline]

operator[] ( const key_type & )

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

resize ( size_type )

voidresize(size_type__hint)[inline]

size ( )

size_type size()const [inline]

swap ( _Self & )

voidswap(_Self &__hs)[inline]
© Nokia 2011.