Difference between revisions of "cpp/container/unordered map"
m (Text replace - "operator_comp" to "operator_cmp") |
m (Text replace - "{{mark c++11 feature}}" to "{{mark since c++11}}") |
||
Line 1: | Line 1: | ||
{{cpp/title|unordered_map}} | {{cpp/title|unordered_map}} | ||
{{cpp/container/unordered_map/sidebar}} | {{cpp/container/unordered_map/sidebar}} | ||
− | {{ddcl | header=unordered_map | notes={{mark c++11 | + | {{ddcl | header=unordered_map | notes={{mark since c++11}} | |
template< | template< | ||
class Key, | class Key, |
Revision as of 14:51, 24 December 2011
Template:cpp/container/unordered map/sidebar
Defined in header <unordered_map>
|
||
template< class Key, |
(since C++11) | |
Unordered map is an associative container that contains key-value pairs with unique keys. Search, insertion, and removal have average constant-time complexity.
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