absl::flat_hash

An unordered associative container of unique keys and associated values, optimized for speed and memory footprint.

Synopsis

Declared in <absl/container/flat_hash_map.h>

template<
    class K,
    class V,
    class Hash = /* implementation-defined */::DefaultHash,
    class Eq = /* implementation-defined */::DefaultEq,
    class Allocator = /* implementation-defined */::DefaultAlloc>
class flat_hash_map
    : public /* implementation-defined */::InstantiateRawHashMap</* implementation-defined */, Hash, Eq, Allocator>::type

Description

An absl::flat_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>.