FlatHashMap.hpp File Reference

#include "Pair.hpp"
#include <algorithm>
#include <cmath>
#include <cstddef>
#include <cstdint>
#include <functional>
#include <iterator>
#include <type_traits>
#include <utility>

Go to the source code of this file.

Classes
struct	CeresEngine::detailv3::FunctorStorage< Result, Functor >
struct	CeresEngine::detailv3::FunctorStorage< Result, Result(*)(Args...)>
struct	CeresEngine::detailv3::KeyOrValueHasher< key_type, value_type, hasher >
struct	CeresEngine::detailv3::KeyOrValueEquality< key_type, value_type, key_equal >
struct	CeresEngine::detailv3::SherwoodV3Entry< T >
struct	CeresEngine::detailv3::AssignIfTrue< T, bool >
struct	CeresEngine::detailv3::AssignIfTrue< T, false >
struct	CeresEngine::detailv3::HashPolicySelector< T, typename >
struct	CeresEngine::detailv3::HashPolicySelector< T, void_t< typename T::hash_policy > >
class	CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >
struct	CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::templated_iterator< ValueType >
struct	CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::convertible_to_iterator
struct	CeresEngine::prime_number_hash_policy
struct	CeresEngine::power_of_two_hash_policy
struct	CeresEngine::fibonacci_hash_policy
class	CeresEngine::FlatHashMap< K, V, H, E, A >
struct	CeresEngine::FlatHashMap< K, V, H, E, A >::convertible_to_value
class	CeresEngine::FlatHashSet< T, H, E, A >
struct	CeresEngine::power_of_two_std_hash< T >

Namespaces
namespace	CeresEngine
namespace	CeresEngine::detailv3

Typedefs
template<typename... >
using	CeresEngine::detailv3::void_t = void

Functions
int8_t	CeresEngine::detailv3::log2 (std::uint64_t value)
size_t	CeresEngine::detailv3::next_power_of_two (std::uint64_t i)