
- The C Standard Library
- The C Standard Library
- The C++ Standard Library
- C++ Library - Home
- C++ Library - <fstream>
- C++ Library - <iomanip>
- C++ Library - <ios>
- C++ Library - <iosfwd>
- C++ Library - <iostream>
- C++ Library - <istream>
- C++ Library - <ostream>
- C++ Library - <sstream>
- C++ Library - <streambuf>
- C++ Library - <atomic>
- C++ Library - <complex>
- C++ Library - <exception>
- C++ Library - <functional>
- C++ Library - <limits>
- C++ Library - <locale>
- C++ Library - <memory>
- C++ Library - <new>
- C++ Library - <numeric>
- C++ Library - <regex>
- C++ Library - <stdexcept>
- C++ Library - <string>
- C++ Library - <thread>
- C++ Library - <tuple>
- C++ Library - <typeinfo>
- C++ Library - <utility>
- C++ Library - <valarray>
- The C++ STL Library
- C++ Library - <array>
- C++ Library - <bitset>
- C++ Library - <deque>
- C++ Library - <forward_list>
- C++ Library - <list>
- C++ Library - <map>
- C++ Library - <queue>
- C++ Library - <set>
- C++ Library - <stack>
- C++ Library - <unordered_map>
- C++ Library - <unordered_set>
- C++ Library - <vector>
- C++ Library - <algorithm>
- C++ Library - <iterator>
- C++ Programming Resources
- C++ Programming Tutorial
- C++ Useful Resources
- C++ Discussion
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
C++ List Library - insert() Function
Description
The C++ function std::list::insert() extends list by inserting new element in the container. This member function increases size of the list.
Declaration
Following is the declaration for std::list::insert() function form std::list header.
C++11
iterator insert (const_iterator position, value_type&& val);
Parameters
position − Position the list where new element to be inserted.
value − Value to be moved to newly inserted element.
Return value
Returns an iterator which points to the newly inserted element.
Exceptions
If reallocation fails bad_alloc exception is thrown.
Time complexity
Linear i.e. O(n)
Example
The following example shows the usage of std::list::insert() function.
#include <iostream> #include <list> using namespace std; int main(void) { list<int> l1 = {1, 2, 3, 4, 5}; list<int> l2; for (auto it = l1.begin(); it != l1.end(); ++it) l2.insert(l2.end(), move(*it)); cout << "List l2 contains following elements" << endl; for (auto it = l2.begin(); it != l2.end(); ++it) cout << *it << endl; return 0; }
Let us compile and run the above program, this will produce the following result −
List l2 contains following elements 1 2 3 4 5
list.htm
Advertisements