- 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 - push_front() Function
Description
The C++ function std::deque::push_front() inserts new element at the front of deque and increases size of deque by one.
Declaration
Following is the declaration for std::deque::push_front() function form std::deque header.
C++98
void push_front (const value_type& val);
C++11
void push_front (const value_type& val);
Parameters
val − Value of element to be inserted into deque.
Return value
None
Exceptions
This member function never throws exception.
Time complexity
Constant i.e. O(1)
Example
The following example shows the usage of std::deque::push_front() function.
#include <iostream> #include <deque> using namespace std; int main(void) { deque<int> d; for (int i = 0; i < 5; ++i) d.push_front(i + 1); cout << "Contents of deque are" << endl; for (int i = 0; i < 5; ++i) cout << d[i] << endl; return 0; }
Let us compile and run the above program, this will produce the following result −
Contents of deque are 5 4 3 2 1
deque.htm
Advertisements
To Continue Learning Please Login
Login with Google