__gnu_cxx::hashtable(3)

NAME
__gnu_cxx::hashtable -

SYNOPSIS

Detailed Description

  template<class _Val, class _Key, class _HashFcn, class _ExtractKey, class _EqualKey, class _Alloc> class __gnu_cxx::hashtable< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >

Definition at line 256 of file hashtable.h.

  Public Types
typedef _Alloc::template rebind< value_type >::other allocator_type
typedef _Hashtable_const_iterator< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc > const_iterator
typedef const value_type * const_pointer
typedef const value_type & const_reference
typedef ptrdiff_t difference_type
typedef _HashFcn hasher
typedef _Hashtable_iterator< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc > iterator
typedef _EqualKey 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
const_iterator begin () const
iterator begin ()
size_type bucket_count () const
void clear ()
size_type count (const key_type &__key) const
size_type elems_in_bucket (size_type __bucket) const
bool empty () const
const_iterator end () const
iterator end ()
pair< const_iterator, const_iterator > equal_range (const key_type &__key) const
pair< iterator, iterator > equal_range (const key_type &__key)
void erase (const_iterator __first, const_iterator __last)
void erase (const const_iterator &__it)
void erase (iterator __first, iterator __last)
void erase (const iterator &__it)
size_type erase (const key_type &__key)
const_iterator find (const key_type &__key) const
iterator find (const key_type &__key)
reference find_or_insert (const value_type &__obj)
allocator_type get_allocator () const
hasher hash_funct () const
hashtable (const hashtable &__ht)
hashtable (size_type __n, const _HashFcn &__hf, const _EqualKey &__eql, const allocator_type &__a=allocator_type())
hashtable (size_type __n, const _HashFcn &__hf, const _EqualKey &__eql, const _ExtractKey &__ext, const allocator_type &__a=allocator_type())
template<class _ForwardIterator> void insert_equal (_ForwardIterator __f, _ForwardIterator __l, forward_iterator_tag)
template<class _InputIterator> void insert_equal (_InputIterator __f, _InputIterator __l, input_iterator_tag)
template<class _InputIterator> void insert_equal (_InputIterator __f, _InputIterator __l)
iterator insert_equal (const value_type &__obj)
iterator insert_equal_noresize (const value_type &__obj)
template<class _ForwardIterator> void insert_unique (_ForwardIterator __f, _ForwardIterator __l, forward_iterator_tag)
template<class _InputIterator> void insert_unique (_InputIterator __f, _InputIterator __l, input_iterator_tag)
template<class _InputIterator> void insert_unique (_InputIterator __f, _InputIterator __l)
pair< iterator, bool > insert_unique (const value_type &__obj)
pair< iterator, bool > insert_unique_noresize (const value_type &__obj)
key_equal key_eq () const
size_type max_bucket_count () const
size_type max_size () const
hashtable & operator= (const hashtable &__ht)
void resize (size_type __num_elements_hint)
size_type size () const
void swap (hashtable &__ht)
~hashtable ()

  Friends
struct _Hashtable_const_iterator< _Val, _Key, _HashFcn, _ExtractKey,_EqualKey, _Alloc >
struct _Hashtable_iterator< _Val, _Key, _HashFcn, _ExtractKey, _EqualKey, _Alloc >
template<class _Vl, class _Ky, class _HF, class _Ex, class _Eq, class _Al> bool operator== (const hashtable< _Vl, _Ky, _HF, _Ex, _Eq, _Al > &, const hashtable< _Vl, _Ky, _HF, _Ex, _Eq, _Al > &)

Author

Generated automatically by Doxygen for libstdc++ from the source code.