ASSOCIATIVE_CONTAINERS(3)

💅 NAME 💅

okay so bestie, this is the Associative Containers page from the Library Functions Manual — section 3, libstdc++ edition — and it's giving key-based container group chat energy. ✨ These containers are all about grabbing your data fast by key, and they keep their elements sorted with an ordering relation. It's lowkey iconic, no cap.

🎀 Classes 🎀

• class std::map< _Key, _Tp, _Compare, _Alloc > — a standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time. obsessed 💖
• class std::multimap< _Key, _Tp, _Compare, _Alloc > — a standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time. same energy, different name ✨
• class std::multiset< _Key, _Compare, _Alloc > — a standard container made up of elements, which can be retrieved in logarithmic time. elements in the building 🦋
• class std::set< _Key, _Compare, _Alloc > — a standard container made up of unique keys, which can be retrieved in logarithmic time. unique keys only, periodt 👑

💖 Detailed Description 💖

Associative containers allow fast retrieval of data based on keys. literally the whole point 🔥

Each container type is parameterized on a Key type, and an ordering relation used to sort the elements of the container. iykyk 💜

All associative containers must meet certain requirements, summarized in tables. tables! very "requirements era" 🎀

🌸 Author 🌸

Generated automatically by Doxygen for libstdc++ from the source code. not a human author, just Doxygen doing its thing 🙈

source/version: libstdc++ · date: 21 Apr 2009 — mwah, generated from the source code with Doxygen energy 🫶💖✨