Difference between revisions of "cpp/container/map"
From cppreference.com
m (r2.7.3) (Robot: Adding de, es, fr, pt) |
m (Shorten template names. Use {{lc}} where appropriate.) |
||
Line 15: | Line 15: | ||
===Member types=== | ===Member types=== | ||
− | {{ | + | {{dsc begin}} |
− | {{ | + | {{dsc hitem | Member type | Definition}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list key_type | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list mapped_type | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list value_type | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list size_type | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list difference_type | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list key_compare | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list allocator_type | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list reference | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list const_reference | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list pointer | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list const_pointer | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list iterator | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list const_iterator | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list reverse_iterator | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list const_reverse_iterator | map}} |
− | {{ | + | {{dsc end}} |
===Member classes=== | ===Member classes=== | ||
− | {{ | + | {{dsc begin}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list value_compare | map}} |
− | {{ | + | {{dsc end}} |
===Member functions=== | ===Member functions=== | ||
− | {{ | + | {{dsc begin}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list constructor | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list destructor | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list operator{{=}} | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list get_allocator | map}} |
− | {{ | + | {{dsc h2 | Element access}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list at | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list operator_at | map}} |
− | {{ | + | {{dsc h2 | Iterators}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list begin | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list end | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list rbegin | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list rend | map}} |
− | {{ | + | {{dsc h2 | Capacity}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list empty | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list size | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list max_size | map}} |
− | {{ | + | {{dsc h2 | Modifiers}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list clear | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list insert | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list emplace | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list emplace_hint | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list erase | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap | map}} |
− | {{ | + | {{dsc h2 | Lookup}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list count | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list find | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list equal_range | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list lower_bound | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list upper_bound | map}} |
− | {{ | + | {{dsc h2 | Observers}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list key_comp | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list value_comp | map}} |
− | {{ | + | {{dsc end}} |
===Non-member functions=== | ===Non-member functions=== | ||
− | {{ | + | {{dsc begin}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list operator_cmp | map}} |
− | {{ | + | {{dsc inc | cpp/container/dcl list swap2 | map}} |
− | {{ | + | {{dsc end}} |
[[de:cpp/container/map]] | [[de:cpp/container/map]] |
Revision as of 18:40, 31 May 2013
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 |