An unordered associative container of unique keys that provides pointer stability for its elements.
Synopsis
Declared in <absl/container/node_hash_set.h>
template<
class T,
class Hash = /* implementation-defined */::DefaultHash,
class Eq = /* implementation-defined */::DefaultEq,
class Alloc = /* implementation-defined */::DefaultAlloc>
class node_hash_set
: public /* implementation-defined */::InstantiateRawHashSet</* implementation-defined */, Hash, Eq, Alloc>::typeDescription
An absl::node_hash_set<T> 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_set<T>, and unlike absl::flat_hash_set it guarantees pointer stability of its elements.
Base Classes
Name |
Description |
|
Member Functions
Name |
Description |
|
Constructs an empty |