std::priority_queue<T,Container,Compare>::push - cppreference.com (original) (raw)

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);.

[edit] Parameters

[edit] Return value

(none)

[edit] Complexity

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

[edit] Example

#include #include   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 events;   std::cout << "Fill the events queue:\t";   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 << "\nProcess events:\t\t";   for (; !events.empty(); events.pop()) { Event const& e = events.top(); std::cout << e << ' '; }   std::cout << '\n'; }

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'}

[edit] See also

| | constructs element in-place and sorts the underlying container (public member function) [edit] | | --------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | | | removes the top element (public member function) [edit] |