std::map
From cppreference.com
Defined in header <map>
|
||
template< class Key, |
||
std::map
is a sorted associative container that contains key-value pairs with unique keys. Keys are sorted by using the comparison function Compare
. Search, removal, and insertion operations have logarithmic complexity. Maps are usually implemented as red-black trees.
std::map
meets the requirements of Template:concept, Template:concept, Template:concept and Template:concept.
Contents |