std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >(3cxx) std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >(3cxx)
NAME
std::unordered_multiset< _Value, _Hash, _Pred, _Alloc > -
SYNOPSIS
Inherits std::__unordered_multiset< _Value, _Hash, _Pred, _Alloc, __cache_hash_code >.
Public Types
typedef _Base::allocator_type allocator_type
typedef
__detail::_Hashtable_const_iterator
< value_type,
__constant_iterators,
__cache_hash_code > const_iterator"
typedef
__detail::_Node_const_iterator
< value_type,
__constant_iterators,
__cache_hash_code > const_local_iterator"
typedef _Allocator::const_pointer const_pointer
typedef _Allocator::const_reference const_reference
typedef std::ptrdiff_t difference_type
typedef _Base::hasher hasher
typedef
__detail::_Hashtable_iterator
< value_type,
__constant_iterators,
__cache_hash_code > iterator"
typedef _Base::key_equal key_equal
typedef _Key key_type
typedef
__detail::_Node_iterator
< value_type,
__constant_iterators,
__cache_hash_code > local_iterator"
typedef _Allocator::pointer pointer
typedef _Allocator::reference reference
typedef _Base::size_type size_type
typedef _Base::value_type value_type
Public Member Functions
unordered_multiset (size_type __n=10, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type
&__a=allocator_type())
template<typename _InputIterator > unordered_multiset (_InputIterator __f, _InputIterator __l, size_type __n=0, const hasher
&__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())
unordered_multiset (initializer_list< value_type > __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(),
const allocator_type &__a=allocator_type())
const _RehashPolicy & __rehash_policy () const
void __rehash_policy (const _RehashPolicy &)
iterator begin ()
const_iterator begin () const
local_iterator begin (size_type __n)
const_local_iterator begin (size_type __n) const
size_type bucket (const key_type &__k) const
size_type bucket_count () const
size_type bucket_size (size_type __n) const
const_iterator cbegin () const
const_local_iterator cbegin (size_type __n) const
const_iterator cend () const
const_local_iterator cend (size_type) const
void clear ()
size_type count (const key_type &__k) const
bool empty () const
iterator end ()
const_iterator end () const
local_iterator end (size_type)
const_local_iterator end (size_type) const
std::pair< iterator, iterator > equal_range (const key_type &__k)
std::pair< const_iterator,
const_iterator > equal_range (const key_type &__k) const "
iterator erase (const_iterator)
iterator erase (iterator __it)
size_type erase (const key_type &)
iterator erase (const_iterator, const_iterator)
iterator find (const key_type &__k)
const_iterator find (const key_type &__k) const
allocator_type get_allocator () const
_Insert_Return_Type insert (const value_type &__v)
iterator insert (const_iterator, const value_type &__v)
_Insert_Return_Type insert (value_type &&__v)
iterator insert (const_iterator, value_type &&__v)
template<typename _Pair , typename = typename std::enable_if<!__constant_iterators &&
std::is_convertible<_Pair, value_type>::value>::type> _Insert_Return_Type insert (_Pair &&__v)
template<typename _Pair , typename = typename std::enable_if<!__constant_iterators &&
std::is_convertible<_Pair, value_type>::value>::type> iterator insert (const_iterator, _Pair &&__v)
template<typename _InputIterator > void insert (_InputIterator __first, _InputIterator __last)
void insert (initializer_list< value_type > __l)
key_equal key_eq () const
float load_factor () const
size_type max_bucket_count () const
size_type max_size () const
unordered_multiset & operator= (initializer_list< value_type > __l)
void rehash (size_type __n)
size_type size () const
void swap (_Hashtable &)
Detailed Description
template<class _Value, class _Hash = hash<_Value>, class _Pred = std::equal_to<_Value>, class _Alloc = std::allocator<_Value>>class
std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >
A standard container composed of equivalent keys (possibly containing multiple of each key value) in which the elements' keys are the
elements themselves.
Meets the requirements of a container, and unordered associative container
Parameters:
Value Type of key objects.
Hash Hashing function object type, defaults to hash<Value>.
Pred Predicate function object type, defaults to equal_to<Value>.
Alloc Allocator type, defaults to allocator<Key>.
Definition at line 314 of file unordered_set.h.
Author
Generated automatically by Doxygen for libstdc++ from the source code.
libstdc++ Tue Nov 27 2012 std::unordered_multiset< _Value, _Hash, _Pred, _Alloc >(3cxx)