Difference between revisions of "cpp/container/unordered multimap"
| Line 1: | Line 1: | ||
{{cpp/title|unordered_multimap}} | {{cpp/title|unordered_multimap}} | ||
{{cpp/container/unordered_multimap/sidebar}} | {{cpp/container/unordered_multimap/sidebar}} | ||
| − | {{ddcl | header= | + | {{ddcl | header=unordered_multimap | notes={{mark c++11 feature}} | |
template< | template< | ||
class Key, | class Key, | ||
Revision as of 12:02, 23 August 2011
Template:cpp/container/unordered multimap/sidebar
| Defined in header <unordered_multimap>
|
||
| template< class Key, |
Template:mark c++11 feature | |
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.
Contents |
Member types
Template:tdcl list begin Template:tdcl list hitem Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list template Template:tdcl list end
