tmp/tmpjdb5s3bo/{from.md → to.md}
RENAMED
|
@@ -73,11 +73,11 @@ iterator insert_after(const_iterator position, initializer_list<T> il);
|
|
| 73 |
```
|
| 74 |
|
| 75 |
*Effects:* `insert_after(p, il.begin(), il.end())`.
|
| 76 |
|
| 77 |
*Returns:* An iterator pointing to the last inserted element or
|
| 78 |
-
`position` if `
|
| 79 |
|
| 80 |
``` cpp
|
| 81 |
template <class... Args>
|
| 82 |
iterator emplace_after(const_iterator position, Args&&... args);
|
| 83 |
```
|
|
@@ -117,21 +117,31 @@ dereferenceable.
|
|
| 117 |
|
| 118 |
*Throws:* Nothing.
|
| 119 |
|
| 120 |
``` cpp
|
| 121 |
void resize(size_type sz);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 122 |
void resize(size_type sz, const value_type& c);
|
| 123 |
```
|
| 124 |
|
| 125 |
*Effects:* If `sz < distance(begin(), end())`, erases the last
|
| 126 |
`distance(begin(), end()) - sz` elements from the list. Otherwise,
|
| 127 |
-
inserts `sz - distance(begin(), end())` elements at the end of the list
|
| 128 |
-
|
| 129 |
-
|
|
|
|
| 130 |
|
| 131 |
-
*Requires:* `T` shall be `
|
| 132 |
-
it shall be `CopyInsertable` into `*this` for the second form.
|
| 133 |
|
| 134 |
``` cpp
|
| 135 |
void clear() noexcept;
|
| 136 |
```
|
| 137 |
|
|
|
|
| 73 |
```
|
| 74 |
|
| 75 |
*Effects:* `insert_after(p, il.begin(), il.end())`.
|
| 76 |
|
| 77 |
*Returns:* An iterator pointing to the last inserted element or
|
| 78 |
+
`position` if `il` is empty.
|
| 79 |
|
| 80 |
``` cpp
|
| 81 |
template <class... Args>
|
| 82 |
iterator emplace_after(const_iterator position, Args&&... args);
|
| 83 |
```
|
|
|
|
| 117 |
|
| 118 |
*Throws:* Nothing.
|
| 119 |
|
| 120 |
``` cpp
|
| 121 |
void resize(size_type sz);
|
| 122 |
+
```
|
| 123 |
+
|
| 124 |
+
*Effects:* If `sz < distance(begin(), end())`, erases the last
|
| 125 |
+
`distance(begin(), end()) - sz` elements from the list. Otherwise,
|
| 126 |
+
inserts `sz - distance(begin(), end())` default-inserted elements at the
|
| 127 |
+
end of the list.
|
| 128 |
+
|
| 129 |
+
*Requires:* `T` shall be `DefaultInsertable` into `*this`.
|
| 130 |
+
|
| 131 |
+
``` cpp
|
| 132 |
void resize(size_type sz, const value_type& c);
|
| 133 |
```
|
| 134 |
|
| 135 |
*Effects:* If `sz < distance(begin(), end())`, erases the last
|
| 136 |
`distance(begin(), end()) - sz` elements from the list. Otherwise,
|
| 137 |
+
inserts `sz - distance(begin(), end())` elements at the end of the list
|
| 138 |
+
such that each new element, `e`, is initialized by a method equivalent
|
| 139 |
+
to calling
|
| 140 |
+
`allocator_traits<allocator_type>::construct(get_allocator(), std::addressof(e), c)`.
|
| 141 |
|
| 142 |
+
*Requires:* `T` shall be `CopyInsertable` into `*this`.
|
|
|
|
| 143 |
|
| 144 |
``` cpp
|
| 145 |
void clear() noexcept;
|
| 146 |
```
|
| 147 |
|