absl::flat_hash

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

Synopsis

Declared in <absl/container/flat_hash_set.h>

template<
    class T,
    class Hash = /* implementation-defined */::DefaultHash,
    class Eq = /* implementation-defined */::DefaultEq,
    class Allocator = /* implementation-defined */::DefaultAlloc>
class flat_hash_set
    : public /* implementation-defined */::InstantiateRawHashSet</* implementation-defined */, Hash, Eq, Allocator>::type

Description

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

Base Classes

Name

Description

/* implementation-defined */::InstantiateRawHashSet</* implementation-defined */, Hash, Eq, Allocator>::type

Member Functions

Name

Description

flat_hash_set [constructor]

Constructs an empty flat_hash_set.

Using Declarations

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 flat_hash_set containers.

Created with MrDocs