std::deque::insert

From Cppreference

Jump to: navigation, search
iterator insert( iterator pos, const T& value );
iterator insert( const_iterator pos, const T& value );
(1) (pre-C++11 version)
(C++11 version)

iterator insert( const_iterator pos, T&& value );
(2) (C++11 feature)
void insert( iterator pos, size_type count, const T& value );
iterator insert( const_iterator pos, size_type count, const T& value );
(3) (pre-C++11 version)
(C++11 version)

template< class InputIterator >

void insert( iterator pos, InputIterator first, InputIterator last);
template< class InputIterator >

iterator insert( const_iterator pos, InputIterator first, InputIterator last );
(4) (pre-C++11 version)

(C++11 version)

iterator insert( const_iterator pos, std::initializer_list<T> ilist );
(5) (C++11 feature)

Inserts elements to 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

5) inserts elements from initializer list ilist.

Iterators to the elements between pos and the end of the container are invalidated.

Contents

[edit] Parameters

pos - element before which the content will be inserted
value - element value to insert
first, last - the range of elements to insert
ilist - initializer list to insert the values from

[edit] Return value

iterator following the last inserted element.

[edit] Complexity

[edit] See also

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