#include <concurrent_unordered_set.h>
Inherits AZStd::Internal::concurrent_hash_table< Traits >.
Public Member Functions | |
AZ_FORCE_INLINE | concurrent_unordered_set (size_type numBucketsHint) |
AZ_FORCE_INLINE | concurrent_unordered_set (size_type numBucketsHint, const hasher &hash, const key_equal &keyEqual) |
AZ_FORCE_INLINE | concurrent_unordered_set (size_type numBucketsHint, const hasher &hash, const key_equal &keyEqual, const allocator_type &allocator) |
template<class Iterator > | |
AZ_FORCE_INLINE | concurrent_unordered_set (Iterator first, Iterator last) |
template<class Iterator > | |
AZ_FORCE_INLINE | concurrent_unordered_set (Iterator first, Iterator last, size_type numBucketsHint) |
template<class Iterator > | |
AZ_FORCE_INLINE | concurrent_unordered_set (Iterator first, Iterator last, size_type numBucketsHint, const hasher &hash, const key_equal &keyEqual) |
template<class Iterator > | |
AZ_FORCE_INLINE | concurrent_unordered_set (Iterator first, Iterator last, size_type numBucketsHint, const hasher &hash, const key_equal &keyEqual, const allocator_type &allocator) |
Concurrent unordered set container, similar to unordered_set, but uses a striped array of locks to allow concurrent access.