tmp/tmpbaexxj65/{from.md → to.md}
RENAMED
|
@@ -8,11 +8,11 @@ elements into a `forward_list` is linear in `n`, and the number of calls
|
|
| 8 |
to the copy or move constructor of `T` is exactly equal to `n`. Erasing
|
| 9 |
`n` elements from a `forward_list` is linear in `n` and the number of
|
| 10 |
calls to the destructor of type `T` is exactly equal to `n`.
|
| 11 |
|
| 12 |
``` cpp
|
| 13 |
-
template <class... Args>
|
| 14 |
```
|
| 15 |
|
| 16 |
*Effects:* Inserts an object of type `value_type` constructed with
|
| 17 |
`value_type(std::forward<Args>(args)...)` at the beginning of the list.
|
| 18 |
|
|
@@ -25,11 +25,11 @@ void push_front(T&& x);
|
|
| 25 |
|
| 26 |
``` cpp
|
| 27 |
void pop_front();
|
| 28 |
```
|
| 29 |
|
| 30 |
-
*Effects:* `erase_after(before_begin())`
|
| 31 |
|
| 32 |
``` cpp
|
| 33 |
iterator insert_after(const_iterator position, const T& x);
|
| 34 |
iterator insert_after(const_iterator position, T&& x);
|
| 35 |
```
|
|
@@ -132,14 +132,12 @@ end of the list.
|
|
| 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())`
|
| 138 |
-
|
| 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;
|
|
|
|
| 8 |
to the copy or move constructor of `T` is exactly equal to `n`. Erasing
|
| 9 |
`n` elements from a `forward_list` is linear in `n` and the number of
|
| 10 |
calls to the destructor of type `T` is exactly equal to `n`.
|
| 11 |
|
| 12 |
``` cpp
|
| 13 |
+
template <class... Args> reference emplace_front(Args&&... args);
|
| 14 |
```
|
| 15 |
|
| 16 |
*Effects:* Inserts an object of type `value_type` constructed with
|
| 17 |
`value_type(std::forward<Args>(args)...)` at the beginning of the list.
|
| 18 |
|
|
|
|
| 25 |
|
| 26 |
``` cpp
|
| 27 |
void pop_front();
|
| 28 |
```
|
| 29 |
|
| 30 |
+
*Effects:* As if by `erase_after(before_begin())`.
|
| 31 |
|
| 32 |
``` cpp
|
| 33 |
iterator insert_after(const_iterator position, const T& x);
|
| 34 |
iterator insert_after(const_iterator position, T&& x);
|
| 35 |
```
|
|
|
|
| 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())` copies of `c` at the end of the
|
| 138 |
+
list.
|
|
|
|
|
|
|
| 139 |
|
| 140 |
*Requires:* `T` shall be `CopyInsertable` into `*this`.
|
| 141 |
|
| 142 |
``` cpp
|
| 143 |
void clear() noexcept;
|