std::unorde...bucket_size(3)

💅 std::unordered_multiset::bucket_size 💅

okay so bestie, welcome to the std::unorde...bucket_size(3) page from the C++ Standard Libary — yes, that’s the manual name and we’re folding it in near the top instead of copying the header line, because we have main character energy. it’s the std::unordered_multiset::bucket_size page, it’s C++11 girlie, and it’s honestly so short and iconic. let’s go ✨

🌸 NAME 🌸

std::unordered_multiset::bucket_size — std::unordered_multiset::bucket_size

not me repeating it, that’s literally what the page says, and we keep every detail around here. 💅

✨ Synopsis ✨

size_type bucket_size( size_type n ) const;  (since C++11)

okay so this one returns the number of elements in the bucket with index n. that’s the whole assignment, bestie. no cap. 🦋

🧚 Parameters 🧚

• n — the index of the bucket to examine 👀

💖 Return value 💖

the number of elements in the bucket n. periodt. ✨

⏳ Complexity ⏳

linear in the size of the bucket n. so like, it’s not doing a little constant-time magic trick — it’s linear in that bucket’s size, and that’s the fact. 😭

👀 See also 👀

• bucket_count — returns the number of buckets (public member function) 🔥

okay bye bestie, this has been std::unorde...bucket_size(3) — source/version: http://cppreference.com, date: 2024.06.10. mwah 💋🎀