std::priority_queue::empty(3)

💖 NAME 💖

okay so welcome to std::priority_queue::empty(3) from the C++ Standard Libary manual — yes, “Libary” is the manual’s spelling and we’re not touching it, periodt 💅. The name up top is std::priority_queue::empty - std::priority_queue::empty, which is giving self-referential main character energy, and honestly? iconic ✨.

🦋 Synopsis 🦋

two signatures, depending on which C++ era you’re living in:

bool empty() const;                (until C++20)
[[nodiscard]] bool empty() const;  (since C++20)

Checks if the underlying container has no elements. Equivalent to return c.empty();.

🌸 Parameters 🌸

(none) — literally zero parameters, she takes nothing, low maintenance queen 🫶.

💜 Return value 💜

true if the underlying container is empty, false otherwise. That’s the whole return vibe, no cap ✨.

⭐ Complexity ⭐

Constant. periodt.

🍓 Example 🍓

// Run this code — go off, bestie:

#include <algorithm>
#include <iostream>
#include <queue>

int main()
{
    std::cout << std::boolalpha;

    std::priority_queue<int> queue;

    std::cout << "Initially, queue.empty(): " << queue.empty() << '\n';

    queue.push(42);
    std::cout << "After adding elements, queue.empty(): " <<
       queue.empty() << '\n';
}

🎀 Output 🎀

Initially, queue.empty(): true
After adding elements, queue.empty(): false

🌈 See also 🌈

• size — returns the number of elements (public member function)
• empty — checks whether the container is empty (C++17) (function template)

source/version/date check, bestie: http://cppreference.com, 2024.06.10, page std::priority_queue::empty(3) — mwah, bye 💋💖