|
| | unordered_multiset (_Base_ref __x) |
| |
| template<typename _InputIterator > |
| | unordered_multiset (_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type &__a) |
| |
| template<typename _InputIterator > |
| | unordered_multiset (_InputIterator __first, _InputIterator __last, size_type __n, const hasher &__hf, const allocator_type &__a) |
| |
| template<typename _InputIterator > |
| | unordered_multiset (_InputIterator __first, _InputIterator __last, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) |
| |
| | unordered_multiset (const allocator_type &__a) |
| |
|
| unordered_multiset (const unordered_multiset &)=default |
| |
| | unordered_multiset (const unordered_multiset &__uset, const allocator_type &__a) |
| |
| | unordered_multiset (initializer_list< value_type > __l, size_type __n, const allocator_type &__a) |
| |
| | unordered_multiset (initializer_list< value_type > __l, size_type __n, const hasher &__hf, const allocator_type &__a) |
| |
| | 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()) |
| |
| | unordered_multiset (size_type __n, const allocator_type &__a) |
| |
| | unordered_multiset (size_type __n, const hasher &__hf, const allocator_type &__a) |
| |
| | unordered_multiset (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type()) |
| |
|
| unordered_multiset (unordered_multiset &&)=default |
| |
| | unordered_multiset (unordered_multiset &&__uset, const allocator_type &__a) noexcept(noexcept(_Base(std::move(__uset), __a))) |
| |
| const _Base & | _M_base () const noexcept |
| |
| _Base & | _M_base () noexcept |
| |
| const_iterator | begin () const noexcept |
| |
| iterator | begin () noexcept |
| |
| local_iterator | begin (size_type __b) |
| |
| const_local_iterator | begin (size_type __b) const |
| |
| size_type | bucket_size (size_type __b) const |
| |
| const_iterator | cbegin () const noexcept |
| |
| const_local_iterator | cbegin (size_type __b) const |
| |
| const_iterator | cend () const noexcept |
| |
| const_local_iterator | cend (size_type __b) const |
| |
| void | clear () noexcept |
| |
| template<typename... _Args> |
| iterator | emplace (_Args &&... __args) |
| |
| template<typename... _Args> |
| iterator | emplace_hint (const_iterator __hint, _Args &&... __args) |
| |
| const_iterator | end () const noexcept |
| |
| iterator | end () noexcept |
| |
| local_iterator | end (size_type __b) |
| |
| const_local_iterator | end (size_type __b) const |
| |
| template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> |
| std::pair< iterator, iterator > | equal_range (const _Kt &__k) |
| |
| template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> |
| std::pair< const_iterator, const_iterator > | equal_range (const _Kt &__k) const |
| |
| std::pair< iterator, iterator > | equal_range (const key_type &__key) |
| |
| std::pair< const_iterator, const_iterator > | equal_range (const key_type &__key) const |
| |
| _Base_iterator | erase (_Base_const_iterator __it) |
| |
| size_type | erase (const key_type &__key) |
| |
| iterator | erase (const_iterator __first, const_iterator __last) |
| |
| iterator | erase (const_iterator __it) |
| |
| iterator | erase (iterator __it) |
| |
| node_type | extract (const key_type &__key) |
| |
| node_type | extract (const_iterator __position) |
| |
| template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> |
| iterator | find (const _Kt &__k) |
| |
| template<typename _Kt , typename = std::__has_is_transparent_t<_Hash, _Kt>, typename = std::__has_is_transparent_t<_Pred, _Kt>> |
| const_iterator | find (const _Kt &__k) const |
| |
| iterator | find (const key_type &__key) |
| |
| const_iterator | find (const key_type &__key) const |
| |
| template<typename _InputIterator > |
| void | insert (_InputIterator __first, _InputIterator __last) |
| |
| iterator | insert (const value_type &__obj) |
| |
| iterator | insert (const_iterator __hint, const value_type &__obj) |
| |
| iterator | insert (const_iterator __hint, node_type &&__nh) |
| |
| iterator | insert (const_iterator __hint, value_type &&__obj) |
| |
| iterator | insert (node_type &&__nh) |
| |
| void | insert (std::initializer_list< value_type > __l) |
| |
| iterator | insert (value_type &&__obj) |
| |
| float | max_load_factor () const noexcept |
| |
| void | max_load_factor (float __f) |
| |
| template<typename _H2 , typename _P2 > |
| void | merge (unordered_multiset< _Value, _H2, _P2, _Alloc > &&__source) |
| |
| template<typename _H2 , typename _P2 > |
| void | merge (unordered_multiset< _Value, _H2, _P2, _Alloc > &__source) |
| |
| template<typename _H2 , typename _P2 > |
| void | merge (unordered_set< _Value, _H2, _P2, _Alloc > &&__source) |
| |
| template<typename _H2 , typename _P2 > |
| void | merge (unordered_set< _Value, _H2, _P2, _Alloc > &__source) |
| |
|
unordered_multiset & | operator= (const unordered_multiset &)=default |
| |
| unordered_multiset & | operator= (initializer_list< value_type > __l) |
| |
|
unordered_multiset & | operator= (unordered_multiset &&)=default |
| |
| void | swap (unordered_multiset &__x) noexcept(noexcept(declval< _Base & >().swap(__x))) |
| |
template<
typename _Value,
typename _Hash = std::hash<_Value>,
typename _Pred = std::equal_to<_Value>,
typename _Alloc = std::allocator<_Value>>
class std::__debug::unordered_multiset< _Value, _Hash, _Pred, _Alloc >
Class std::unordered_multiset with safety/checking/debug instrumentation.
Definition at line 740 of file debug/unordered_set.