std::list::insert

Parameters

position

Position in the container where the new elements are inserted.
iterator is a member type, defined as a bidirectional iterator type that points to elements.

val

Value to be copied (or moved) to the inserted elements.
Member type value_type is the type of the elements in the container, defined in list as an alias of its first template parameter (T).

n

Number of elements to insert. Each element is initialized to a copy of val.
Member type size_type is an unsigned integral type.

first, last

Iterators specifying a range of elements. Copies of the elements in the range [first,last) are inserted at position (in the same order).
Notice that the range includes all the elements between first and last, including the element pointed by first but not the one pointed by last.
The function template argument InputIterator shall be an input iterator type that points to elements of a type from which value_type objects can be constructed.

il

An initializer_list object. Copies of these elements are inserted at position (in the same order).
These objects are automatically constructed from initializer list declarators.
Member type value_type is the type of the elements in the container, defined in list as an alias of its first template parameter (T).

Return value

Example

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34

// inserting into a list
#include <iostream>
#include <list>
#include <vector>
int main ()
{
  std::list<int> mylist;
  std::list<int>::iterator it;
  // set some initial values:
  for (int i=1; i<=5; ++i) mylist.push_back(i); // 1 2 3 4 5
  it = mylist.begin();
  ++it;       // it points now to number 2           ^
  mylist.insert (it,10);                        // 1 10 2 3 4 5
  // "it" still points to number 2                      ^
  mylist.insert (it,2,20);                      // 1 10 20 20 2 3 4 5
  --it;       // it points now to the second 20            ^
  std::vector<int> myvector (2,30);
  mylist.insert (it,myvector.begin(),myvector.end());
                                                // 1 10 20 30 30 20 2 3 4 5
                                                //               ^
  std::cout << "mylist contains:";
  for (it=mylist.begin(); it!=mylist.end(); ++it)
    std::cout << ' ' << *it;
  std::cout << '\n';
  return 0;
}

mylist contains: 1 10 20 30 30 20 2 3 4 5

Complexity

Iterator validity

Data races

Exception safety

See also

list::splice

Transfer elements from list to list (public member function)

list::merge

Merge sorted lists (public member function)

list::push_back

Add element at the end (public member function)

list::push_front

Insert element at beginning (public member function)

list::erase

Erase elements (public member function)