nfx-containers 0.6.0
Modern C++20 header-only library providing high-performance hash containers with Robin Hood and perfect hashing
Loading...
Searching...
No Matches
OrderedHashMap.h File Reference

Hash map with Robin Hood hashing, heterogeneous lookup, and insertion-order preservation. More...

#include "nfx/detail/containers/CompilerSupport.h"
#include <nfx/Hashing.h>
#include <algorithm>
#include <concepts>
#include <cstddef>
#include <cstdint>
#include <functional>
#include <initializer_list>
#include <iterator>
#include <stdexcept>
#include <string>
#include <string_view>
#include <type_traits>
#include <utility>
#include <vector>
#include "nfx/detail/containers/OrderedHashMap.inl"
Include dependency graph for OrderedHashMap.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

class  nfx::containers::OrderedHashMap< TKey, TValue, HashType, Seed, THasher, KeyEqual >
 Hash map with Robin Hood hashing and insertion-order preservation. More...
class  nfx::containers::OrderedHashMap< TKey, TValue, HashType, Seed, THasher, KeyEqual >::Iterator
 Iterator for OrderedHashMap that follows insertion order. More...
class  nfx::containers::OrderedHashMap< TKey, TValue, HashType, Seed, THasher, KeyEqual >::ConstIterator
 Const iterator for OrderedHashMap that follows insertion order. More...

Detailed Description

Hash map with Robin Hood hashing, heterogeneous lookup, and insertion-order preservation.

Provides a high-performance hash map using Robin Hood algorithm for bounded probe distances with zero-copy heterogeneous lookup support and stable insertion-order iteration via intrusive doubly-linked list

Definition in file OrderedHashMap.h.