- 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
C++ Deque Library - insert() Function
Description
The C++ function std::deque::insert() extends deque by inserting new elements in the container. If reallocation happens storage requirement for this container is fulfilled by internal allocator.
Declaration
Following is the declaration for std::deque::insert() function form std::deque header.
C++98
template <class InputIterator> void insert (iterator position, InputIterator first, InputIterator last);
C++11
template <class InputIterator> iterator insert (const_iterator position, InputIterator first, InputIterator last);
Parameters
position − Index in the deque where new element to be inserted.
first − Input iterator to the initial position in range
last − Input iterator to the final position in range
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::deque::insert() function.
#include <iostream> #include <deque> using namespace std; int main(void) { deque<int> d1 = {3, 4, 5}; deque<int> d2 = {1, 2}; d1.insert(d1.begin(), d2.begin(), d2.end()); cout << "Content of deque are" << endl; for (auto it = d1.begin(); it != d1.end(); ++it) cout << *it << endl; return 0; }
Let us compile and run the above program, this will produce the following result −
Content of deque are 1 2 3 4 5
deque.htm
Advertisements