UNORDERED_ASSOCIATIVE_CONTAINERS(3)

💅 Unordered Associative Containers 💅

okay so welcome to the Unordered ...Containers(3) page from the Library Functions Manual, bestie. this is your group-chat rundown of the unordered associative containers — the NAME is literally Unordered Associative Containers -, dash and all. periodt. 💖

🎀 Classes 🎀

• class std::unordered_map< _Key, _Tp, _Hash, _Pred, _Alloc > — a standard container built from unique keys (containing at most one of each key value) that associates values of another type with the keys. slay 💖
• class std::unordered_multimap< _Key, _Tp, _Hash, _Pred, _Alloc > — a standard container built from equivalent keys (possibly containing multiple of each key value) that associates values of another type with the keys. ✨
• class std::unordered_multiset< _Value, _Hash, _Pred, _Alloc > — a standard container built from equivalent keys (possibly containing multiple of each key value) in which the elements' keys are the elements themselves. 🎀
• class std::unordered_set< _Value, _Hash, _Pred, _Alloc > — a standard container built from unique keys (containing at most one of each key value) in which the elements' keys are the elements themselves. 🦋

🌸 Detailed Description 🌸

unordered associative containers allow fast retrieval of data based on keys. main character energy for lookups, honestly. 👑

each container type is parameterized on a Key type, a Hash type providing a hashing functor, and an ordering relation used to sort the elements of the container. that's the trio, bestie. 💜

all unordered associative containers must meet certain requirements, summarized in tables. no cap, tables. 📋✨

🌈 Author 🌈

Generated automatically by Doxygen for libstdc++ from the source code. not me being auto-generated and still ate 💅

xoxo, libstdc++ 💖 — 21 Apr 2009 — Unordered ...Containers(3) 🫶