unordered_multiset< _Value,,, > Class Template Reference

#include <_unordered_set.h>

Public Types
typedef hashtable< _Value, _Value, _HashFcn, _UnorderedMultisetTraits, _STLP_PRIV _Identity< _Value > , _EqualKey, _Alloc >	_Ht
typedef _Ht::key_type	key_type
typedef _Ht::value_type	value_type
typedef _Ht::hasher	hasher
typedef _Ht::key_equal	key_equal
typedef _Ht::size_type	size_type
typedef _Ht::difference_type	difference_type
typedef _Ht::pointer	pointer
typedef _Ht::const_pointer	const_pointer
typedef _Ht::reference	reference
typedef _Ht::const_reference	const_reference
typedef _Ht::iterator	iterator
typedef _Ht::const_iterator	const_iterator
typedef _Ht::local_iterator	local_iterator
typedef _Ht::const_local_iterator	const_local_iterator
typedef _Ht::allocator_type	allocator_type
Public Member Functions
hasher	hash_function () const
key_equal	key_eq () const
allocator_type	get_allocator () const
	unordered_multiset (size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
	unordered_multiset (__move_source< _Self > src)
	unordered_multiset (const value_type *__f, const value_type *__l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
	unordered_multiset (const_iterator __f, const_iterator __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
_Self &	operator= (const _Self &__other)
size_type	size () const
size_type	max_size () const
bool	empty () const
void	swap (_Self &hs)
iterator	begin ()
iterator	end ()
const_iterator	begin () const
const_iterator	end () const
iterator	insert (const value_type &__obj)
iterator	insert (const_iterator, const value_type &__obj)
void	insert (const value_type *__f, const value_type *__l)
void	insert (const_iterator __f, const_iterator __l)
_STLP_TEMPLATE_FOR_CONT_EXT iterator	find (const _KT &__key)
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator	find (const _KT &__key) const
_STLP_TEMPLATE_FOR_CONT_EXT size_type	count (const _KT &__key) const
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator >	equal_range (const _KT &__key)
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iterator >	equal_range (const _KT &__key) const
size_type	erase (const key_type &__key)
void	erase (const_iterator __it)
void	erase (const_iterator __f, const_iterator __l)
void	clear ()
size_type	bucket_count () const
size_type	max_bucket_count () const
size_type	bucket_size (size_type __n) const
_STLP_TEMPLATE_FOR_CONT_EXT size_type	bucket (const _KT &__k) const
local_iterator	begin (size_type __n)
local_iterator	end (size_type __n)
const_local_iterator	begin (size_type __n) const
const_local_iterator	end (size_type __n) const
float	load_factor () const
float	max_load_factor () const
void	max_load_factor (float __val)
void	rehash (size_type __hint)
Private Types
typedef unordered_multiset < _Value, _HashFcn, _EqualKey, _Alloc >	_Self
typedef _STLP_PRIV _UnorderedMultisetTraitsT < _Value >	_UnorderedMultisetTraits
Private Attributes
_Ht	_M_ht

---

Detailed Description

template<class _Value, _STLP_DFL_TMPL_PARAM(_HashFcn, hash< _Value >), _STLP_DFL_TMPL_PARAM(_EqualKey, equal_to< _Value >), _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >)>
class unordered_multiset< _Value,,, >

Definition at line 187 of file _unordered_set.h.

---

The documentation for this class was generated from the following file:

• include/c++/stlport/stl/_unordered_set.h