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