Collaboration diagram for Associative:
|
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. More...
- A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time. More...
- 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. More...
- A standard container made up of (key,value) pairs, which can be retrieved based on a key, in logarithmic time. More...
- class std::multiset< _Key, _Compare, _Alloc >
- A standard container made up of elements, which can be retrieved in logarithmic time. More...
- A standard container made up of elements, which can be retrieved in logarithmic time. More...
- class std::set< _Key, _Compare, _Alloc >
- A standard container made up of unique keys, which can be retrieved in logarithmic time. More...
- A standard container made up of unique keys, which can be retrieved in logarithmic time. More...
Detailed Description
Associative containers allow fast retrieval of data based on keys.
Each container type is parameterized on a Key type, and an ordering relation used to sort the elements of the container.
All associative containers must meet certain requirements, summarized in tables.
