std::list::insert

 

C++

Language

Standard library headers

Concepts

Utilities library

Strings library

Containers library

Algorithms library

Iterators library

Numerics library

Input/output library

Localizations library

Regular expressions library (C++11)

Atomic operations library (C++11)

Thread support library (C++11)

 

Containers library

array (C++11)

vector

deque

forward_list (C++11)

list

set

multiset

map

multimap

unordered_set (C++11)

unordered_multiset (C++11)

unordered_map (C++11)

unordered_multimap (C++11)

stack

queue

priority_queue

 

std::list

Member functions

list::list

list::~list

list::operator=

list::assign

list::get_allocator

Element access

list::front

list::back

Iterators

list::begin list::cbegin (C++11)

list::end list::cend (C++11)

list::rbegin list::crbegin (C++11)

list::rend list::crend (C++11)

Capacity

list::empty

list::size

list::max_size

Modifiers

list::clear

list::insert

list::emplace (C++11)

list::erase

list::push_front

list::emplace_front (C++11)

list::pop_front

list::push_back

list::emplace_back (C++11)

list::pop_back

list::resize

list::swap

Operations

list::merge

list::splice

list::remove list::remove_if

list::reverse

list::unique

list::sort

 

iterator insert( iterator pos, const T& value ); iterator insert( const_iterator pos, const T& value );	(1)	(until C++11) (since C++11)
iterator insert( const_iterator pos, T&& value );	(2)	(since C++11)
void insert( iterator pos, size_type count, const T& value ); iterator insert( const_iterator pos, size_type count, const T& value );	(3)	(until C++11) (since C++11)
template< class InputIt > void insert( iterator pos, InputIt first, InputIt last); template< class InputIt > iterator insert( const_iterator pos, InputIt first, InputIt last );	(4)	(until C++11) (since C++11)
iterator insert( const_iterator pos, std::initializer_list<T> ilist );	(5)	(since C++11)

Inserts elements at specified position in the container.

1-2) inserts value before the element pointed to by pos

3) inserts count copies of the value before the element pointed to by pos

4) inserts elements from range [first, last) before 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.

Parameters

pos	-	element before which the content will be inserted
value	-	element value to insert
first, last	-	the range of elements to insert, can't be iterators into container for which insert is called
ilist	-	initializer list to insert the values from
Type requirements
- InputIt must meet the requirements of InputIterator.

Return value

1-2) iterator pointing to the inserted value

3) iterator pointing to the first element inserted, or pos if count==0.

4) iterator pointing to the first element inserted, or pos if first==last.

5) iterator pointing to the first element inserted, or pos if ilist is empty.

Complexity

1-2) Constant.

3) Linear in count

4) Linear in std::distance(first, last)

5) Linear in ilist.size()

See also

emplace (C++11)	constructs element in-place (public member function)
push_front	inserts elements to the beginning (public member function)
push_back	adds elements to the end (public member function)