tmp/tmpg48mca1u/{from.md → to.md}
RENAMED
|
@@ -1,9 +1,9 @@
|
|
| 1 |
#### Modifiers <a id="flat.multiset.modifiers">[[flat.multiset.modifiers]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
-
template<class... Args> iterator emplace(Args&&... args);
|
| 5 |
```
|
| 6 |
|
| 7 |
*Constraints:* `is_constructible_v<value_type, Args...>` is `true`.
|
| 8 |
|
| 9 |
*Effects:* First, initializes an object `t` of type `value_type` with
|
|
@@ -16,11 +16,11 @@ c.insert(it, std::move(t));
|
|
| 16 |
|
| 17 |
*Returns:* An iterator that points to the inserted element.
|
| 18 |
|
| 19 |
``` cpp
|
| 20 |
template<class InputIterator>
|
| 21 |
-
void insert(InputIterator first, InputIterator last);
|
| 22 |
```
|
| 23 |
|
| 24 |
*Effects:* Adds elements to *c* as if by:
|
| 25 |
|
| 26 |
``` cpp
|
|
@@ -37,41 +37,41 @@ M is `distance(first, last)`.
|
|
| 37 |
*Remarks:* Since this operation performs an in-place merge, it may
|
| 38 |
allocate memory.
|
| 39 |
|
| 40 |
``` cpp
|
| 41 |
template<class InputIterator>
|
| 42 |
-
void insert(sorted_equivalent_t, InputIterator first, InputIterator last);
|
| 43 |
```
|
| 44 |
|
| 45 |
*Effects:* Equivalent to `insert(first, last)`.
|
| 46 |
|
| 47 |
*Complexity:* Linear.
|
| 48 |
|
| 49 |
``` cpp
|
| 50 |
-
void swap(flat_multiset& y) noexcept;
|
| 51 |
```
|
| 52 |
|
| 53 |
*Effects:* Equivalent to:
|
| 54 |
|
| 55 |
``` cpp
|
| 56 |
ranges::swap(compare, y.compare);
|
| 57 |
ranges::swap(c, y.c);
|
| 58 |
```
|
| 59 |
|
| 60 |
``` cpp
|
| 61 |
-
container_type extract() &&;
|
| 62 |
```
|
| 63 |
|
| 64 |
*Ensures:* `*this` is emptied, even if the function exits via an
|
| 65 |
exception.
|
| 66 |
|
| 67 |
-
*Returns:* `std::move(c)`.
|
| 68 |
|
| 69 |
``` cpp
|
| 70 |
-
void replace(container_type&& cont);
|
| 71 |
```
|
| 72 |
|
| 73 |
*Preconditions:* The elements of `cont` are sorted with respect to
|
| 74 |
*compare*.
|
| 75 |
|
| 76 |
-
*Effects:* Equivalent to: `c = std::move(cont);`
|
| 77 |
|
|
|
|
| 1 |
#### Modifiers <a id="flat.multiset.modifiers">[[flat.multiset.modifiers]]</a>
|
| 2 |
|
| 3 |
``` cpp
|
| 4 |
+
template<class... Args> constexpr iterator emplace(Args&&... args);
|
| 5 |
```
|
| 6 |
|
| 7 |
*Constraints:* `is_constructible_v<value_type, Args...>` is `true`.
|
| 8 |
|
| 9 |
*Effects:* First, initializes an object `t` of type `value_type` with
|
|
|
|
| 16 |
|
| 17 |
*Returns:* An iterator that points to the inserted element.
|
| 18 |
|
| 19 |
``` cpp
|
| 20 |
template<class InputIterator>
|
| 21 |
+
constexpr void insert(InputIterator first, InputIterator last);
|
| 22 |
```
|
| 23 |
|
| 24 |
*Effects:* Adds elements to *c* as if by:
|
| 25 |
|
| 26 |
``` cpp
|
|
|
|
| 37 |
*Remarks:* Since this operation performs an in-place merge, it may
|
| 38 |
allocate memory.
|
| 39 |
|
| 40 |
``` cpp
|
| 41 |
template<class InputIterator>
|
| 42 |
+
constexpr void insert(sorted_equivalent_t, InputIterator first, InputIterator last);
|
| 43 |
```
|
| 44 |
|
| 45 |
*Effects:* Equivalent to `insert(first, last)`.
|
| 46 |
|
| 47 |
*Complexity:* Linear.
|
| 48 |
|
| 49 |
``` cpp
|
| 50 |
+
constexpr void swap(flat_multiset& y) noexcept;
|
| 51 |
```
|
| 52 |
|
| 53 |
*Effects:* Equivalent to:
|
| 54 |
|
| 55 |
``` cpp
|
| 56 |
ranges::swap(compare, y.compare);
|
| 57 |
ranges::swap(c, y.c);
|
| 58 |
```
|
| 59 |
|
| 60 |
``` cpp
|
| 61 |
+
constexpr container_type extract() &&;
|
| 62 |
```
|
| 63 |
|
| 64 |
*Ensures:* `*this` is emptied, even if the function exits via an
|
| 65 |
exception.
|
| 66 |
|
| 67 |
+
*Returns:* `std::move(`*`c`*`)`.
|
| 68 |
|
| 69 |
``` cpp
|
| 70 |
+
constexpr void replace(container_type&& cont);
|
| 71 |
```
|
| 72 |
|
| 73 |
*Preconditions:* The elements of `cont` are sorted with respect to
|
| 74 |
*compare*.
|
| 75 |
|
| 76 |
+
*Effects:* Equivalent to: *`c`*` = std::move(cont);`
|
| 77 |
|