tmp/tmpo_ll8q5y/{from.md → to.md}
RENAMED
|
@@ -1,13 +1,12 @@
|
|
| 1 |
#### `set` constructors, copy, and assignment <a id="set.cons">[[set.cons]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
-
explicit set(const Compare& comp,
|
| 5 |
-
const Allocator& = Allocator());
|
| 6 |
```
|
| 7 |
|
| 8 |
-
*Effects:* Constructs an empty set using the specified comparison
|
| 9 |
objects and allocator.
|
| 10 |
|
| 11 |
*Complexity:* Constant.
|
| 12 |
|
| 13 |
``` cpp
|
|
@@ -18,11 +17,8 @@ template <class InputIterator>
|
|
| 18 |
|
| 19 |
*Effects:* Constructs an empty `set` using the specified comparison
|
| 20 |
object and allocator, and inserts elements from the range \[`first`,
|
| 21 |
`last`).
|
| 22 |
|
| 23 |
-
*Requires:* If the iterator’s indirection operator returns an lvalue or
|
| 24 |
-
a non-const rvalue, then `Key` shall be `CopyInsertable` into `*this`.
|
| 25 |
-
|
| 26 |
*Complexity:* Linear in N if the range \[`first`, `last`) is already
|
| 27 |
sorted using `comp` and otherwise N log N, where N is `last - first`.
|
| 28 |
|
|
|
|
| 1 |
#### `set` constructors, copy, and assignment <a id="set.cons">[[set.cons]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
+
explicit set(const Compare& comp, const Allocator& = Allocator());
|
|
|
|
| 5 |
```
|
| 6 |
|
| 7 |
+
*Effects:* Constructs an empty `set` using the specified comparison
|
| 8 |
objects and allocator.
|
| 9 |
|
| 10 |
*Complexity:* Constant.
|
| 11 |
|
| 12 |
``` cpp
|
|
|
|
| 17 |
|
| 18 |
*Effects:* Constructs an empty `set` using the specified comparison
|
| 19 |
object and allocator, and inserts elements from the range \[`first`,
|
| 20 |
`last`).
|
| 21 |
|
|
|
|
|
|
|
|
|
|
| 22 |
*Complexity:* Linear in N if the range \[`first`, `last`) is already
|
| 23 |
sorted using `comp` and otherwise N log N, where N is `last - first`.
|
| 24 |
|