std::unordered_map::rehash(3)

💅 std::unordered_map::rehash(3) — C++ Standard Libary bestie page ✨

okay so we're in the C++ Standard Libary manual, and this page is literally all about std::unordered_map::rehash(3). it's giving member-function main character energy, no cap 🫶

🌸 NAME 🌸

std::unordered_map::rehash — std::unordered_map::rehash 💅

✨ Synopsis ✨

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

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. periodt 💖

🎀 Parameters 🎀

• count — lower bound for the new number of buckets. that's the whole assignment bestie 🎀

🦋 Return value 🦋

(none) — literally none, it's giving void energy 💀

🔥 Complexity 🔥

• Average case: linear in the size of the container.
• Worst case: 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(). iconic little trick, iykyk 🌈

👑 See also 👑

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

mwah 💖 this page is from source/version http://cppreference.com, dated 2024.06.10 — byeee bestie, go rehash responsibly 🌸