Difference between revisions of "cpp/container/forward list/insert after"
From cppreference.com
< cpp | container | forward list
(+type reqs) |
Andreas Krug (Talk | contribs) m (@-@ -> @,@, capitalized 1st letter, .) |
||
(15 intermediate revisions by 9 users not shown) | |||
Line 1: | Line 1: | ||
− | {{cpp/container/forward_list/title | insert_after}} | + | {{cpp/container/forward_list/title|insert_after}} |
{{cpp/container/forward_list/navbar}} | {{cpp/container/forward_list/navbar}} | ||
− | {{ | + | {{dcl begin}} |
− | {{ | + | {{dcl|num=1|since=c++11| |
iterator insert_after( const_iterator pos, const T& value ); | iterator insert_after( const_iterator pos, const T& value ); | ||
}} | }} | ||
− | {{ | + | {{dcl|num=2|since=c++11| |
iterator insert_after( const_iterator pos, T&& value ); | iterator insert_after( const_iterator pos, T&& value ); | ||
}} | }} | ||
− | {{ | + | {{dcl|num=3|since=c++11| |
iterator insert_after( const_iterator pos, size_type count, const T& value ); | iterator insert_after( const_iterator pos, size_type count, const T& value ); | ||
}} | }} | ||
− | {{ | + | {{dcl|num=4|since=c++11| |
template< class InputIt > | template< class InputIt > | ||
iterator insert_after( const_iterator pos, InputIt first, InputIt last ); | iterator insert_after( const_iterator pos, InputIt first, InputIt last ); | ||
}} | }} | ||
− | {{ | + | {{dcl|num=5|since=c++11| |
iterator insert_after( const_iterator pos, std::initializer_list<T> ilist ); | iterator insert_after( const_iterator pos, std::initializer_list<T> ilist ); | ||
}} | }} | ||
− | {{ | + | {{dcl end}} |
Inserts elements after the specified position in the container. | Inserts elements after the specified position in the container. | ||
− | + | @1,2@ Inserts {{c|value}} after the element pointed to by {{c|pos}}. | |
− | + | ||
− | + | @3@ Inserts {{c|count}} copies of the {{c|value}} after the element pointed to by {{c|pos}}. | |
− | + | @4@ Inserts elements from range {{range|first|last}} after the element pointed to by {{c|pos}}. | |
+ | The behavior is undefined if {{c|first}} and {{c|last}} are iterators into {{c|*this}}. | ||
− | + | @5@ Inserts elements from initializer list {{c|ilist}}. | |
− | + | ||
− | {{cpp/container/note_iterator_invalidation| | + | {{cpp/container/note_iterator_invalidation|forward_list|insert_after}} |
===Parameters=== | ===Parameters=== | ||
− | {{ | + | {{par begin}} |
− | {{ | + | {{par|pos|iterator after which the content will be inserted}} |
− | {{ | + | {{par|value|element value to insert}} |
− | {{ | + | {{par|count|number of copies to insert}} |
− | {{ | + | {{par|first, last|the range of elements to insert}} |
− | {{ | + | {{par|ilist|initializer list to insert the values from}} |
− | {{ | + | {{par hreq}} |
− | {{ | + | {{par req named|InputIt|InputIterator}} |
+ | {{par end}} | ||
===Return value=== | ===Return value=== | ||
− | Iterator to the inserted element. | + | @1,2@ Iterator to the inserted element. |
+ | @3@ Iterator to the last element inserted, or {{c|pos}} if {{c|1=count == 0}}. | ||
+ | @4@ Iterator to the last element inserted, or {{c|pos}} if {{c|1=first == last}}. | ||
+ | @5@ Iterator to the last element inserted, or {{c|pos}} if {{c|ilist}} is empty. | ||
+ | |||
+ | ===Exceptions=== | ||
+ | {{cpp/strong exception safety guarantee|plural=yes}} | ||
===Complexity=== | ===Complexity=== | ||
+ | @1,2@ Constant. | ||
+ | @3@ Linear in {{c|count}}. | ||
+ | @4@ Linear in {{c|std::distance(first, last)}}. | ||
+ | @5@ Linear in {{c|ilist.size()}}. | ||
− | {{ | + | ===Example=== |
+ | {{example | ||
+ | |code= | ||
+ | #include <forward_list> | ||
+ | #include <iostream> | ||
+ | #include <string> | ||
+ | #include <vector> | ||
+ | |||
+ | void print(const std::forward_list<int>& list) | ||
+ | { | ||
+ | std::cout << "list: {"; | ||
+ | for (char comma[3] = {'\0', ' ', '\0'}; int i : list) | ||
+ | { | ||
+ | std::cout << comma << i; | ||
+ | comma[0] = ','; | ||
+ | } | ||
+ | std::cout << "}\n"; | ||
+ | } | ||
+ | |||
+ | int main() | ||
+ | { | ||
+ | std::forward_list<int> ints{1, 2, 3, 4, 5}; | ||
+ | print(ints); | ||
+ | |||
+ | // insert_after (2) | ||
+ | auto beginIt = ints.begin(); | ||
+ | ints.insert_after(beginIt, -6); | ||
+ | print(ints); | ||
+ | |||
+ | // insert_after (3) | ||
+ | auto anotherIt = beginIt; | ||
+ | ++anotherIt; | ||
+ | anotherIt = ints.insert_after(anotherIt, 2, -7); | ||
+ | print(ints); | ||
+ | |||
+ | // insert_after (4) | ||
+ | const std::vector<int> v = {-8, -9, -10}; | ||
+ | anotherIt = ints.insert_after(anotherIt, v.cbegin(), v.cend()); | ||
+ | print(ints); | ||
+ | |||
+ | // insert_after (5) | ||
+ | ints.insert_after(anotherIt, {-11, -12, -13, -14}); | ||
+ | print(ints); | ||
+ | } | ||
+ | |output= | ||
+ | list: {1, 2, 3, 4, 5} | ||
+ | list: {1, -6, 2, 3, 4, 5} | ||
+ | list: {1, -6, -7, -7, 2, 3, 4, 5} | ||
+ | list: {1, -6, -7, -7, -8, -9, -10, 2, 3, 4, 5} | ||
+ | list: {1, -6, -7, -7, -8, -9, -10, -11, -12, -13, -14, 2, 3, 4, 5} | ||
+ | }} | ||
===See also=== | ===See also=== | ||
− | {{ | + | {{dsc begin}} |
− | {{ | + | {{dsc inc|cpp/container/dsc emplace after|forward_list}} |
− | {{ | + | {{dsc inc|cpp/container/dsc push_front|forward_list}} |
− | {{ | + | {{dsc end}} |
+ | |||
+ | {{langlinks|de|es|fr|it|ja|pl|pt|ru|zh}} |
Latest revision as of 01:22, 30 August 2023
iterator insert_after( const_iterator pos, const T& value ); |
(1) | (since C++11) |
iterator insert_after( const_iterator pos, T&& value ); |
(2) | (since C++11) |
iterator insert_after( const_iterator pos, size_type count, const T& value ); |
(3) | (since C++11) |
template< class InputIt > iterator insert_after( const_iterator pos, InputIt first, InputIt last ); |
(4) | (since C++11) |
iterator insert_after( const_iterator pos, std::initializer_list<T> ilist ); |
(5) | (since C++11) |
Inserts elements after the specified position in the container.
1,2) Inserts value after the element pointed to by pos.
3) Inserts count copies of the value after the element pointed to by pos.
4) Inserts elements from range
[
first,
last)
after the element pointed to by pos.
The behavior is undefined if first and last are iterators into *this.5) Inserts elements from initializer list ilist.
No iterators or references are invalidated.
Contents |
[edit] Parameters
pos | - | iterator after which the content will be inserted |
value | - | element value to insert |
count | - | number of copies to insert |
first, last | - | the range of elements to insert |
ilist | - | initializer list to insert the values from |
Type requirements | ||
-InputIt must meet the requirements of LegacyInputIterator.
|
[edit] Return value
1,2) Iterator to the inserted element.
3) Iterator to the last element inserted, or pos if count == 0.
4) Iterator to the last element inserted, or pos if first == last.
5) Iterator to the last element inserted, or pos if ilist is empty.
[edit] Exceptions
If an exception is thrown for any reason, these functions have no effect (strong exception safety guarantee).
[edit] Complexity
1,2) Constant.
3) Linear in count.
4) Linear in std::distance(first, last).
5) Linear in ilist.size().
[edit] Example
Run this code
#include <forward_list> #include <iostream> #include <string> #include <vector> void print(const std::forward_list<int>& list) { std::cout << "list: {"; for (char comma[3] = {'\0', ' ', '\0'}; int i : list) { std::cout << comma << i; comma[0] = ','; } std::cout << "}\n"; } int main() { std::forward_list<int> ints{1, 2, 3, 4, 5}; print(ints); // insert_after (2) auto beginIt = ints.begin(); ints.insert_after(beginIt, -6); print(ints); // insert_after (3) auto anotherIt = beginIt; ++anotherIt; anotherIt = ints.insert_after(anotherIt, 2, -7); print(ints); // insert_after (4) const std::vector<int> v = {-8, -9, -10}; anotherIt = ints.insert_after(anotherIt, v.cbegin(), v.cend()); print(ints); // insert_after (5) ints.insert_after(anotherIt, {-11, -12, -13, -14}); print(ints); }
Output:
list: {1, 2, 3, 4, 5} list: {1, -6, 2, 3, 4, 5} list: {1, -6, -7, -7, 2, 3, 4, 5} list: {1, -6, -7, -7, -8, -9, -10, 2, 3, 4, 5} list: {1, -6, -7, -7, -8, -9, -10, -11, -12, -13, -14, 2, 3, 4, 5}
[edit] See also
constructs elements in-place after an element (public member function) | |
inserts an element to the beginning (public member function) |