tmp/tmp2bhtyj3r/{from.md → to.md}
RENAMED
|
@@ -20,10 +20,16 @@ template<class InputIterator>
|
|
| 20 |
unordered_set(InputIterator f, InputIterator l,
|
| 21 |
size_type n = see below,
|
| 22 |
const hasher& hf = hasher(),
|
| 23 |
const key_equal& eql = key_equal(),
|
| 24 |
const allocator_type& a = allocator_type());
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 25 |
unordered_set(initializer_list<value_type> il,
|
| 26 |
size_type n = see below,
|
| 27 |
const hasher& hf = hasher(),
|
| 28 |
const key_equal& eql = key_equal(),
|
| 29 |
const allocator_type& a = allocator_type());
|
|
@@ -31,10 +37,9 @@ unordered_set(initializer_list<value_type> il,
|
|
| 31 |
|
| 32 |
*Effects:* Constructs an empty `unordered_set` using the specified hash
|
| 33 |
function, key equality predicate, and allocator, and using at least `n`
|
| 34 |
buckets. If `n` is not provided, the number of buckets is
|
| 35 |
*implementation-defined*. Then inserts elements from the range \[`f`,
|
| 36 |
-
`l`)
|
| 37 |
-
for the second form. `max_load_factor()` returns `1.0`.
|
| 38 |
|
| 39 |
*Complexity:* Average case linear, worst case quadratic.
|
| 40 |
|
|
|
|
| 20 |
unordered_set(InputIterator f, InputIterator l,
|
| 21 |
size_type n = see below,
|
| 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 |
+
size_type n = see below,
|
| 28 |
+
const hasher& hf = hasher(),
|
| 29 |
+
const key_equal& eql = key_equal(),
|
| 30 |
+
const allocator_type& a = allocator_type());
|
| 31 |
unordered_set(initializer_list<value_type> il,
|
| 32 |
size_type n = see below,
|
| 33 |
const hasher& hf = hasher(),
|
| 34 |
const key_equal& eql = key_equal(),
|
| 35 |
const allocator_type& a = allocator_type());
|
|
|
|
| 37 |
|
| 38 |
*Effects:* Constructs an empty `unordered_set` using the specified hash
|
| 39 |
function, key equality predicate, and allocator, and using at least `n`
|
| 40 |
buckets. If `n` is not provided, the number of buckets is
|
| 41 |
*implementation-defined*. Then inserts elements from the range \[`f`,
|
| 42 |
+
`l`), `rg`, or `il`, respectively. `max_load_factor()` returns `1.0`.
|
|
|
|
| 43 |
|
| 44 |
*Complexity:* Average case linear, worst case quadratic.
|
| 45 |
|