The C++ function std::list::insert() extends iterator by inserting new element at position in list. This member function increases size of the list.
DeclarationFollowing is the declaration for std::list::insert() function form std::list header.
C++98iterator insert (iterator position, const value_type& val);C++11
iterator insert (const_iterator position, const value_type& val);Parameters
position − Position in the list where new element to be inserted.
val − Value to be assigned to newly inserted element.
Returns a random access iterator which points to the newly inserted element.
ExceptionsIf reallocation fails bad_alloc exception is thrown.
Time complexityLinear i.e. O(n)
ExampleThe following example shows the usage of std::list::insert() function.
#include <iostream> #include <list> using namespace std; int main(void) { list<int> l; for (int i = 0; i < 5; ++i) l.insert(l.end(), i + 1); cout << "List contains following elements" << endl; for (auto it = l.begin(); it != l.end(); ++it) cout << *it << endl; return 0; }
Let us compile and run the above program, this will produce the following result −
List contains following elements 1 2 3 4 5
list.htm
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4