C++ Queue Library - push() Function

---

---

Description

The C++ function std::priority_queue::push() inserts new element in sorted order and assigns val to newly inserted element. This member function increases size of priority_queue by one.

This member function effectively calls the push_back() member function of the underlying container.

Declaration

Following is the declaration for std::priority_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.

Exceptions

This member function never throws exception.

Example

The following example shows the usage of std::priority_queue::push() function.

#include <iostream>
#include <queue>

using namespace std;

int main(void) {
   priority_queue<int> q;

   for (int i = 0; i < 5; ++i) {
      q.push(i + 1);
   }

   cout << "Queue contents are" << endl;
   while (!q.empty()) {
      cout << q.top() << endl;
      q.pop();
   }

   return 0;
}

Let us compile and run the above program, this will produce the following result −

Queue contents are
5
4
3
2
1