std::priority_queue push() method

since C++11

// (1) Non const version only
void push( const value_type& value );

// (2) Non const version only
void push( value_type&& value );

until C++11

// (1) Non const version only
void push( const value_type& value );

Pushes the given element value to the end of the priority queue.

• (1) Effectively calls

  c.push_back(value);
  std::push_heap(c.begin(), c.end(), comp);
• (1) Effectively calls

  c.push_back(std::move(value));
  std::push_heap(c.begin(), c.end(), comp);

Parameters

• value - the value of the element to push

Return value

(none)

Complexity

Logarithmic number of comparisons plus the complexity of push_back of the underlying container.

Example

Main.cpp

#include <queue>
#include <iostream>
 
struct Event
{
    int priority{};
    char data{' '};
 
    friend bool operator< (Event const& lhs, Event const& rhs) {
        return lhs.priority < rhs.priority;
    }
 
    friend std::ostream& operator<< (std::ostream& os, Event const& e) {
        return os << "{ " << e.priority << ", '" << e.data << "' } ";
    }
};
 
int main()
{
    std::priority_queue<Event> events;
 
    std::cout << "Fill the events queue:\n";
 
    for (auto const e: { Event{6,'L'}, {8,'I'}, {9,'S'}, {1,'T'}, {5,'E'}, {3,'N'} }) {
        std::cout << e << ' ';
        events.push(e);
    }
 
    std::cout << "\n" "Process events:\n";
 
    for (; !events.empty(); events.pop()) {
        Event const& e = events.top();
        std::cout << e << ' ';
    }
}

Output

Fill the events queue:
{ 6, 'L' }  { 8, 'I' }  { 9, 'S' }  { 1, 'T' }  { 5, 'E' }  { 3, 'N' }
Process events:
{ 9, 'S' }  { 8, 'I' }  { 6, 'L' }  { 5, 'E' }  { 3, 'N' }  { 1, 'T' }