tmp/tmpoz8gxqq5/{from.md → to.md}
RENAMED
|
@@ -1,11 +1,10 @@
|
|
| 1 |
#### Constructors <a id="unord.multiset.cnstr">[[unord.multiset.cnstr]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
-
unordered_multiset() : unordered_multiset(size_type(see below)) { }
|
| 5 |
-
explicit unordered_multiset(size_type n,
|
| 6 |
-
const hasher& hf = hasher(),
|
| 7 |
const key_equal& eql = key_equal(),
|
| 8 |
const allocator_type& a = allocator_type());
|
| 9 |
```
|
| 10 |
|
| 11 |
*Effects:* Constructs an empty `unordered_multiset` using the specified
|
|
@@ -15,24 +14,21 @@ hash function, key equality predicate, and allocator, and using at least
|
|
| 15 |
|
| 16 |
*Complexity:* Constant.
|
| 17 |
|
| 18 |
``` cpp
|
| 19 |
template<class InputIterator>
|
| 20 |
-
unordered_multiset(InputIterator f, InputIterator l,
|
| 21 |
-
|
| 22 |
-
const hasher& hf = hasher(),
|
| 23 |
const key_equal& eql = key_equal(),
|
| 24 |
const allocator_type& a = allocator_type());
|
| 25 |
template<container-compatible-range<value_type> R>
|
| 26 |
-
unordered_multiset(from_range_t, R&& rg,
|
| 27 |
-
|
| 28 |
-
const hasher& hf = hasher(),
|
| 29 |
const key_equal& eql = key_equal(),
|
| 30 |
const allocator_type& a = allocator_type());
|
| 31 |
-
unordered_multiset(initializer_list<value_type> il,
|
| 32 |
-
|
| 33 |
-
const hasher& hf = hasher(),
|
| 34 |
const key_equal& eql = key_equal(),
|
| 35 |
const allocator_type& a = allocator_type());
|
| 36 |
```
|
| 37 |
|
| 38 |
*Effects:* Constructs an empty `unordered_multiset` using the specified
|
|
|
|
| 1 |
#### Constructors <a id="unord.multiset.cnstr">[[unord.multiset.cnstr]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
+
constexpr unordered_multiset() : unordered_multiset(size_type(see below)) { }
|
| 5 |
+
constexpr explicit unordered_multiset(size_type n, const hasher& hf = hasher(),
|
|
|
|
| 6 |
const key_equal& eql = key_equal(),
|
| 7 |
const allocator_type& a = allocator_type());
|
| 8 |
```
|
| 9 |
|
| 10 |
*Effects:* Constructs an empty `unordered_multiset` using the specified
|
|
|
|
| 14 |
|
| 15 |
*Complexity:* Constant.
|
| 16 |
|
| 17 |
``` cpp
|
| 18 |
template<class InputIterator>
|
| 19 |
+
constexpr unordered_multiset(InputIterator f, InputIterator l,
|
| 20 |
+
size_type n = see below, const hasher& hf = hasher(),
|
|
|
|
| 21 |
const key_equal& eql = key_equal(),
|
| 22 |
const allocator_type& a = allocator_type());
|
| 23 |
template<container-compatible-range<value_type> R>
|
| 24 |
+
constexpr unordered_multiset(from_range_t, R&& rg,
|
| 25 |
+
size_type n = see below, const hasher& hf = hasher(),
|
|
|
|
| 26 |
const key_equal& eql = key_equal(),
|
| 27 |
const allocator_type& a = allocator_type());
|
| 28 |
+
constexpr unordered_multiset(initializer_list<value_type> il,
|
| 29 |
+
size_type n = see below, const hasher& hf = hasher(),
|
|
|
|
| 30 |
const key_equal& eql = key_equal(),
|
| 31 |
const allocator_type& a = allocator_type());
|
| 32 |
```
|
| 33 |
|
| 34 |
*Effects:* Constructs an empty `unordered_multiset` using the specified
|