Unordered associative containers (C++): Difference between revisions

Revision as of 11:51, 23 February 2012

Revision as of 19:32, 9 May 2012

Line 3:

In computing, '''unordered associative containers''' refer to a group of class templates in the [[C++ Standard Library|standard library]] of the [[C++|C++ programming language]] that implement variations of [[hash table]]. 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 [[C++ standard library]] but hashave 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 containers.

==History==