#include <utility>
#include "internal_concurrent_hash.h"
Go to the source code of this file.
|
class | Concurrency::details::_Concurrent_unordered_map_traits< _Key_type, _Element_type, _Key_comparator, _Allocator_type, _Allow_multimapping > |
|
class | Concurrency::details::_Concurrent_unordered_map_traits< _Key_type, _Element_type, _Key_comparator, _Allocator_type, _Allow_multimapping >::_Value_compare |
|
class | Concurrency::concurrent_unordered_map< _Key_type, _Element_type, _Hasher, _Key_equality, _Allocator_type > |
| The concurrent_unordered_map class is a concurrency-safe container that controls a varying-length sequence of elements of type std::pair<const _Key_type, _Element_type> . The sequence is represented in a way that enables concurrency-safe append, element access, iterator access, and iterator traversal operations. More...
|
|
class | Concurrency::concurrent_unordered_multimap< _Key_type, _Element_type, _Hasher, _Key_equality, _Allocator_type > |
| The concurrent_unordered_multimap class is an concurrency-safe container that controls a varying-length sequence of elements of type std::pair<const _Key_type, _Element_type> . The sequence is represented in a way that enables concurrency-safe append, element access, iterator access and iterator traversal operations. More...
|
|