std::unorde...:load_factor(3)

std::unorde...:load_factor(3) 💅

okay so bestie, welcome to std::unorde...:load_factor(3) from the C++ Standard Libary manual — yes, that's the manual name, typo and all, I don't make the rules 🎀✨

🌸 NAME 🌸

The name is std::unordered_map::load_factor — and the NAME line is literally std::unordered_map::load_factor - std::unordered_map::load_factor, which is giving “I said what I said” energy 💅

✨ Synopsis ✨

Here's the signature, copied exactly, no edits bestie:

float load_factor() const;  (since C++11)

It's been around since C++11, and this function returns the average number of elements per bucket, that is, size() divided by bucket_count(). That's the whole vibe: bucket math, but make it average 🪣✨

🎀 Parameters 🎀

(none) — zero parameters, not a single one, periodt 🫶

💖 Return value 💖

Average number of elements per bucket. That's it, that's the return value, and it ate 💖

🦋 Complexity 🦋

Constant. No cap, it's constant complexity ⭐

👑 See also 👑

• max_load_factor — manages maximum average number of elements per bucket (public member function)

go check on her, she's iconic 👑

mwah 💋 this page is from http://cppreference.com, with version/date 2024.06.10 — and the header title vibe is std::unorde...:load_factor(3). byeee, go divide your size() by your bucket_count() responsibly 🫶🌈