absl::node_hash_map

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>::type

Description

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
`/* implementation-defined /::InstantiateRawHashMap</ implementation-defined */, Hash, Eq, Alloc>::type`

Member Functions

Name	Description
`node_hash_map` [constructor]	Constructs an empty `node_hash_map`.

Using Declarations

Name
`Unnamed using`
`at`
`begin`
`bucket_count`
`capacity`
`cbegin`
`cend`
`clear`
`contains`
`count`
`emplace`
`emplace_hint`
`empty`
`end`
`equal_range`
`erase`
`extract`
`find`
`get_allocator`
`hash_function`
`insert`
`insert_or_assign`
`key_eq`
`load_factor`
`max_load_factor`
`max_size`
`merge`
`operator[]`
`rehash`
`reserve`
`size`
`swap`
`try_emplace`

Non-Member Functions

Name	Description
`erase_if`	Erases all elements that satisfy the predicate `pred` from the container `c`.
`swap`	Swaps the contents of two `node_hash_map` containers.