OpenE2K
/
gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

re PR libstdc++/89477 (Incorrect CTAD deduction guides for set and multiset) 

2019-03-08  François Dumont  <fdumont@gcc.gnu.org>

	PR libstdc++/89477
	* include/debug/map.h (map): Use _RequireNotAllocator to constrain
	parameters in deduction guides.
	* include/debug/multimap.h (multimap): Likewise.
	* include/debug/set.h (multimap): Likewise.
	* include/debug/multiset.h (multimap): Likewise.
	* include/debug/unordered_map (unordered_map): Likewise.
	(unordered_multimap): Likewise.
	* include/debug/unordered_set (unordered_set): Likewise.
	(unordered_multiset): Likewise.

From-SVN: r269479
This commit is contained in:
François Dumont 2019-03-08 05:53:09 +00:00
parent 20a4550ce0
commit c0cb38c28e
7 changed files with 118 additions and 74 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
libstdc++-v3/ChangeLog
View File

@ -1,5 +1,16 @@
2019-03-08 François Dumont <fdumont@gcc.gnu.org> 2019-03-08 François Dumont <fdumont@gcc.gnu.org>
PR libstdc++/89477
* include/debug/map.h (map): Use _RequireNotAllocator to constrain
parameters in deduction guides.
* include/debug/multimap.h (multimap): Likewise.
* include/debug/set.h (multimap): Likewise.
* include/debug/multiset.h (multimap): Likewise.
* include/debug/unordered_map (unordered_map): Likewise.
(unordered_multimap): Likewise.
* include/debug/unordered_set (unordered_set): Likewise.
(unordered_multiset): Likewise.
PR libstdc++/89608 PR libstdc++/89608
* include/debug/unordered_map (unordered_map<>::_M_check_rehashed): * include/debug/unordered_map (unordered_map<>::_M_check_rehashed):
Invalidate all iterators in case of rehash. Invalidate all iterators in case of rehash.

52
libstdc++-v3/include/debug/map.h
View File

@ -700,34 +700,36 @@ namespace __debug
#if __cpp_deduction_guides >= 201606 #if __cpp_deduction_guides >= 201606
template<typename _InputIterator, template<typename _InputIterator,
typename _Compare = less<__iter_key_t<_InputIterator>>, typename _Compare = less<__iter_key_t<_InputIterator>>,
typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>, typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>,
typename = _RequireInputIter<_InputIterator>,
typename = _RequireAllocator<_Allocator>>
map(_InputIterator, _InputIterator,
_Compare = _Compare(), _Allocator = _Allocator())
-> map<__iter_key_t<_InputIterator>, __iter_val_t<_InputIterator>,
_Compare, _Allocator>;
template<typename _Key, typename _Tp, typename _Compare = less<_Key>,
typename _Allocator = allocator<pair<const _Key, _Tp>>,
typename = _RequireAllocator<_Allocator>>
map(initializer_list<pair<_Key, _Tp>>,
_Compare = _Compare(), _Allocator = _Allocator())
-> map<_Key, _Tp, _Compare, _Allocator>;
template <typename _InputIterator, typename _Allocator,
typename = _RequireInputIter<_InputIterator>, typename = _RequireInputIter<_InputIterator>,
typename = _RequireNotAllocator<_Compare>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
map(_InputIterator, _InputIterator, _Allocator) map(_InputIterator, _InputIterator,
-> map<__iter_key_t<_InputIterator>, __iter_val_t<_InputIterator>, _Compare = _Compare(), _Allocator = _Allocator())
less<__iter_key_t<_InputIterator>>, _Allocator>; -> map<__iter_key_t<_InputIterator>, __iter_val_t<_InputIterator>,
_Compare, _Allocator>;
template<typename _Key, typename _Tp, typename _Allocator, template<typename _Key, typename _Tp, typename _Compare = less<_Key>,
typename = _RequireAllocator<_Allocator>> typename _Allocator = allocator<pair<const _Key, _Tp>>,
map(initializer_list<pair<_Key, _Tp>>, _Allocator) typename = _RequireNotAllocator<_Compare>,
-> map<_Key, _Tp, less<_Key>, _Allocator>; typename = _RequireAllocator<_Allocator>>
map(initializer_list<pair<_Key, _Tp>>,
_Compare = _Compare(), _Allocator = _Allocator())
-> map<_Key, _Tp, _Compare, _Allocator>;
template <typename _InputIterator, typename _Allocator,
typename = _RequireInputIter<_InputIterator>,
typename = _RequireAllocator<_Allocator>>
map(_InputIterator, _InputIterator, _Allocator)
-> map<__iter_key_t<_InputIterator>, __iter_val_t<_InputIterator>,
less<__iter_key_t<_InputIterator>>, _Allocator>;
template<typename _Key, typename _Tp, typename _Allocator,
typename = _RequireAllocator<_Allocator>>
map(initializer_list<pair<_Key, _Tp>>, _Allocator)
-> map<_Key, _Tp, less<_Key>, _Allocator>;
#endif #endif

2
libstdc++-v3/include/debug/multimap.h
View File

@ -585,6 +585,7 @@ namespace __debug
typename _Compare = less<__iter_key_t<_InputIterator>>, typename _Compare = less<__iter_key_t<_InputIterator>>,
typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>, typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>,
typename = _RequireInputIter<_InputIterator>, typename = _RequireInputIter<_InputIterator>,
typename = _RequireNotAllocator<_Compare>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
multimap(_InputIterator, _InputIterator, multimap(_InputIterator, _InputIterator,
_Compare = _Compare(), _Allocator = _Allocator()) _Compare = _Compare(), _Allocator = _Allocator())
@ -593,6 +594,7 @@ namespace __debug
template<typename _Key, typename _Tp, typename _Compare = less<_Key>, template<typename _Key, typename _Tp, typename _Compare = less<_Key>,
typename _Allocator = allocator<pair<const _Key, _Tp>>, typename _Allocator = allocator<pair<const _Key, _Tp>>,
typename = _RequireNotAllocator<_Compare>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
multimap(initializer_list<pair<_Key, _Tp>>, multimap(initializer_list<pair<_Key, _Tp>>,
_Compare = _Compare(), _Allocator = _Allocator()) _Compare = _Compare(), _Allocator = _Allocator())

46
libstdc++-v3/include/debug/multiset.h
View File

@ -555,32 +555,34 @@ namespace __debug
typename _Allocator = typename _Allocator =
allocator<typename iterator_traits<_InputIterator>::value_type>, allocator<typename iterator_traits<_InputIterator>::value_type>,
typename = _RequireInputIter<_InputIterator>, typename = _RequireInputIter<_InputIterator>,
typename = _RequireNotAllocator<_Compare>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
multiset(_InputIterator, _InputIterator, multiset(_InputIterator, _InputIterator,
_Compare = _Compare(), _Allocator = _Allocator()) _Compare = _Compare(), _Allocator = _Allocator())
-> multiset<typename iterator_traits<_InputIterator>::value_type, -> multiset<typename iterator_traits<_InputIterator>::value_type,
_Compare, _Allocator>; _Compare, _Allocator>;
template<typename _Key, template<typename _Key,
typename _Compare = less<_Key>, typename _Compare = less<_Key>,
typename _Allocator = allocator<_Key>, typename _Allocator = allocator<_Key>,
typename = _RequireAllocator<_Allocator>> typename = _RequireNotAllocator<_Compare>,
multiset(initializer_list<_Key>, typename = _RequireAllocator<_Allocator>>
_Compare = _Compare(), _Allocator = _Allocator()) multiset(initializer_list<_Key>,
-> multiset<_Key, _Compare, _Allocator>; _Compare = _Compare(), _Allocator = _Allocator())
-> multiset<_Key, _Compare, _Allocator>;
template<typename _InputIterator, typename _Allocator, template<typename _InputIterator, typename _Allocator,
typename = _RequireInputIter<_InputIterator>, typename = _RequireInputIter<_InputIterator>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
multiset(_InputIterator, _InputIterator, _Allocator) multiset(_InputIterator, _InputIterator, _Allocator)
-> multiset<typename iterator_traits<_InputIterator>::value_type, -> multiset<typename iterator_traits<_InputIterator>::value_type,
less<typename iterator_traits<_InputIterator>::value_type>, less<typename iterator_traits<_InputIterator>::value_type>,
_Allocator>; _Allocator>;
template<typename _Key, typename _Allocator, template<typename _Key, typename _Allocator,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
multiset(initializer_list<_Key>, _Allocator) multiset(initializer_list<_Key>, _Allocator)
-> multiset<_Key, less<_Key>, _Allocator>; -> multiset<_Key, less<_Key>, _Allocator>;
#endif #endif

42
libstdc++-v3/include/debug/set.h
View File

@ -567,31 +567,33 @@ namespace __debug
typename _Allocator = typename _Allocator =
allocator<typename iterator_traits<_InputIterator>::value_type>, allocator<typename iterator_traits<_InputIterator>::value_type>,
typename = _RequireInputIter<_InputIterator>, typename = _RequireInputIter<_InputIterator>,
typename = _RequireNotAllocator<_Compare>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
set(_InputIterator, _InputIterator, set(_InputIterator, _InputIterator,
_Compare = _Compare(), _Allocator = _Allocator()) _Compare = _Compare(), _Allocator = _Allocator())
-> set<typename iterator_traits<_InputIterator>::value_type, -> set<typename iterator_traits<_InputIterator>::value_type,
_Compare, _Allocator>; _Compare, _Allocator>;
template<typename _Key, typename _Compare = less<_Key>, template<typename _Key, typename _Compare = less<_Key>,
typename _Allocator = allocator<_Key>, typename _Allocator = allocator<_Key>,
typename = _RequireAllocator<_Allocator>> typename = _RequireNotAllocator<_Compare>,
set(initializer_list<_Key>, typename = _RequireAllocator<_Allocator>>
_Compare = _Compare(), _Allocator = _Allocator()) set(initializer_list<_Key>,
-> set<_Key, _Compare, _Allocator>; _Compare = _Compare(), _Allocator = _Allocator())
-> set<_Key, _Compare, _Allocator>;
template<typename _InputIterator, typename _Allocator, template<typename _InputIterator, typename _Allocator,
typename = _RequireInputIter<_InputIterator>, typename = _RequireInputIter<_InputIterator>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
set(_InputIterator, _InputIterator, _Allocator) set(_InputIterator, _InputIterator, _Allocator)
-> set<typename iterator_traits<_InputIterator>::value_type, -> set<typename iterator_traits<_InputIterator>::value_type,
less<typename iterator_traits<_InputIterator>::value_type>, less<typename iterator_traits<_InputIterator>::value_type>,
_Allocator>; _Allocator>;
template<typename _Key, typename _Allocator, template<typename _Key, typename _Allocator,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
set(initializer_list<_Key>, _Allocator) set(initializer_list<_Key>, _Allocator)
-> set<_Key, less<_Key>, _Allocator>; -> set<_Key, less<_Key>, _Allocator>;
#endif #endif

15
libstdc++-v3/include/debug/unordered_map
View File

@ -651,6 +651,8 @@ namespace __debug
typename _Pred = equal_to<__iter_key_t<_InputIterator>>, typename _Pred = equal_to<__iter_key_t<_InputIterator>>,
typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>, typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>,
typename = _RequireInputIter<_InputIterator>, typename = _RequireInputIter<_InputIterator>,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireNotAllocator<_Pred>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_map(_InputIterator, _InputIterator, unordered_map(_InputIterator, _InputIterator,
typename unordered_map<int, int>::size_type = {}, typename unordered_map<int, int>::size_type = {},
@ -662,6 +664,8 @@ namespace __debug
template<typename _Key, typename _Tp, typename _Hash = hash<_Key>, template<typename _Key, typename _Tp, typename _Hash = hash<_Key>,
typename _Pred = equal_to<_Key>, typename _Pred = equal_to<_Key>,
typename _Allocator = allocator<pair<const _Key, _Tp>>, typename _Allocator = allocator<pair<const _Key, _Tp>>,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireNotAllocator<_Pred>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_map(initializer_list<pair<_Key, _Tp>>, unordered_map(initializer_list<pair<_Key, _Tp>>,
typename unordered_map<int, int>::size_type = {}, typename unordered_map<int, int>::size_type = {},
@ -691,6 +695,7 @@ namespace __debug
template<typename _InputIterator, typename _Hash, typename _Allocator, template<typename _InputIterator, typename _Hash, typename _Allocator,
typename = _RequireInputIter<_InputIterator>, typename = _RequireInputIter<_InputIterator>,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_map(_InputIterator, _InputIterator, unordered_map(_InputIterator, _InputIterator,
typename unordered_map<int, int>::size_type, typename unordered_map<int, int>::size_type,
@ -712,6 +717,7 @@ namespace __debug
-> unordered_map<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>; -> unordered_map<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;
template<typename _Key, typename _Tp, typename _Hash, typename _Allocator, template<typename _Key, typename _Tp, typename _Hash, typename _Allocator,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_map(initializer_list<pair<_Key, _Tp>>, unordered_map(initializer_list<pair<_Key, _Tp>>,
typename unordered_map<int, int>::size_type, typename unordered_map<int, int>::size_type,
@ -752,7 +758,8 @@ namespace __debug
: public __gnu_debug::_Safe_container< : public __gnu_debug::_Safe_container<
unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>, _Alloc, unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>, _Alloc,
__gnu_debug::_Safe_unordered_container>, __gnu_debug::_Safe_unordered_container>,
public _GLIBCXX_STD_C::unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc> public _GLIBCXX_STD_C::unordered_multimap<
_Key, _Tp, _Hash, _Pred, _Alloc>
{ {
typedef _GLIBCXX_STD_C::unordered_multimap<_Key, _Tp, _Hash, typedef _GLIBCXX_STD_C::unordered_multimap<_Key, _Tp, _Hash,
_Pred, _Alloc> _Base; _Pred, _Alloc> _Base;
@ -1250,6 +1257,8 @@ namespace __debug
typename _Pred = equal_to<__iter_key_t<_InputIterator>>, typename _Pred = equal_to<__iter_key_t<_InputIterator>>,
typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>, typename _Allocator = allocator<__iter_to_alloc_t<_InputIterator>>,
typename = _RequireInputIter<_InputIterator>, typename = _RequireInputIter<_InputIterator>,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireNotAllocator<_Pred>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_multimap(_InputIterator, _InputIterator, unordered_multimap(_InputIterator, _InputIterator,
unordered_multimap<int, int>::size_type = {}, unordered_multimap<int, int>::size_type = {},
@ -1262,6 +1271,8 @@ namespace __debug
template<typename _Key, typename _Tp, typename _Hash = hash<_Key>, template<typename _Key, typename _Tp, typename _Hash = hash<_Key>,
typename _Pred = equal_to<_Key>, typename _Pred = equal_to<_Key>,
typename _Allocator = allocator<pair<const _Key, _Tp>>, typename _Allocator = allocator<pair<const _Key, _Tp>>,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireNotAllocator<_Pred>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_multimap(initializer_list<pair<_Key, _Tp>>, unordered_multimap(initializer_list<pair<_Key, _Tp>>,
unordered_multimap<int, int>::size_type = {}, unordered_multimap<int, int>::size_type = {},
@ -1290,6 +1301,7 @@ namespace __debug
template<typename _InputIterator, typename _Hash, typename _Allocator, template<typename _InputIterator, typename _Hash, typename _Allocator,
typename = _RequireInputIter<_InputIterator>, typename = _RequireInputIter<_InputIterator>,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_multimap(_InputIterator, _InputIterator, unordered_multimap(_InputIterator, _InputIterator,
unordered_multimap<int, int>::size_type, _Hash, unordered_multimap<int, int>::size_type, _Hash,
@ -1311,6 +1323,7 @@ namespace __debug
-> unordered_multimap<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>; -> unordered_multimap<_Key, _Tp, hash<_Key>, equal_to<_Key>, _Allocator>;
template<typename _Key, typename _Tp, typename _Hash, typename _Allocator, template<typename _Key, typename _Tp, typename _Hash, typename _Allocator,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_multimap(initializer_list<pair<_Key, _Tp>>, unordered_multimap(initializer_list<pair<_Key, _Tp>>,
unordered_multimap<int, int>::size_type, unordered_multimap<int, int>::size_type,

24
libstdc++-v3/include/debug/unordered_set
View File

@ -533,12 +533,14 @@ namespace __debug
template<typename _InputIterator, template<typename _InputIterator,
typename _Hash = typename _Hash =
hash<typename iterator_traits<_InputIterator>::value_type>, hash<typename iterator_traits<_InputIterator>::value_type>,
typename _Pred = typename _Pred =
equal_to<typename iterator_traits<_InputIterator>::value_type>, equal_to<typename iterator_traits<_InputIterator>::value_type>,
typename _Allocator = typename _Allocator =
allocator<typename iterator_traits<_InputIterator>::value_type>, allocator<typename iterator_traits<_InputIterator>::value_type>,
typename = _RequireInputIter<_InputIterator>, typename = _RequireInputIter<_InputIterator>,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireNotAllocator<_Pred>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_set(_InputIterator, _InputIterator, unordered_set(_InputIterator, _InputIterator,
unordered_set<int>::size_type = {}, unordered_set<int>::size_type = {},
@ -549,6 +551,8 @@ namespace __debug
template<typename _Tp, typename _Hash = hash<_Tp>, template<typename _Tp, typename _Hash = hash<_Tp>,
typename _Pred = equal_to<_Tp>, typename _Pred = equal_to<_Tp>,
typename _Allocator = allocator<_Tp>, typename _Allocator = allocator<_Tp>,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireNotAllocator<_Pred>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_set(initializer_list<_Tp>, unordered_set(initializer_list<_Tp>,
unordered_set<int>::size_type = {}, unordered_set<int>::size_type = {},
@ -569,6 +573,7 @@ namespace __debug
template<typename _InputIterator, typename _Hash, typename _Allocator, template<typename _InputIterator, typename _Hash, typename _Allocator,
typename = _RequireInputIter<_InputIterator>, typename = _RequireInputIter<_InputIterator>,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_set(_InputIterator, _InputIterator, unordered_set(_InputIterator, _InputIterator,
unordered_set<int>::size_type, unordered_set<int>::size_type,
@ -586,6 +591,7 @@ namespace __debug
-> unordered_set<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>; -> unordered_set<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
template<typename _Tp, typename _Hash, typename _Allocator, template<typename _Tp, typename _Hash, typename _Allocator,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_set(initializer_list<_Tp>, unordered_set(initializer_list<_Tp>,
unordered_set<int>::size_type, _Hash, _Allocator) unordered_set<int>::size_type, _Hash, _Allocator)
@ -1087,12 +1093,14 @@ namespace __debug
template<typename _InputIterator, template<typename _InputIterator,
typename _Hash = typename _Hash =
hash<typename iterator_traits<_InputIterator>::value_type>, hash<typename iterator_traits<_InputIterator>::value_type>,
typename _Pred = typename _Pred =
equal_to<typename iterator_traits<_InputIterator>::value_type>, equal_to<typename iterator_traits<_InputIterator>::value_type>,
typename _Allocator = typename _Allocator =
allocator<typename iterator_traits<_InputIterator>::value_type>, allocator<typename iterator_traits<_InputIterator>::value_type>,
typename = _RequireInputIter<_InputIterator>, typename = _RequireInputIter<_InputIterator>,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireNotAllocator<_Pred>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_multiset(_InputIterator, _InputIterator, unordered_multiset(_InputIterator, _InputIterator,
unordered_multiset<int>::size_type = {}, unordered_multiset<int>::size_type = {},
@ -1104,6 +1112,8 @@ namespace __debug
template<typename _Tp, typename _Hash = hash<_Tp>, template<typename _Tp, typename _Hash = hash<_Tp>,
typename _Pred = equal_to<_Tp>, typename _Pred = equal_to<_Tp>,
typename _Allocator = allocator<_Tp>, typename _Allocator = allocator<_Tp>,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireNotAllocator<_Pred>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_multiset(initializer_list<_Tp>, unordered_multiset(initializer_list<_Tp>,
unordered_multiset<int>::size_type = {}, unordered_multiset<int>::size_type = {},
@ -1125,6 +1135,7 @@ namespace __debug
template<typename _InputIterator, typename _Hash, typename _Allocator, template<typename _InputIterator, typename _Hash, typename _Allocator,
typename = _RequireInputIter<_InputIterator>, typename = _RequireInputIter<_InputIterator>,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_multiset(_InputIterator, _InputIterator, unordered_multiset(_InputIterator, _InputIterator,
unordered_multiset<int>::size_type, unordered_multiset<int>::size_type,
@ -1144,6 +1155,7 @@ namespace __debug
-> unordered_multiset<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>; -> unordered_multiset<_Tp, hash<_Tp>, equal_to<_Tp>, _Allocator>;
template<typename _Tp, typename _Hash, typename _Allocator, template<typename _Tp, typename _Hash, typename _Allocator,
typename = _RequireNotAllocatorOrIntegral<_Hash>,
typename = _RequireAllocator<_Allocator>> typename = _RequireAllocator<_Allocator>>
unordered_multiset(initializer_list<_Tp>, unordered_multiset(initializer_list<_Tp>,
unordered_multiset<int>::size_type, _Hash, _Allocator) unordered_multiset<int>::size_type, _Hash, _Allocator)