Namespaces
Variants
Actions

std::priority_queue<T,Container,Compare>::push

From cppreference.com

[edit template]
 
C++
 
Containers library
 
std::priority_queue
 
void push( const value_type& value );
 (1)
void push( value_type&& value );
 (2) (since C++11)

Pushes the given element value to the priority queue.

1) Equivalent to: c.push_back(value); std::push_heap(c.begin(), c.end(), comp);.
2) Equivalent to: c.push_back(std::move(value)); std::push_heap(c.begin(), c.end(), comp);.

Contents

[edit] Parameters

value - the value of the element to push

[edit] Return value

(none)

[edit] Complexity

Logarithmic number of comparisons plus the complexity of Container::push_back.

[edit] Example

Run this code
#include <iostream>
#include <queue>
 
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;