- 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++ Queue Library - push() Function
Description
The C++ function std::queue::push() inserts new element at the end of queue and assigns val to newly inserted element. This member function increases size of queue by one.
This member function effectively calls the push_back() member function of the underlying container.
Declaration
Following is the declaration for std::queue::push() function form std::queue header.
C++98
void push (const value_type& val);
C++11
void push (const value_type& val);
Parameters
val − Value to be assigned to newly inserted element.
Return value
None
Time complexity
Constant i.e. O(1)
Example
The following example shows the usage of std::queue::push() function.
#include <iostream> #include <queue> using namespace std; int main(void) { queue<int> q; for (int i = 0; i < 5; ++i) q.push(i + 1); cout << "Contents of queue" << endl; while (!q.empty()) { cout << q.front() << endl; q.pop(); } return 0; }
Let us compile and run the above program, this will produce the following result −
Contents of queue 1 2 3 4 5
queue.htm
Advertisements