std::unorde...et::reserve(3)

💖 NAME 💖

okay bestie, this is the std::unordered_multiset::reserve page from the C++ Standard Libary manual 💅

• std::unordered_multiset::reserve — yep, the original NAME line says it twice, and honestly? iconic 👑.

📜 Synopsis 📜

void reserve( size_type count );  (since C++11)

Sets the number of buckets to the number needed to accommodate at least count elements without exceeding the maximum load factor, and rehashes the container — i.e., puts the elements into appropriate buckets considering that the total number of buckets has changed. Effectively calls rehash(std::ceil(count / max_load_factor())). ✨

🎀 Parameters 🎀

• count — new capacity of the container.

🫶 Return value 🫶

• (none) — no return value, bestie. She gives you nothing back 💀

🔥 Complexity 🔥

• Average case: linear in the size of the container.
• Worst case: quadratic.

🌈 See also 🌈

• rehash — reserves at least the specified number of buckets and regenerates the hash table (public member function).

that’s the std::unorde...et::reserve(3) page, source/version: http://cppreference.com, dated 2024.06.10 — mwah 💋🫶✨