#include <CeresEngine/Foundation/Container/FlatHashMap.hpp>

Inheritance diagram for CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >:

Classes
struct	convertible_to_iterator

struct	templated_iterator

Public Types
using	value_type = T

using	size_type = size_t

using	difference_type = std::ptrdiff_t

using	hasher = ArgumentHash

using	key_equal = ArgumentEqual

using	allocator_type = EntryAlloc

using	reference = value_type &

using	const_reference = const value_type &

using	pointer = value_type *

using	const_pointer = const value_type *

using	iterator = templated_iterator< value_type >

using	const_iterator = templated_iterator< const value_type >

Public Member Functions
	SherwoodV3Table ()

	SherwoodV3Table (const size_type bucket_count, const ArgumentHash &hash=ArgumentHash(), const ArgumentEqual &equal=ArgumentEqual(), const ArgumentAlloc &alloc=ArgumentAlloc())

	SherwoodV3Table (size_type bucket_count, const ArgumentAlloc &alloc)

	SherwoodV3Table (size_type bucket_count, const ArgumentHash &hash, const ArgumentAlloc &alloc)

	SherwoodV3Table (const ArgumentAlloc &alloc)

template<typename It >
	SherwoodV3Table (It first, It last, size_type bucket_count=0, const ArgumentHash &hash=ArgumentHash(), const ArgumentEqual &equal=ArgumentEqual(), const ArgumentAlloc &alloc=ArgumentAlloc())

template<typename It >
	SherwoodV3Table (It first, It last, size_type bucket_count, const ArgumentAlloc &alloc)

template<typename It >
	SherwoodV3Table (It first, It last, size_type bucket_count, const ArgumentHash &hash, const ArgumentAlloc &alloc)

	SherwoodV3Table (std::initializer_list< T > il, size_type bucket_count=0, const ArgumentHash &hash=ArgumentHash(), const ArgumentEqual &equal=ArgumentEqual(), const ArgumentAlloc &alloc=ArgumentAlloc())

	SherwoodV3Table (std::initializer_list< T > il, size_type bucket_count, const ArgumentAlloc &alloc)

	SherwoodV3Table (std::initializer_list< T > il, size_type bucket_count, const ArgumentHash &hash, const ArgumentAlloc &alloc)

	SherwoodV3Table (const SherwoodV3Table &other)

	SherwoodV3Table (const SherwoodV3Table &other, const ArgumentAlloc &alloc)

	SherwoodV3Table (SherwoodV3Table &&other) noexcept

	SherwoodV3Table (SherwoodV3Table &&other, const ArgumentAlloc &alloc) noexcept

SherwoodV3Table &	operator= (const SherwoodV3Table &other)

SherwoodV3Table &	operator= (SherwoodV3Table &&other) noexcept

	~SherwoodV3Table ()

const allocator_type &	get_allocator () const

const ArgumentEqual &	key_eq () const

const ArgumentHash &	hash_function () const

iterator	begin ()

const_iterator	begin () const

const_iterator	cbegin () const

iterator	end ()

const_iterator	end () const

const_iterator	cend () const

iterator	find (const FindKey &key)

const_iterator	find (const FindKey &key) const

size_t	count (const FindKey &key) const

Pair< iterator, iterator >	equal_range (const FindKey &key)

Pair< const_iterator, const_iterator >	equal_range (const FindKey &key) const

template<typename Key , typename... Args>
Pair< iterator, bool >	emplace (Key &&key, Args &&... args)

Pair< iterator, bool >	insert (const value_type &value)

Pair< iterator, bool >	insert (value_type &&value)

template<typename... Args>
iterator	emplace_hint (const_iterator, Args &&... args)

iterator	insert (const_iterator, const value_type &value)

iterator	insert (const_iterator, value_type &&value)

template<typename It >
void	insert (It begin, It end)

void	insert (std::initializer_list< value_type > il)

void	rehash (size_t num_buckets)

void	reserve (const size_t num_elements)

convertible_to_iterator	erase (const_iterator to_erase)

iterator	erase (const_iterator begin_it, const_iterator end_it)

size_t	erase (const FindKey &key)

void	clear ()

void	shrink_to_fit ()

void	swap (SherwoodV3Table &other)

size_t	size () const

size_t	max_size () const

size_t	bucket_count () const

size_type	max_bucket_count () const

size_t	bucket (const FindKey &key) const

float	load_factor () const

void	max_load_factor (const float value)

float	max_load_factor () const

bool	empty () const

Private Types
using	Entry = detailv3::SherwoodV3Entry< T >

using	AllocatorTraits = std::allocator_traits< EntryAlloc >

using	EntryPointer = typename AllocatorTraits::pointer

Private Types inherited from CeresEngine::Hasher< T >
using	ReflectedType = std::decay_t< T >
	The type currently being hashed.

Private Member Functions
size_t	num_buckets_for_reserve (const size_t num_elements) const

void	rehash_for_other_container (const SherwoodV3Table &other)

void	swap_pointers (SherwoodV3Table &other)

template<typename Key , typename... Args>
Pair< iterator, bool >	emplace_new_key (int8_t distance_from_desired, EntryPointer current_entry, Key &&key, Args &&... args)

void	grow ()

void	deallocate_data (EntryPointer begin, const size_t num_slots_minus_one, const int8_t max_lookups)

void	reset_to_empty_state ()

template<typename U >
size_t	hash_object (const U &key)

template<typename U >
size_t	hash_object (const U &key) const

template<typename L , typename R >
bool	compares_equal (const L &lhs, const R &rhs)

Private Member Functions inherited from CeresEngine::Hasher< T >
constexpr	Hasher (T &object, const size_t hash=0) noexcept
	Creates a new hasher for the given object.

template<auto P>
constexpr void	data (StringView) noexcept
	Combines the hash with the.

template<auto P>
constexpr void	func (StringView) noexcept
	No-op.

Static Private Member Functions
static int8_t	compute_max_lookups (const size_t num_buckets)

Private Attributes
EntryPointer	entries = Entry::empty_default_table()

size_t	num_slots_minus_one = 0

HashPolicySelector< ArgumentHash >::type	hash_policy

int8_t	max_lookups = detailv3::min_lookups - 1

float	_max_load_factor = 0.5f

size_t	num_elements = 0

Private Attributes inherited from CeresEngine::Hasher< T >
T &	object
	The object currently being hashed.

size_t	hash
	The computed hash.

Member Typedef Documentation

◆ allocator_type

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

using CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::allocator_type = EntryAlloc

◆ AllocatorTraits

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

using CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::AllocatorTraits = std::allocator_traits<EntryAlloc>

private

◆ const_iterator

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

using CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::const_iterator = templated_iterator<const value_type>

◆ const_pointer

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

using CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::const_pointer = const value_type*

◆ const_reference

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

using CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::const_reference = const value_type&

◆ difference_type

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

using CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::difference_type = std::ptrdiff_t

◆ Entry

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

using CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::Entry = detailv3::SherwoodV3Entry<T>

private

◆ EntryPointer

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

using CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::EntryPointer = typename AllocatorTraits::pointer

private

◆ hasher

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

using CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::hasher = ArgumentHash

◆ iterator

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

using CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::iterator = templated_iterator<value_type>

◆ key_equal

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

using CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::key_equal = ArgumentEqual

◆ pointer

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

using CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::pointer = value_type*

◆ reference

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

using CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::reference = value_type&

◆ size_type

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

using CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::size_type = size_t

◆ value_type

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

using CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::value_type = T

Constructor & Destructor Documentation

◆ SherwoodV3Table() [1/15]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::SherwoodV3Table ( )

inline

◆ SherwoodV3Table() [2/15]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::SherwoodV3Table	(	const size_type	bucket_count,
		const ArgumentHash &	hash = `ArgumentHash()`,
		const ArgumentEqual &	equal = `ArgumentEqual()`,
		const ArgumentAlloc &	alloc = `ArgumentAlloc()`
	)

inlineexplicit

◆ SherwoodV3Table() [3/15]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::SherwoodV3Table	(	size_type	bucket_count,
		const ArgumentAlloc &	alloc
	)

inline

◆ SherwoodV3Table() [4/15]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::SherwoodV3Table	(	size_type	bucket_count,
		const ArgumentHash &	hash,
		const ArgumentAlloc &	alloc
	)

inline

◆ SherwoodV3Table() [5/15]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::SherwoodV3Table ( const ArgumentAlloc & alloc )

inlineexplicit

◆ SherwoodV3Table() [6/15]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

template<typename It >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::SherwoodV3Table	(	It	first,
		It	last,
		size_type	bucket_count = `0`,
		const ArgumentHash &	hash = `ArgumentHash()`,
		const ArgumentEqual &	equal = `ArgumentEqual()`,
		const ArgumentAlloc &	alloc = `ArgumentAlloc()`
	)

inline

◆ SherwoodV3Table() [7/15]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

template<typename It >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::SherwoodV3Table	(	It	first,
		It	last,
		size_type	bucket_count,
		const ArgumentAlloc &	alloc
	)

inline

◆ SherwoodV3Table() [8/15]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

template<typename It >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::SherwoodV3Table	(	It	first,
		It	last,
		size_type	bucket_count,
		const ArgumentHash &	hash,
		const ArgumentAlloc &	alloc
	)

inline

◆ SherwoodV3Table() [9/15]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::SherwoodV3Table	(	std::initializer_list< T >	il,
		size_type	bucket_count = `0`,
		const ArgumentHash &	hash = `ArgumentHash()`,
		const ArgumentEqual &	equal = `ArgumentEqual()`,
		const ArgumentAlloc &	alloc = `ArgumentAlloc()`
	)

inline

◆ SherwoodV3Table() [10/15]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::SherwoodV3Table	(	std::initializer_list< T >	il,
		size_type	bucket_count,
		const ArgumentAlloc &	alloc
	)

inline

◆ SherwoodV3Table() [11/15]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::SherwoodV3Table	(	std::initializer_list< T >	il,
		size_type	bucket_count,
		const ArgumentHash &	hash,
		const ArgumentAlloc &	alloc
	)

inline

◆ SherwoodV3Table() [12/15]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::SherwoodV3Table ( const SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc > & other )

inline

◆ SherwoodV3Table() [13/15]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::SherwoodV3Table	(	const SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc > &	other,
		const ArgumentAlloc &	alloc
	)

inline

◆ SherwoodV3Table() [14/15]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::SherwoodV3Table ( SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc > && other )

inlinenoexcept

◆ SherwoodV3Table() [15/15]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::SherwoodV3Table	(	SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc > &&	other,
		const ArgumentAlloc &	alloc
	)

inlinenoexcept

◆ ~SherwoodV3Table()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::~SherwoodV3Table ( )

inline

Member Function Documentation

◆ begin() [1/2]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

iterator CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::begin ( )

inline

◆ begin() [2/2]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

const_iterator CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::begin ( ) const

inline

◆ bucket()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

size_t CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::bucket ( const FindKey & key ) const

inline

◆ bucket_count()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

size_t CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::bucket_count ( ) const

inline

◆ cbegin()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

const_iterator CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::cbegin ( ) const

inline

◆ cend()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

const_iterator CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::cend ( ) const

inline

◆ clear()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

void CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::clear ( )

inline

◆ compares_equal()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

template<typename L , typename R >

bool CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::compares_equal	(	const L &	lhs,
		const R &	rhs
	)

inlineprivate

◆ compute_max_lookups()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

static int8_t CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::compute_max_lookups ( const size_t num_buckets )

inlinestaticprivate

◆ count()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

size_t CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::count ( const FindKey & key ) const

inline

◆ deallocate_data()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

void CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::deallocate_data	(	EntryPointer	begin,
		const size_t	num_slots_minus_one,
		const int8_t	max_lookups
	)

inlineprivate

◆ emplace()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

template<typename Key , typename... Args>

Pair< iterator, bool > CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::emplace	(	Key &&	key,
		Args &&...	args
	)

inline

◆ emplace_hint()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

template<typename... Args>

iterator CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::emplace_hint	(	const_iterator	,
		Args &&...	args
	)

inline

◆ emplace_new_key()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

template<typename Key , typename... Args>

Pair< iterator, bool > CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::emplace_new_key	(	int8_t	distance_from_desired,
		EntryPointer	current_entry,
		Key &&	key,
		Args &&...	args
	)

inlineprivate

◆ empty()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

bool CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::empty ( ) const

inline

◆ end() [1/2]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

iterator CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::end ( )

inline

◆ end() [2/2]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

const_iterator CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::end ( ) const

inline

◆ equal_range() [1/2]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

Pair< iterator, iterator > CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::equal_range ( const FindKey & key )

inline

◆ equal_range() [2/2]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

Pair< const_iterator, const_iterator > CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::equal_range ( const FindKey & key ) const

inline

◆ erase() [1/3]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

size_t CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::erase ( const FindKey & key )

inline

◆ erase() [2/3]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

iterator CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::erase	(	const_iterator	begin_it,
		const_iterator	end_it
	)

inline

◆ erase() [3/3]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

convertible_to_iterator CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::erase ( const_iterator to_erase )

inline

◆ find() [1/2]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

iterator CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::find ( const FindKey & key )

inline

◆ find() [2/2]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

const_iterator CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::find ( const FindKey & key ) const

inline

◆ get_allocator()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

const allocator_type & CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::get_allocator ( ) const

inline

◆ grow()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

void CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::grow ( )

inlineprivate

◆ hash_function()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

const ArgumentHash & CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::hash_function ( ) const

inline

◆ hash_object() [1/2]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

template<typename U >

size_t CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::hash_object ( const U & key )

inlineprivate

◆ hash_object() [2/2]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

template<typename U >

size_t CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::hash_object ( const U & key ) const

inlineprivate

◆ insert() [1/6]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

Pair< iterator, bool > CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::insert ( const value_type & value )

inline

◆ insert() [2/6]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

iterator CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::insert	(	const_iterator	,
		const value_type &	value
	)

inline

◆ insert() [3/6]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

iterator CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::insert	(	const_iterator	,
		value_type &&	value
	)

inline

◆ insert() [4/6]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

template<typename It >

void CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::insert	(	It	begin,
		It	end
	)

inline

◆ insert() [5/6]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

void CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::insert ( std::initializer_list< value_type > il )

inline

◆ insert() [6/6]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

Pair< iterator, bool > CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::insert ( value_type && value )

inline

◆ key_eq()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

const ArgumentEqual & CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::key_eq ( ) const

inline

◆ load_factor()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

float CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::load_factor ( ) const

inline

◆ max_bucket_count()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

size_type CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::max_bucket_count ( ) const

inline

◆ max_load_factor() [1/2]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

float CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::max_load_factor ( ) const

inline

◆ max_load_factor() [2/2]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

void CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::max_load_factor ( const float value )

inline

◆ max_size()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

size_t CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::max_size ( ) const

inline

◆ num_buckets_for_reserve()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

size_t CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::num_buckets_for_reserve ( const size_t num_elements ) const

inlineprivate

◆ operator=() [1/2]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

SherwoodV3Table & CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::operator= ( const SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc > & other )

inline

◆ operator=() [2/2]

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

SherwoodV3Table & CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::operator= ( SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc > && other )

inlinenoexcept

◆ rehash()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

void CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::rehash ( size_t num_buckets )

inline

◆ rehash_for_other_container()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

void CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::rehash_for_other_container ( const SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc > & other )

inlineprivate

◆ reserve()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

void CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::reserve ( const size_t num_elements )

inline

◆ reset_to_empty_state()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

void CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::reset_to_empty_state ( )

inlineprivate

◆ shrink_to_fit()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

void CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::shrink_to_fit ( )

inline

◆ size()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

size_t CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::size ( ) const

inline

◆ swap()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

void CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::swap ( SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc > & other )

inline

◆ swap_pointers()

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

void CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::swap_pointers ( SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc > & other )

inlineprivate

Member Data Documentation

◆ _max_load_factor

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

float CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::_max_load_factor = 0.5f

private

◆ entries

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

EntryPointer CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::entries = Entry::empty_default_table()

private

◆ hash_policy

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

HashPolicySelector<ArgumentHash>::type CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::hash_policy

private

◆ max_lookups

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

int8_t CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::max_lookups = detailv3::min_lookups - 1

private

◆ num_elements

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

size_t CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::num_elements = 0

private

◆ num_slots_minus_one

template<typename T , typename FindKey , typename ArgumentHash , typename Hasher , typename ArgumentEqual , typename Equal , typename ArgumentAlloc , typename EntryAlloc >

size_t CeresEngine::detailv3::SherwoodV3Table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >::num_slots_minus_one = 0

private

The documentation for this class was generated from the following file:

/Users/Rogiel/Developer/CeresEngine/Engine/Sources/CeresEngine/Foundation/Container/FlatHashMap.hpp

Classes

Public Types

Public Member Functions

Private Types

Private Member Functions

Static Private Member Functions

Private Attributes

Member Typedef Documentation

◆ allocator_type

◆ AllocatorTraits

◆ const_iterator

◆ const_pointer

◆ const_reference

◆ difference_type

◆ Entry

◆ EntryPointer

◆ hasher

◆ iterator

◆ key_equal

◆ pointer

◆ reference

◆ size_type

◆ value_type

Constructor & Destructor Documentation

◆ SherwoodV3Table() [1/15]

◆ SherwoodV3Table() [2/15]

◆ SherwoodV3Table() [3/15]

◆ SherwoodV3Table() [4/15]

◆ SherwoodV3Table() [5/15]

◆ SherwoodV3Table() [6/15]

◆ SherwoodV3Table() [7/15]

◆ SherwoodV3Table() [8/15]

◆ SherwoodV3Table() [9/15]

◆ SherwoodV3Table() [10/15]

◆ SherwoodV3Table() [11/15]

◆ SherwoodV3Table() [12/15]

◆ SherwoodV3Table() [13/15]

◆ SherwoodV3Table() [14/15]

◆ SherwoodV3Table() [15/15]

◆ ~SherwoodV3Table()

Member Function Documentation

◆ begin() [1/2]

◆ begin() [2/2]

◆ bucket()

◆ bucket_count()

◆ cbegin()

◆ cend()

◆ clear()

◆ compares_equal()

◆ compute_max_lookups()

◆ count()

◆ deallocate_data()

◆ emplace()

◆ emplace_hint()

◆ emplace_new_key()

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ equal_range() [1/2]

◆ equal_range() [2/2]

◆ erase() [1/3]

◆ erase() [2/3]

◆ erase() [3/3]

◆ find() [1/2]

◆ find() [2/2]

◆ get_allocator()

◆ grow()

◆ hash_function()

◆ hash_object() [1/2]

◆ hash_object() [2/2]

◆ insert() [1/6]

◆ insert() [2/6]

◆ insert() [3/6]

◆ insert() [4/6]

◆ insert() [5/6]

◆ insert() [6/6]

◆ key_eq()

◆ load_factor()

◆ max_bucket_count()

◆ max_load_factor() [1/2]