std::unordered_multimap
From cppreference.com
Defined in header <unordered_map>
|
||
template< class Key, |
(since C++11) | |
Unordered multimap is an unordered associative container that supports equivalent keys (an unordered_multimap may contain multiple copies of each key value) and that associates values of another type with the keys. The unordered_multimap class supports forward iterators. Search, insertion, and removal have average constant-time complexity.
std::unordered_multimap
meets the requirements of Template:concept, Template:concept, Template:concept.
Contents |