#include <concurrent_unordered_map.h>
Inherits AZStd::Internal::concurrent_hash_table< Traits >.
Public Member Functions | |
AZ_FORCE_INLINE | concurrent_unordered_map (const hasher &hash, const key_equal &keyEqual, const allocator_type &allocator) |
AZ_FORCE_INLINE | concurrent_unordered_map (size_type numBucketsHint) |
AZ_FORCE_INLINE | concurrent_unordered_map (size_type numBucketsHint, const hasher &hash, const key_equal &keyEqual) |
AZ_FORCE_INLINE | concurrent_unordered_map (size_type numBucketsHint, const hasher &hash, const key_equal &keyEqual, const allocator_type &allocator) |
template<class Iterator > | |
AZ_FORCE_INLINE | concurrent_unordered_map (Iterator first, Iterator last) |
template<class Iterator > | |
AZ_FORCE_INLINE | concurrent_unordered_map (Iterator first, Iterator last, size_type numBucketsHint) |
template<class Iterator > | |
AZ_FORCE_INLINE | concurrent_unordered_map (Iterator first, Iterator last, size_type numBucketsHint, const hasher &hash, const key_equal &keyEqual) |
template<class Iterator > | |
AZ_FORCE_INLINE | concurrent_unordered_map (Iterator first, Iterator last, size_type numBucketsHint, const hasher &hash, const key_equal &keyEqual, const allocator_type &allocator) |
bool | find (const key_type &keyValue) const |
bool | find (const key_type &keyValue, mapped_type *mappedOut) const |
Concurrent unordered map container, similar to unordered_map, but uses a striped array of locks to allow concurrent access.