hashtable Class Reference

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

class hashtable
Public Member Type Definitions
typedef forward_iterator_tag _Iterator_category
typedef _Const_traits< _Val > __const_val_traits
typedef _Nonconst_traits< _Val > __nonconst_val_traits
typedef _Alloc_traits< _Val, _All >::allocator_type allocator_type
typedef _Ht_iterator< _Val, __const_val_traits, _Key, _HF, _ExK, _EqK, _All > const_iterator
typedefconst value_type * const_pointer
typedefconst value_type & const_reference
typedef ptrdiff_t difference_type
typedef_HF hasher
typedef _Ht_iterator< _Val, __nonconst_val_traits, _Key, _HF, _ExK, _EqK, _All > iterator
typedef_EqK key_equal
typedef_Key key_type
typedef value_type * pointer
typedef value_type & reference
typedef size_t size_type
typedef_Val value_type
Public Member Functions
hashtable(size_type, const _HF &, const _EqK &, const _ExK &, const allocator_type &)
hashtable(size_type, const _HF &, const _EqK &, const allocator_type &)
hashtable(const _Self &)
~hashtable()
bool _STLP_CALL_M_equal(const hashtable< _Val, _Key, _HF, _ExK, _EqK, _All > &, const hashtable< _Val, _Key, _HF, _ExK, _EqK, _All > &)
reference _M_insert(const value_type &)
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(const const_iterator &)
voiderase(const_iterator, const_iterator)
iterator find(const key_type &)
const_iterator find(const key_type &)
reference find_or_insert(const value_type &)
allocator_type get_allocator()
hasher hash_funct()
iterator insert_equal(const value_type &)
voidinsert_equal(const value_type *, const value_type *)
voidinsert_equal(const_iterator, const_iterator)
iterator insert_equal_noresize(const value_type &)
pair< iterator, bool >insert_unique(const value_type &)
voidinsert_unique(const value_type *, const value_type *)
voidinsert_unique(const_iterator, const_iterator)
pair< iterator, bool >insert_unique_noresize(const value_type &)
key_equal key_eq()
size_type max_bucket_count()
size_type max_size()
_Self &operator=(const _Self &)
voidresize(size_type)
size_type size()
voidswap(_Self &)

Member Type Definition Documentation

Typedef _Iterator_category

typedef forward_iterator_tag _Iterator_category

Typedef __const_val_traits

typedef _Const_traits< _Val >__const_val_traits

Typedef __nonconst_val_traits

typedef _Nonconst_traits< _Val >__nonconst_val_traits

Typedef allocator_type

typedef _Alloc_traits< _Val, _All >::allocator_typeallocator_type

Typedef const_iterator

typedef _Ht_iterator< _Val, __const_val_traits, _Key, _HF, _ExK, _EqK, _All >const_iterator

Typedef const_pointer

typedef const value_type *const_pointer

Typedef const_reference

typedef const value_type &const_reference

Typedef difference_type

typedef ptrdiff_t difference_type

Typedef hasher

typedef _HFhasher

Typedef iterator

typedef _Ht_iterator< _Val, __nonconst_val_traits, _Key, _HF, _ExK, _EqK, _All >iterator

Typedef key_equal

typedef _EqKkey_equal

Typedef key_type

typedef _Keykey_type

Typedef pointer

typedef value_type *pointer

Typedef reference

typedef value_type &reference

Typedef size_type

typedef size_t size_type

Typedef value_type

typedef _Valvalue_type

Constructor & Destructor Documentation

hashtable ( size_type, const _HF &, const _EqK &, const _ExK &, const allocator_type & )

hashtable(size_type__n,
const _HF &__hf,
const _EqK &__eql,
const _ExK &__ext,
const allocator_type &__a =  allocator_type()
)[inline]

hashtable ( size_type, const _HF &, const _EqK &, const allocator_type & )

hashtable(size_type__n,
const _HF &__hf =  hasher(),
const _EqK &__eql =  key_equal(),
const allocator_type &__a =  allocator_type()
)[inline]

hashtable ( const _Self & )

hashtable(const _Self &__ht)[inline]

~hashtable ( )

~hashtable()[inline]

Member Function Documentation

_M_equal ( const hashtable< _Val, _Key, _HF, _ExK, _EqK, _All > &, const hashtable< _Val, _Key, _HF, _ExK, _EqK, _All > & )

bool _STLP_CALL_M_equal(const hashtable< _Val, _Key, _HF, _ExK, _EqK, _All > &,
const hashtable< _Val, _Key, _HF, _ExK, _EqK, _All > &
)[static]

_M_insert ( const value_type & )

reference _M_insert(const value_type &__obj)

begin ( )

iterator begin()[inline]

begin ( )

const_iterator begin()const [inline]

bucket_count ( )

size_type bucket_count()const [inline]

clear ( )

voidclear()

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__bucket)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)

equal_range ( const key_type & )

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

erase ( const key_type & )

size_type erase(const key_type &__key)

erase ( const const_iterator & )

voiderase(const const_iterator &__it)

erase ( const_iterator, const_iterator )

voiderase(const_iterator__first,
const_iterator__last
)

find ( const key_type & )

iterator find(const key_type &__key)[inline]

find ( const key_type & )

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

find_or_insert ( const value_type & )

reference find_or_insert(const value_type &__obj)

get_allocator ( )

allocator_type get_allocator()const [inline]

hash_funct ( )

hasher hash_funct()const [inline]

insert_equal ( const value_type & )

iterator insert_equal(const value_type &__obj)[inline]

insert_equal ( const value_type *, const value_type * )

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

insert_equal ( const_iterator, const_iterator )

voidinsert_equal(const_iterator__f,
const_iterator__l
)[inline]

insert_equal_noresize ( const value_type & )

iterator insert_equal_noresize(const value_type &__obj)

insert_unique ( const value_type & )

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

insert_unique ( const value_type *, const value_type * )

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

insert_unique ( const_iterator, const_iterator )

voidinsert_unique(const_iterator__f,
const_iterator__l
)[inline]

insert_unique_noresize ( const value_type & )

pair< iterator, bool >insert_unique_noresize(const value_type &__obj)

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 _Self & )

_Self &operator=(const _Self &__ht)[inline]

resize ( size_type )

voidresize(size_type__num_elements_hint)

size ( )

size_type size()const [inline]

swap ( _Self & )

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