std::unorde...ltiset::size(3)

💖 std::unorde...ltiset::size(3) 💖

okay bestie, welcome to the C++ Standard Libary manual page for std::unordered_multiset::size — yes, the header is literally std::unorde...ltiset::size(3) and we’re keeping the vibe. This is a C++11-and-later situation. 🫶

🌸 NAME 🌸

std::unordered_multiset::size - std::unordered_multiset::size, literally no cap.

✨ Synopsis ✨

size_type size() const noexcept;  (since C++11)

Returns the number of elements in the container, i.e. std::distance(begin(), end()). 💅

🎀 Parameters 🎀

(none) — not a single parameter, bestie. 🙈

🦋 Return value 🦋

The number of elements in the container. That’s the whole mood. ✨

💜 Complexity 💜

Constant. O(1) energy, always iconic. 👑

🍓 Example 🍓

The following code uses size to display the number of elements in a std::unordered_multiset<int>:

// Run this code

#include <iostream>
#include <unordered_set>

int main()
{
    std::unordered_multiset<int> nums{1, 3, 5, 7};

    std::cout << "nums contains " << nums.size() << " elements.\n";
}

📤 Output 📤

nums contains 4 elements.

🌈 See also 🌈

• empty — checks whether the container is empty (public member function)
• max_size — returns the maximum possible number of elements (public member function)
• size — listed in SEE ALSO
• ssize — returns the size of a container or array
  • the original SEE ALSO block also shows (C++17), (function template), and (C++20)

okay that’s the whole page, bestie — go count your elements with confidence. 💖

source: http://cppreference.com · version/page date: 2024.06.10 · page: std::unorde...ltiset::size(3) 🎀