std::unorde...iset::rehash(3)

✨ NAME ✨

Bestie, welcome to std::unorde...iset::rehash(3) from the C++ Standard Libary manual 🫶 — this page is all about std::unordered_multiset::rehash, aka std::unordered_multiset::rehash, the member function that changes your bucket count situation 💅

🌸 Synopsis 🌸

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

Okay so this one changes the number of buckets to a value n that is not less than count and satisfies

n >= size() / max_load_factor()

then rehashes the container, i.e. puts the elements into appropriate buckets considering that total number of buckets has changed ✨

🎀 Parameters 🎀

• count — lower bound for the new number of buckets

💅 Return value 💅

• (none) — literally nothing comes back, no return value era 🙈

🔥 Complexity 🔥

Average case linear in the size of the container, worst case quadratic. Ngl, worst case said quadratic 😭

🦋 Notes 🦋

rehash(0) may be used to force an unconditional rehash, such as after suspension of automatic rehashing by temporarily increasing max_load_factor().

⭐ See also ⭐

• reserve — reserves space for at least the specified number of elements and regenerates the hash table (public member function)

Okay bestie, that’s the whole page 💖 source/version: http://cppreference.com; version/date: 2024.06.10; page: std::unorde...iset::rehash(3). Now go rehash responsibly ✨👑