|
| unordered_map (size_type numBucketsHint, const hasher &hash=hasher(), const key_equal &keyEqual=key_equal(), const allocator_type &allocator=allocator_type()) |
|
template<class InputIterator > |
| unordered_map (InputIterator first, InputIterator last, size_type numBucketsHint={}, const hasher &hash=hasher(), const key_equal &keyEqual=key_equal(), const allocator_type &alloc=allocator_type()) |
|
template<class R , class = enable_if_t<Internal::container_compatible_range<R, value_type>>> |
| unordered_map (from_range_t, R &&rg, size_type numBucketsHint={}, const hasher &hash=hasher(), const key_equal &keyEqual=key_equal(), const allocator_type &alloc=allocator_type()) |
|
| unordered_map (const unordered_map &rhs) |
|
| unordered_map (unordered_map &&rhs) |
|
| unordered_map (const allocator_type &alloc) |
|
| unordered_map (const unordered_map &rhs, const type_identity_t< allocator_type > &alloc) |
|
| unordered_map (unordered_map &&rhs, const type_identity_t< allocator_type > &alloc) |
|
| unordered_map (initializer_list< value_type > list, size_type numBucketsHint={}, const hasher &hash=hasher(), const key_equal &keyEqual=key_equal(), const allocator_type &allocator=allocator_type()) |
|
| unordered_map (size_type numBucketsHint, const allocator_type &alloc) |
|
| unordered_map (size_type numBucketsHint, const hasher &hash, const allocator_type &alloc) |
|
template<class InputIterator > |
| unordered_map (InputIterator f, InputIterator l, size_type n, const allocator_type &a) |
|
template<class InputIterator > |
| unordered_map (InputIterator f, InputIterator l, size_type n, const hasher &hf, const allocator_type &a) |
|
template<class R , class = enable_if_t<Internal::container_compatible_range<R, value_type>>> |
| unordered_map (from_range_t, R &&rg, size_type n, const allocator_type &a) |
|
template<class R , class = enable_if_t<Internal::container_compatible_range<R, value_type>>> |
| unordered_map (from_range_t, R &&rg, size_type n, const hasher &hf, const allocator_type &a) |
|
| unordered_map (initializer_list< value_type > il, size_type n, const allocator_type &a) |
|
| unordered_map (initializer_list< value_type > il, size_type n, const hasher &hf, const allocator_type &a) |
|
| unordered_map (const hasher &hash, const key_equal &keyEqual, const allocator_type &allocator) |
| This constructor is AZStd extension (so we don't rehash/allocate memory)
|
|
this_type & | operator= (this_type &&rhs) |
|
AZ_FORCE_INLINE this_type & | operator= (const this_type &rhs) |
|
AZ_FORCE_INLINE mapped_type & | operator[] (const key_type &key) |
|
AZ_FORCE_INLINE mapped_type & | at (const key_type &key) |
|
AZ_FORCE_INLINE const mapped_type & | at (const key_type &key) const |
|
insert_return_type | insert (node_type &&nodeHandle) |
|
iterator | insert (const_iterator hint, node_type &&nodeHandle) |
|
template<typename M > |
pair_iter_bool | insert_or_assign (const key_type &key, M &&value) |
|
template<typename M > |
pair_iter_bool | insert_or_assign (key_type &&key, M &&value) |
|
template<typename M > |
iterator | insert_or_assign (const_iterator hint, const key_type &key, M &&value) |
|
template<typename M > |
iterator | insert_or_assign (const_iterator hint, key_type &&key, M &&value) |
|
template<typename... Args> |
pair_iter_bool | try_emplace (const key_type &key, Args &&... arguments) |
|
template<typename... Args> |
pair_iter_bool | try_emplace (key_type &&key, Args &&... arguments) |
|
template<typename... Args> |
iterator | try_emplace (const_iterator hint, const key_type &key, Args &&... arguments) |
|
template<typename... Args> |
iterator | try_emplace (const_iterator hint, key_type &&key, Args &&... arguments) |
|
node_type | extract (const key_type &key) |
|
node_type | extract (const_iterator it) |
|
AZ_FORCE_INLINE pair_iter_bool | insert (const value_type &value) |
|
AZ_FORCE_INLINE iterator | insert (const_iterator, const value_type &value) |
|
AZ_FORCE_INLINE pair_iter_bool | insert (value_type &&value) |
|
AZ_FORCE_INLINE iterator | insert (const_iterator, value_type &&value) |
|
AZ_FORCE_INLINE void | insert (std::initializer_list< value_type > list) |
|
template<class Iterator > |
auto | insert (Iterator first, Iterator last) -> enable_if_t< input_iterator< Iterator > &&!is_convertible_v< Iterator, size_type > > |
|
template<class R > |
auto | insert_range (R &&rg) -> enable_if_t< Internal::container_compatible_range< R, value_type > > |
|
|
|
AZ_FORCE_INLINE pair_iter_bool | insert_key (const key_type &key) |
|
AZ_FORCE_INLINE | hash_table (const hasher &hash, const key_equal &keyEqual, const allocator_type &alloc=allocator_type()) |
|
AZ_FORCE_INLINE | hash_table (const value_type *first, const value_type *last, const hasher &hash, const key_equal &keyEqual, const allocator_type &alloc) |
|
| hash_table (const hash_table &rhs) |
|
| hash_table (const hash_table &rhs, const type_identity_t< allocator_type > &alloc) |
|
| hash_table (hash_table &&rhs) |
|
| hash_table (hash_table &&rhs, const type_identity_t< allocator_type > &alloc) |
|
this_type & | operator= (this_type &&rhs) |
|
AZ_FORCE_INLINE this_type & | operator= (const this_type &rhs) |
|
AZ_FORCE_INLINE iterator | begin () |
|
AZ_FORCE_INLINE const_iterator | begin () const |
|
AZ_FORCE_INLINE iterator | end () |
|
AZ_FORCE_INLINE const_iterator | end () const |
|
AZ_FORCE_INLINE local_iterator | begin (size_type bucket) |
|
AZ_FORCE_INLINE const_local_iterator | begin (size_type bucket) const |
|
AZ_FORCE_INLINE local_iterator | end (size_type bucket) |
|
AZ_FORCE_INLINE const_local_iterator | end (size_type bucket) const |
|
AZ_FORCE_INLINE reverse_iterator | rbegin () |
|
AZ_FORCE_INLINE const_reverse_iterator | rbegin () const |
|
AZ_FORCE_INLINE reverse_iterator | rend () |
|
AZ_FORCE_INLINE const_reverse_iterator | rend () const |
|
AZ_FORCE_INLINE size_type | size () const |
|
AZ_FORCE_INLINE size_type | max_size () const |
|
AZ_FORCE_INLINE bool | empty () const |
|
AZ_FORCE_INLINE key_equal | key_eq () const |
|
AZ_FORCE_INLINE hasher | get_hasher () const |
|
AZ_FORCE_INLINE size_type | bucket_count () const |
|
AZ_FORCE_INLINE size_type | max_bucket_count () const |
|
AZ_FORCE_INLINE size_type | bucket (const key_type &keyValue) const |
|
AZ_INLINE size_type | bucket_size (size_type bucket) const |
|
AZ_FORCE_INLINE float | load_factor () const |
|
AZ_FORCE_INLINE float | max_load_factor () const |
|
AZ_FORCE_INLINE void | max_load_factor (float newMaxLoadFactor) |
|
AZ_FORCE_INLINE pair_iter_bool | insert (const value_type &value) |
|
AZ_FORCE_INLINE iterator | insert (const_iterator, const value_type &value) |
|
AZ_FORCE_INLINE pair_iter_bool | insert (value_type &&value) |
|
AZ_FORCE_INLINE iterator | insert (const_iterator, value_type &&value) |
|
template<typename... Args> |
AZ_FORCE_INLINE pair_iter_bool | emplace (Args &&... arguments) |
|
AZ_FORCE_INLINE void | insert (std::initializer_list< value_type > list) |
|
template<class Iterator > |
auto | insert (Iterator first, Iterator last) -> enable_if_t< input_iterator< Iterator > &&!is_convertible_v< Iterator, size_type > > |
|
template<class R > |
auto | insert_range (R &&rg) -> enable_if_t< Internal::container_compatible_range< R, value_type > > |
|
template<class InsertReturnType , class NodeHandle > |
InsertReturnType | node_handle_insert (NodeHandle &&nodeHandle) |
|
template<class NodeHandle > |
auto | node_handle_insert (const_iterator hint, NodeHandle &&nodeHandle) -> iterator |
|
template<class NodeHandle > |
NodeHandle | node_handle_extract (const key_type &key) |
|
template<class NodeHandle > |
NodeHandle | node_handle_extract (const_iterator it) |
|
AZ_FORCE_INLINE void | reserve (size_type numBucketsMin) |
|
AZ_FORCE_INLINE void | rehash (size_type numBucketsMin) |
|
iterator | erase (const_iterator erasePos) |
|
size_type | erase (const key_type &keyValue) |
|
iterator | erase (const_iterator first, const_iterator last) |
|
AZ_FORCE_INLINE void | clear () |
|
template<class ComparableToKey > |
auto | find (const ComparableToKey &key) -> enable_if_t<(Internal::is_transparent< key_equal, ComparableToKey >::value &&Internal::is_transparent< hasher, ComparableToKey >::value)||AZStd::is_convertible_v< ComparableToKey, key_type >, iterator > |
|
template<class ComparableToKey > |
auto | find (const ComparableToKey &key) const -> enable_if_t<(Internal::is_transparent< key_equal, ComparableToKey >::value &&Internal::is_transparent< hasher, ComparableToKey >::value)||AZStd::is_convertible_v< ComparableToKey, key_type >, const_iterator > |
|
template<class ComparableToKey > |
auto | contains (const ComparableToKey &key) const -> enable_if_t<(Internal::is_transparent< key_equal, ComparableToKey >::value &&Internal::is_transparent< hasher, ComparableToKey >::value)||AZStd::is_convertible_v< ComparableToKey, key_type >, bool > |
|
template<class ComparableToKey > |
auto | count (const ComparableToKey &key) const -> enable_if_t<(Internal::is_transparent< key_equal, ComparableToKey >::value &&Internal::is_transparent< hasher, ComparableToKey >::value)||AZStd::is_convertible_v< ComparableToKey, key_type >, size_type > |
|
template<class ComparableToKey > |
auto | lower_bound (const ComparableToKey &key) -> enable_if_t<(Internal::is_transparent< key_equal, ComparableToKey >::value &&Internal::is_transparent< hasher, ComparableToKey >::value)||AZStd::is_convertible_v< ComparableToKey, key_type >, iterator > |
|
template<class ComparableToKey > |
auto | lower_bound (const ComparableToKey &key) const -> enable_if_t<(Internal::is_transparent< key_equal, ComparableToKey >::value &&Internal::is_transparent< hasher, ComparableToKey >::value)||AZStd::is_convertible_v< ComparableToKey, key_type >, const_iterator > |
|
template<class ComparableToKey > |
auto | upper_bound (const ComparableToKey &key) -> enable_if_t<(Internal::is_transparent< key_equal, ComparableToKey >::value &&Internal::is_transparent< hasher, ComparableToKey >::value)||AZStd::is_convertible_v< ComparableToKey, key_type >, iterator > |
|
template<class ComparableToKey > |
auto | upper_bound (const ComparableToKey &key) const -> enable_if_t<(Internal::is_transparent< key_equal, ComparableToKey >::value &&Internal::is_transparent< hasher, ComparableToKey >::value)||AZStd::is_convertible_v< ComparableToKey, key_type >, const_iterator > |
|
template<class ComparableToKey > |
auto | equal_range (const ComparableToKey &key) -> enable_if_t<(Internal::is_transparent< key_equal, ComparableToKey >::value &&Internal::is_transparent< hasher, ComparableToKey >::value)||AZStd::is_convertible_v< ComparableToKey, key_type >, AZStd::pair< iterator, iterator > > |
|
template<class ComparableToKey > |
auto | equal_range (const ComparableToKey &key) const -> enable_if_t<(Internal::is_transparent< key_equal, ComparableToKey >::value &&Internal::is_transparent< hasher, ComparableToKey >::value)||AZStd::is_convertible_v< ComparableToKey, key_type >, AZStd::pair< const_iterator, const_iterator > > |
|
AZ_INLINE void | swap (this_type &rhs) |
|
template<typename ComparableToKey , typename... Args> |
auto | try_emplace_transparent (ComparableToKey &&key, Args &&... arguments) -> pair_iter_bool |
|
template<typename ComparableToKey , typename... Args> |
auto | try_emplace_transparent (const_iterator, ComparableToKey &&key, Args &&... arguments) -> iterator |
|
template<typename ComparableToKey , typename MappedType > |
auto | insert_or_assign_transparent (ComparableToKey &&key, MappedType &&value) -> pair_iter_bool |
|
template<typename ComparableToKey , typename MappedType > |
auto | insert_or_assign_transparent (const_iterator, ComparableToKey &&key, MappedType &&value) -> iterator |
|
AZ_FORCE_INLINE allocator_type & | get_allocator () |
|
AZ_FORCE_INLINE const allocator_type & | get_allocator () const |
|
void | set_allocator (const allocator_type &allocator) |
|
template<class ComparableToKey , class Hasher , class KeyEqual > |
iterator | find_as (const ComparableToKey &keyCmp, const Hasher &hash, const KeyEqual &keyEq) |
|
template<class ComparableToKey , class Hasher , class KeyEqual > |
const_iterator | find_as (const ComparableToKey &keyCmp, const Hasher &hash, const KeyEqual &keyEq) const |
|
template<class U , class Converter , class Hasher , class KeyEqual > |
pair_iter_bool | insert_from (const U &userValue, const Converter &convert, const Hasher &hash, const KeyEqual &keyEq) |
|
bool | validate () const |
|
int | validate_iterator (const iterator &iter) const |
| Validates an iter iterator. Returns a combination of iterator_status_flag.
|
|
int | validate_iterator (const const_iterator &iter) const |
|
void | leak_and_reset () |
|