tmp/tmpp6wgi1yz/{from.md → to.md}
RENAMED
|
@@ -5,30 +5,36 @@ iterator insert(const_iterator position, const T& x);
|
|
| 5 |
iterator insert(const_iterator position, T&& x);
|
| 6 |
iterator insert(const_iterator position, size_type n, const T& x);
|
| 7 |
template<class InputIterator>
|
| 8 |
iterator insert(const_iterator position, InputIterator first,
|
| 9 |
InputIterator last);
|
|
|
|
|
|
|
| 10 |
iterator insert(const_iterator position, initializer_list<T>);
|
| 11 |
|
| 12 |
template<class... Args> reference emplace_front(Args&&... args);
|
| 13 |
template<class... Args> reference emplace_back(Args&&... args);
|
| 14 |
template<class... Args> iterator emplace(const_iterator position, Args&&... args);
|
| 15 |
void push_front(const T& x);
|
| 16 |
void push_front(T&& x);
|
|
|
|
|
|
|
| 17 |
void push_back(const T& x);
|
| 18 |
void push_back(T&& x);
|
|
|
|
|
|
|
| 19 |
```
|
| 20 |
|
| 21 |
-
*Remarks:* Does not affect the validity of iterators and references. If
|
| 22 |
-
an exception is thrown there are no effects.
|
| 23 |
-
|
| 24 |
*Complexity:* Insertion of a single element into a list takes constant
|
| 25 |
time and exactly one call to a constructor of `T`. Insertion of multiple
|
| 26 |
elements into a list is linear in the number of elements inserted, and
|
| 27 |
the number of calls to the copy constructor or move constructor of `T`
|
| 28 |
is exactly equal to the number of elements inserted.
|
| 29 |
|
|
|
|
|
|
|
|
|
|
| 30 |
``` cpp
|
| 31 |
iterator erase(const_iterator position);
|
| 32 |
iterator erase(const_iterator first, const_iterator last);
|
| 33 |
|
| 34 |
void pop_front();
|
|
|
|
| 5 |
iterator insert(const_iterator position, T&& x);
|
| 6 |
iterator insert(const_iterator position, size_type n, const T& x);
|
| 7 |
template<class InputIterator>
|
| 8 |
iterator insert(const_iterator position, InputIterator first,
|
| 9 |
InputIterator last);
|
| 10 |
+
template<container-compatible-range<T> R>
|
| 11 |
+
iterator insert_range(const_iterator position, R&& rg);
|
| 12 |
iterator insert(const_iterator position, initializer_list<T>);
|
| 13 |
|
| 14 |
template<class... Args> reference emplace_front(Args&&... args);
|
| 15 |
template<class... Args> reference emplace_back(Args&&... args);
|
| 16 |
template<class... Args> iterator emplace(const_iterator position, Args&&... args);
|
| 17 |
void push_front(const T& x);
|
| 18 |
void push_front(T&& x);
|
| 19 |
+
template<container-compatible-range<T> R>
|
| 20 |
+
void prepend_range(R&& rg);
|
| 21 |
void push_back(const T& x);
|
| 22 |
void push_back(T&& x);
|
| 23 |
+
template<container-compatible-range<T> R>
|
| 24 |
+
void append_range(R&& rg);
|
| 25 |
```
|
| 26 |
|
|
|
|
|
|
|
|
|
|
| 27 |
*Complexity:* Insertion of a single element into a list takes constant
|
| 28 |
time and exactly one call to a constructor of `T`. Insertion of multiple
|
| 29 |
elements into a list is linear in the number of elements inserted, and
|
| 30 |
the number of calls to the copy constructor or move constructor of `T`
|
| 31 |
is exactly equal to the number of elements inserted.
|
| 32 |
|
| 33 |
+
*Remarks:* Does not affect the validity of iterators and references. If
|
| 34 |
+
an exception is thrown there are no effects.
|
| 35 |
+
|
| 36 |
``` cpp
|
| 37 |
iterator erase(const_iterator position);
|
| 38 |
iterator erase(const_iterator first, const_iterator last);
|
| 39 |
|
| 40 |
void pop_front();
|