Content deleted Content added
m Task 18 (cosmetic): eval 5 templates: hyphenate params (3×); |
Tom.Reding (talk | contribs) m →top: Confirm {{Use dmy dates}} from 2012 |
||
| (3 intermediate revisions by 3 users not shown) | |||
Line 1:
{{Short description|Group of class templates in the C++ Standard Library}}
{{C++ Standard Library}}
In the programming language [[C++]], '''unordered associative containers''' are a group of class templates in the [[C++ Standard Library]] that implement [[hash table]] variants. Being [[Template (programming)|templates]], they can be used to store arbitrary elements, such as integers or custom classes. The following containers are defined in the current revision of the C++ standard: <code>unordered_set</code>, <code>unordered_map</code>, <code>unordered_multiset</code>, <code>unordered_multimap</code>. Each of these containers differ only on constraints placed on their elements.
The unordered associative containers are similar to the [[associative containers (C++)|associative containers]] in the C++ Standard Library but have different constraints. As their name implies, the elements in the unordered associative containers are not [[well ordering|ordered]]. This is due to the use of hashing to store objects. The containers can still be [[iterator|iterated]] through like a regular associative container.
==History==
Line 18 ⟶ 20:
|-
!
! <code>unordered_set</code><br />([[C++11]])
! <code>unordered_map</code><br />(C++11)
! <code>unordered_multiset</code><br />(C++11)
! <code>unordered_multimap</code><br />(C++11)
! Description
|-
Line 234 ⟶ 236:
==References==
{{Reflist}}
▲{{use dmy dates|date=January 2012}}
[[Category:Articles with example C++ code]]
| |||