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

okay so bestie, we're in the C++ Standard Libary manual — page std::unorde...imap::rehash(3) — and the main character is std::unordered_multimap::rehash. The header is doing its shortened little thing, but the full name is right below. 💅

🎀 NAME 🎀

std::unordered_multimap::rehash - std::unordered_multimap::rehash. That's it, that's the name, no cap. 💖

✨ Synopsis ✨

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

Okay so rehash 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. slay. ✨

🌸 Parameters 🌸

• count — lower bound for the new number of buckets. periodt. 💅

🎀 Return value 🎀

(none) — literally nothing coming back, bestie. 💀

🦋 Complexity 🦋

Average case linear in the size of the container, worst case quadratic. That worst case is giving “handle with care” energy, ngl. 😭

💜 Notes 💜

rehash(0) may be used to force an unconditional rehash, such as after suspension of automatic rehashing by temporarily increasing max_load_factor(). Lowkey iconic little escape hatch, iykyk. ✨

👀 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 page 🫶 — source: http://cppreference.com · version/date: 2024.06.10 · page: std::unorde...imap::rehash(3). C++ Standard Libary manual out. 💖