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

💖 NAME 💖

std::unordered_set::reserve — std::unordered_set::reserve

okay so this is the <pink>C++ Standard Libary</pink> manual page for std::unordered_set::reserve(3), and it's literally giving bucket-management main character energy. 💅✨

✨ Synopsis ✨

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

It sets the number of buckets to the number needed to accommodate at least count elements without exceeding the maximum load factor, then rehashes the container — aka it puts the elements into appropriate buckets considering that the total number of buckets has changed. 🫶

Effectively calls rehash(std::ceil(count / max_load_factor())). No cap. 💫

🎀 Parameters 🎀

• count — new capacity of the container. that's the whole parameter, bestie 🎀

💅 Return value 💅

(none) — no return value, she just does the thing and dips 🙈

🔥 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 whole page, bestie 💖 source: http://cppreference.com · version/date: 2024.06.10 · std::unordered_set::reserve(3) outtieee 🫶✨