Part 8 of LWG Issue 2210' unordered_set and unordered multiset; this got missed when I went on vacation
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@191705 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -68,6 +68,16 @@ public:
|
||||
unordered_set(initializer_list<value_type>, size_type n = 0,
|
||||
const hasher& hf = hasher(), const key_equal& eql = key_equal(),
|
||||
const allocator_type& a = allocator_type());
|
||||
unordered_set(size_type n, const allocator_type& a); // C++14
|
||||
unordered_set(size_type n, const hasher& hf, const allocator_type& a); // C++14
|
||||
template <class InputIterator>
|
||||
unordered_set(InputIterator f, InputIterator l, size_type n, const allocator_type& a); // C++14
|
||||
template <class InputIterator>
|
||||
unordered_set(InputIterator f, InputIterator l, size_type n,
|
||||
const hasher& hf, const allocator_type& a); // C++14
|
||||
unordered_set(initializer_list<value_type> il, size_type n, const allocator_type& a); // C++14
|
||||
unordered_set(initializer_list<value_type> il, size_type n,
|
||||
const hasher& hf, const allocator_type& a); // C++14
|
||||
~unordered_set();
|
||||
unordered_set& operator=(const unordered_set&);
|
||||
unordered_set& operator=(unordered_set&&)
|
||||
@@ -207,6 +217,16 @@ public:
|
||||
unordered_multiset(initializer_list<value_type>, size_type n = /see below/,
|
||||
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); // C++14
|
||||
unordered_multiset(size_type n, const hasher& hf, const allocator_type& a); // C++14
|
||||
template <class InputIterator>
|
||||
unordered_multiset(InputIterator f, InputIterator l, size_type n, const allocator_type& a); // C++14
|
||||
template <class InputIterator>
|
||||
unordered_multiset(InputIterator f, InputIterator l, size_type n,
|
||||
const hasher& hf, const allocator_type& a); // C++14
|
||||
unordered_multiset(initializer_list<value_type> il, size_type n, const allocator_type& a); // C++14
|
||||
unordered_multiset(initializer_list<value_type> il, size_type n,
|
||||
const hasher& hf, const allocator_type& a); // C++14
|
||||
~unordered_multiset();
|
||||
unordered_multiset& operator=(const unordered_multiset&);
|
||||
unordered_multiset& operator=(unordered_multiset&&)
|
||||
@@ -353,6 +373,14 @@ public:
|
||||
}
|
||||
explicit unordered_set(size_type __n, const hasher& __hf = hasher(),
|
||||
const key_equal& __eql = key_equal());
|
||||
#if _LIBCPP_STD_VER > 11
|
||||
inline _LIBCPP_INLINE_VISIBILITY
|
||||
unordered_set(size_type __n, const allocator_type& __a)
|
||||
: unordered_set(__n, hasher(), key_equal(), __a) {}
|
||||
inline _LIBCPP_INLINE_VISIBILITY
|
||||
unordered_set(size_type __n, const hasher& __hf, const allocator_type& __a)
|
||||
: unordered_set(__n, __hf, key_equal(), __a) {}
|
||||
#endif
|
||||
unordered_set(size_type __n, const hasher& __hf, const key_equal& __eql,
|
||||
const allocator_type& __a);
|
||||
template <class _InputIterator>
|
||||
@@ -365,6 +393,17 @@ public:
|
||||
unordered_set(_InputIterator __first, _InputIterator __last,
|
||||
size_type __n, const hasher& __hf, const key_equal& __eql,
|
||||
const allocator_type& __a);
|
||||
#if _LIBCPP_STD_VER > 11
|
||||
template <class _InputIterator>
|
||||
inline _LIBCPP_INLINE_VISIBILITY
|
||||
unordered_set(_InputIterator __first, _InputIterator __last,
|
||||
size_type __n, const allocator_type& __a)
|
||||
: unordered_set(__first, __last, __n, hasher(), key_equal(), __a) {}
|
||||
template <class _InputIterator>
|
||||
unordered_set(_InputIterator __first, _InputIterator __last,
|
||||
size_type __n, const hasher& __hf, const allocator_type& __a)
|
||||
: unordered_set(__first, __last, __n, __hf, key_equal(), __a) {}
|
||||
#endif
|
||||
explicit unordered_set(const allocator_type& __a);
|
||||
unordered_set(const unordered_set& __u);
|
||||
unordered_set(const unordered_set& __u, const allocator_type& __a);
|
||||
@@ -381,6 +420,16 @@ public:
|
||||
unordered_set(initializer_list<value_type> __il, size_type __n,
|
||||
const hasher& __hf, const key_equal& __eql,
|
||||
const allocator_type& __a);
|
||||
#if _LIBCPP_STD_VER > 11
|
||||
inline _LIBCPP_INLINE_VISIBILITY
|
||||
unordered_set(initializer_list<value_type> __il, size_type __n,
|
||||
const allocator_type& __a)
|
||||
: unordered_set(__il, __n, hasher(), key_equal(), __a) {}
|
||||
inline _LIBCPP_INLINE_VISIBILITY
|
||||
unordered_set(initializer_list<value_type> __il, size_type __n,
|
||||
const hasher& __hf, const allocator_type& __a)
|
||||
: unordered_set(__il, __n, __hf, key_equal(), __a) {}
|
||||
#endif
|
||||
#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
|
||||
// ~unordered_set() = default;
|
||||
_LIBCPP_INLINE_VISIBILITY
|
||||
@@ -861,6 +910,14 @@ public:
|
||||
const key_equal& __eql = key_equal());
|
||||
unordered_multiset(size_type __n, const hasher& __hf,
|
||||
const key_equal& __eql, const allocator_type& __a);
|
||||
#if _LIBCPP_STD_VER > 11
|
||||
inline _LIBCPP_INLINE_VISIBILITY
|
||||
unordered_multiset(size_type __n, const allocator_type& __a)
|
||||
: unordered_multiset(__n, hasher(), key_equal(), __a) {}
|
||||
inline _LIBCPP_INLINE_VISIBILITY
|
||||
unordered_multiset(size_type __n, const hasher& __hf, const allocator_type& __a)
|
||||
: unordered_multiset(__n, __hf, key_equal(), __a) {}
|
||||
#endif
|
||||
template <class _InputIterator>
|
||||
unordered_multiset(_InputIterator __first, _InputIterator __last);
|
||||
template <class _InputIterator>
|
||||
@@ -871,6 +928,18 @@ public:
|
||||
unordered_multiset(_InputIterator __first, _InputIterator __last,
|
||||
size_type __n , const hasher& __hf,
|
||||
const key_equal& __eql, const allocator_type& __a);
|
||||
#if _LIBCPP_STD_VER > 11
|
||||
template <class _InputIterator>
|
||||
inline _LIBCPP_INLINE_VISIBILITY
|
||||
unordered_multiset(_InputIterator __first, _InputIterator __last,
|
||||
size_type __n, const allocator_type& __a)
|
||||
: unordered_multiset(__first, __last, __n, hasher(), key_equal(), __a) {}
|
||||
template <class _InputIterator>
|
||||
inline _LIBCPP_INLINE_VISIBILITY
|
||||
unordered_multiset(_InputIterator __first, _InputIterator __last,
|
||||
size_type __n, const hasher& __hf, const allocator_type& __a)
|
||||
: unordered_multiset(__first, __last, __n, __hf, key_equal(), __a) {}
|
||||
#endif
|
||||
explicit unordered_multiset(const allocator_type& __a);
|
||||
unordered_multiset(const unordered_multiset& __u);
|
||||
unordered_multiset(const unordered_multiset& __u, const allocator_type& __a);
|
||||
@@ -887,6 +956,14 @@ public:
|
||||
unordered_multiset(initializer_list<value_type> __il, size_type __n,
|
||||
const hasher& __hf, const key_equal& __eql,
|
||||
const allocator_type& __a);
|
||||
#if _LIBCPP_STD_VER > 11
|
||||
inline _LIBCPP_INLINE_VISIBILITY
|
||||
unordered_multiset(initializer_list<value_type> __il, size_type __n, const allocator_type& __a)
|
||||
: unordered_multiset(__il, __n, hasher(), key_equal(), __a) {}
|
||||
inline _LIBCPP_INLINE_VISIBILITY
|
||||
unordered_multiset(initializer_list<value_type> __il, size_type __n, const hasher& __hf, const allocator_type& __a)
|
||||
: unordered_multiset(__il, __n, __hf, key_equal(), __a) {}
|
||||
#endif
|
||||
#endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
|
||||
// ~unordered_multiset() = default;
|
||||
_LIBCPP_INLINE_VISIBILITY
|
||||
|
Reference in New Issue
Block a user