std::priority_queue::size(3)

okay so bestie, welcome to the C++ Standard Libary manual, section 3 — this is the page for std::priority_queue::size, and we’re gonna make it make sense 💖

💅 NAME 💅

std::priority_queue::size - std::priority_queue::size — yes, the name really said “I’m my own twin” and honestly? iconic.

✨ Synopsis ✨

size_type size() const;

It returns the number of elements in the container adaptor. Equivalent to return c.size(). no cap, that’s the whole move 🫶

🎀 Parameters 🎀

• (none) — literally zero args, bestie. not a single one. 💀

🌸 Return value 🌸

The number of elements in the container adaptor. that’s it, that’s the tea 🍓

🦋 Complexity 🦋

Constant. lowkey refreshing, fr fr ✨

🧚 Example 🧚

this snippet is giving “run me and see” energy:

// Run this code

#include <algorithm>
#include <cassert>
#include <queue>

int main()
{
    std::priority_queue<int> queue;

    assert(queue.size() == 0);

    const int count = 8;

    for (int i = 0; i != count; ++i)
        queue.push(i);

    assert(queue.size() == count);
}

👑 See also 👑

• empty — checks whether the container adaptor is empty (public member function)
• size / ssize — returns the size of a container or array (C++17) (function template) (C++20)

mwah 💋 source/version: http://cppreference.com, date: 2024.06.10, page: std::priority_queue::size(3) — bestie, you ate this manual page up, periodt 🎀💜