An unordered associative container of unique keys and associated values that provides pointer stability for its elements.
Synopsis
Declared in <absl/container/node_hash_map.h>
template<
class Key,
class Value,
class Hash = /* implementation-defined */::DefaultHash,
class Eq = /* implementation-defined */::DefaultEq,
class Alloc = /* implementation-defined */::DefaultAlloc>
class node_hash_map
: public /* implementation-defined */::InstantiateRawHashMap</* implementation-defined */, Hash, Eq, Alloc>::typeDescription
An absl::node_hash_map<K, V> is an unordered associative container which has been optimized for both speed and memory footprint in most common use cases. Its interface is similar to that of std::unordered_map<K, V>, and unlike absl::flat_hash_map it guarantees pointer stability of its elements.
Base Classes
Name |
Description |
|
Member Functions
Name |
Description |
|
Constructs an empty |
Using Declarations
Name |
[absl/node_hash_map/operator].adoc[ |