.TH "std::__profile::unordered_multiset< _Value, _Hash, _Pred, _Alloc >" 3cxx "Sun Feb 7 2021" "libstdc++" \" -*- nroff -*- .ad l .nh .SH NAME std::__profile::unordered_multiset< _Value, _Hash, _Pred, _Alloc > \- Unordered_multiset wrapper with performance instrumentation\&. .SH SYNOPSIS .br .PP .PP Inherits unordered_multiset< _Value, std::hash< _Value >, std::equal_to< _Value >, std::allocator< _Value > >, and std::__profile::_Unordered_profile< _UnorderedCont, _Unique_keys >\&. .SS "Public Types" .in +1c .ti -1c .RI "typedef _Base::allocator_type \fBallocator_type\fP" .br .ti -1c .RI "typedef _Base::const_iterator \fBconst_iterator\fP" .br .ti -1c .RI "typedef _Base::const_reference \fBconst_reference\fP" .br .ti -1c .RI "typedef _Base::difference_type \fBdifference_type\fP" .br .ti -1c .RI "typedef _Base::hasher \fBhasher\fP" .br .ti -1c .RI "typedef _Base::iterator \fBiterator\fP" .br .ti -1c .RI "typedef _Base::key_equal \fBkey_equal\fP" .br .ti -1c .RI "typedef _Base::key_type \fBkey_type\fP" .br .ti -1c .RI "typedef _Base::reference \fBreference\fP" .br .ti -1c .RI "typedef _Base::size_type \fBsize_type\fP" .br .ti -1c .RI "typedef _Base::value_type \fBvalue_type\fP" .br .in -1c .SS "Public Member Functions" .in +1c .ti -1c .RI "template \fBunordered_multiset\fP (_InputIterator __f, _InputIterator __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())" .br .ti -1c .RI "template \fBunordered_multiset\fP (_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type &__a)" .br .ti -1c .RI "template \fBunordered_multiset\fP (_InputIterator __first, _InputIterator __last, size_type __n, const hasher &__hf, const allocator_type &__a)" .br .ti -1c .RI "\fBunordered_multiset\fP (const \fB_Base\fP &__x)" .br .ti -1c .RI "\fBunordered_multiset\fP (const allocator_type &__a)" .br .ti -1c .RI "\fBunordered_multiset\fP (const \fBunordered_multiset\fP &)=default" .br .ti -1c .RI "\fBunordered_multiset\fP (const \fBunordered_multiset\fP &__umset, const allocator_type &__a)" .br .ti -1c .RI "\fBunordered_multiset\fP (\fBinitializer_list\fP< value_type > __l, size_type __n, const allocator_type &__a)" .br .ti -1c .RI "\fBunordered_multiset\fP (\fBinitializer_list\fP< value_type > __l, size_type __n, const hasher &__hf, const allocator_type &__a)" .br .ti -1c .RI "\fBunordered_multiset\fP (\fBinitializer_list\fP< value_type > __l, size_type __n=0, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())" .br .ti -1c .RI "\fBunordered_multiset\fP (size_type __n, const allocator_type &__a)" .br .ti -1c .RI "\fBunordered_multiset\fP (size_type __n, const hasher &__hf, const allocator_type &__a)" .br .ti -1c .RI "\fBunordered_multiset\fP (size_type __n, const hasher &__hf=hasher(), const key_equal &__eql=key_equal(), const allocator_type &__a=allocator_type())" .br .ti -1c .RI "\fBunordered_multiset\fP (\fBunordered_multiset\fP &&)=default" .br .ti -1c .RI "\fBunordered_multiset\fP (\fBunordered_multiset\fP &&__umset, const allocator_type &__a)" .br .ti -1c .RI "void \fBclear\fP () noexcept" .br .ti -1c .RI "template iterator \fBemplace\fP (_Args &&\&.\&.\&. __args)" .br .ti -1c .RI "template iterator \fBemplace_hint\fP (const_iterator __it, _Args &&\&.\&.\&. __args)" .br .ti -1c .RI "template void \fBinsert\fP (_InputIter __first, _InputIter __last)" .br .ti -1c .RI "iterator \fBinsert\fP (const value_type &__obj)" .br .ti -1c .RI "iterator \fBinsert\fP (const_iterator __iter, const value_type &__v)" .br .ti -1c .RI "iterator \fBinsert\fP (const_iterator __iter, value_type &&__v)" .br .ti -1c .RI "void \fBinsert\fP (\fBstd::initializer_list\fP< value_type > __l)" .br .ti -1c .RI "iterator \fBinsert\fP (value_type &&__obj)" .br .ti -1c .RI "\fBunordered_multiset\fP & \fBoperator=\fP (const \fBunordered_multiset\fP &)=default" .br .ti -1c .RI "\fBunordered_multiset\fP & \fBoperator=\fP (\fBinitializer_list\fP< value_type > __l)" .br .ti -1c .RI "\fBunordered_multiset\fP & \fBoperator=\fP (\fBunordered_multiset\fP &&)=default" .br .ti -1c .RI "void \fBrehash\fP (size_type __n)" .br .ti -1c .RI "void \fBswap\fP (\fBunordered_multiset\fP &__x) noexcept(noexcept(__x\&._M_base()\&.swap(__x)))" .br .in -1c .SS "Protected Member Functions" .in +1c .ti -1c .RI "void \fB_M_profile_construct\fP () noexcept" .br .ti -1c .RI "void \fB_M_profile_destruct\fP () noexcept" .br .ti -1c .RI "void \fB_M_profile_resize\fP (std::size_t __old_size)" .br .ti -1c .RI "void \fB_M_swap\fP (_Unordered_profile &__other) noexcept" .br .in -1c .SS "Protected Attributes" .in +1c .ti -1c .RI "\fB__gnu_profile::__hashfunc_info\fP * \fB_M_hashfunc_info\fP" .br .ti -1c .RI "\fB__gnu_profile::__container_size_info\fP * \fB_M_size_info\fP" .br .in -1c .SH "Detailed Description" .PP .SS "template, typename _Pred = std::equal_to<_Value>, typename _Alloc = std::allocator<_Value>> .br class std::__profile::unordered_multiset< _Value, _Hash, _Pred, _Alloc >" Unordered_multiset wrapper with performance instrumentation\&. .PP Definition at line 307 of file profile/unordered_set\&. .SH "Author" .PP Generated automatically by Doxygen for libstdc++ from the source code\&.