Content deleted Content added
C++0x is now C++11 |
add overview of functions; description section should be removed/transformed. we don't need so much details |
||
Line 8:
It is closely related to <code>[[unordered_multimap]]</code> (available in the same header file), which is an implementation of [[multimap]] using hashing. It is also similar to <code>[[unordered_set]]</code> and <code>[[unordered_multiset]]</code>, implementations of the [[set (computer science)|set]] and [[multiset]] containers respectively and available in the <code><tr1/unordered_set></code> or <code><unordered_set></code> headers.
==Design==
{{expand}}
===Overview of functions===
===Overview of functions===
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/unordered_map unordered_map]</code> (constructor) - Constructs the unordered map from variety of sources.
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/~unordered_map ~unordered_map]</code> (destructor) - Destructs the unordered map and the contained elements
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/operator= operator=]</code> - Assigns values to the unordered map
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/get_allocator get_allocator]</code> - Returns the allocator used to allocate memory for the elements
*Iterators
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/begin begin]</code> - Returns an iterator to the beginning of the unordered map
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/end end]</code> - Returns an iterator to the end of the unordered map
* Capacity
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/empty empty]</code> - Checks whether the unordered map is empty
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/size size]</code> - Returns the number of elements in the unordered map.
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/max_size max_size]</code> - Returns the maximum possible number of elements in the unordered map.
*Modifiers
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/clear clear]</code> - Clears the contents
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/insert insert]</code> - Inserts elements
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/emplace emplace]</code> - Constructs elements in-place
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/emplace emplace_hint]</code> - Constructs elements in-place using a hint
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/erase erase]</code> - Erases elements
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/swap swap]</code> - Swaps the contents with another unordered map
*Lookup
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/count count]</code> - Returns the number of elements matching specific key
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/find find]</code> - Finds an element with specific key
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/equal_range equal_range]</code> - Returns a range of elements matching specific key
*Bucket interface
** ...
*Hash policy
** ...
*Observers
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/hash_function hash_function]</code> - Returns the function used to create hash of a key
**<code>unordered_map::[http://en.cppreference.com/w/cpp/container/unordered_map/key_eq key_eq]</code> - Returns key comparison function
== Description ==
| |||