tmp/tmpf90bhmwe/{from.md → to.md}
RENAMED
|
@@ -1,17 +1,18 @@
|
|
| 1 |
#### `unordered_set` constructors <a id="unord.set.cnstr">[[unord.set.cnstr]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
-
|
|
|
|
| 5 |
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_set` using the specified hash
|
| 11 |
function, key equality function, and allocator, and using at least *`n`*
|
| 12 |
-
buckets.
|
| 13 |
*implementation-defined*. `max_load_factor()` returns 1.0.
|
| 14 |
|
| 15 |
*Complexity:* Constant.
|
| 16 |
|
| 17 |
``` cpp
|
|
|
|
| 1 |
#### `unordered_set` constructors <a id="unord.set.cnstr">[[unord.set.cnstr]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
+
unordered_set() : unordered_set(size_type(see below)) { }
|
| 5 |
+
explicit unordered_set(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_set` using the specified hash
|
| 12 |
function, key equality function, and allocator, and using at least *`n`*
|
| 13 |
+
buckets. For the default constructor, the number of buckets is
|
| 14 |
*implementation-defined*. `max_load_factor()` returns 1.0.
|
| 15 |
|
| 16 |
*Complexity:* Constant.
|
| 17 |
|
| 18 |
``` cpp
|