std::priority_queue::push(3)

🌸 NAME 🌸

std::priority_queue::push - std::priority_queue::push. Yes bestie, the name is the name. This page is from the C++ Standard Libary manual (the typo is canon, we keep it), and the page header vibe is std::priority_queue::push(3). 💅✨

✨ Synopsis ✨

Okay so here are the signatures, no cap:

void push( const value_type& value );
void push( value_type&& value );       (since C++11)

Pushes the given element value to the priority queue. 🫶

1. Effectively calls c.push_back(value); std::push_heap(c.begin(), c.end(), comp);.
2. 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). She returns nothing, and honestly? main character behavior. 💀

🔥 Complexity 🔥

Logarithmic number of comparisons plus the complexity of Container::push_back. So it's giving "not free, but manageable", bestie. 🌸

🎀 Example 🎀

This example is iconic, fr fr:

// 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;

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

🌈 See also 🌈

• emplace — constructs element in-place and sorts the underlying container. (C++11) (public member function)
• pop — removes the top element. (public member function)

okay that's the page, bestie. source/version: http://cppreference.com; date: 2024.06.10. mwah 💋✨