Content deleted Content added
VulcanSphere (talk | contribs) Adding local short description: "Group of class templates in the C++ Standard Library", overriding Wikidata description "group of class templates in the C++ Standard Library that implement hash table variants: std::unordered_set, std::unordered_map, std::unordered_multiset, std::unordered_multimap" (Shortdesc helper) |
BegbertBiggs (talk | contribs) m fixed link |
||
Line 4:
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==
| |||