ska::detailv3::sherwood_v3_table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc > Class Template Reference

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

Data Structures
struct	convertible_to_iterator
struct	templated_iterator

Public Types
using	value_type = T
using	size_type = uint64_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
	sherwood_v3_table (size_type bucket_count, const ArgumentHash &hash=ArgumentHash(), const ArgumentEqual &equal=ArgumentEqual(), const ArgumentAlloc &alloc=ArgumentAlloc())
	sherwood_v3_table (size_type bucket_count, const ArgumentAlloc &alloc)
	sherwood_v3_table (size_type bucket_count, const ArgumentHash &hash, const ArgumentAlloc &alloc)
	sherwood_v3_table (const ArgumentAlloc &alloc)
template<typename It >
	sherwood_v3_table (It first, It last, size_type bucket_count=0, const ArgumentHash &hash=ArgumentHash(), const ArgumentEqual &equal=ArgumentEqual(), const ArgumentAlloc &alloc=ArgumentAlloc())
template<typename It >
	sherwood_v3_table (It first, It last, size_type bucket_count, const ArgumentAlloc &alloc)
template<typename It >
	sherwood_v3_table (It first, It last, size_type bucket_count, const ArgumentHash &hash, const ArgumentAlloc &alloc)
	sherwood_v3_table (std::initializer_list< T > il, size_type bucket_count=0, const ArgumentHash &hash=ArgumentHash(), const ArgumentEqual &equal=ArgumentEqual(), const ArgumentAlloc &alloc=ArgumentAlloc())
	sherwood_v3_table (std::initializer_list< T > il, size_type bucket_count, const ArgumentAlloc &alloc)
	sherwood_v3_table (std::initializer_list< T > il, size_type bucket_count, const ArgumentHash &hash, const ArgumentAlloc &alloc)
	sherwood_v3_table (const sherwood_v3_table &other)
	sherwood_v3_table (const sherwood_v3_table &other, const ArgumentAlloc &alloc)
	sherwood_v3_table (sherwood_v3_table &&other) noexcept
	sherwood_v3_table (sherwood_v3_table &&other, const ArgumentAlloc &alloc) noexcept
sherwood_v3_table &	operator= (const sherwood_v3_table &other)
sherwood_v3_table &	operator= (sherwood_v3_table &&other) noexcept
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
uint64_t	count (const FindKey &key) const
std::pair< iterator, iterator >	equal_range (const FindKey &key)
std::pair< const_iterator, const_iterator >	equal_range (const FindKey &key) const
template<typename Key , typename... Args>
std::pair< iterator, bool >	emplace (Key &&key, Args &&...args)
std::pair< iterator, bool >	insert (const value_type &value)
std::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 (uint64_t num_buckets)
void	reserve (uint64_t num_elements)
convertible_to_iterator	erase (const_iterator to_erase)
iterator	erase (const_iterator begin_it, const_iterator end_it)
uint64_t	erase (const FindKey &key)
void	clear ()
void	shrink_to_fit ()
void	swap (sherwood_v3_table &other)
uint64_t	size () const
uint64_t	max_size () const
uint64_t	bucket_count () const
size_type	max_bucket_count () const
uint64_t	bucket (const FindKey &key) const
float	load_factor () const
void	max_load_factor (float value)
float	max_load_factor () const
bool	empty () const

Detailed Description

template<typename T, typename FindKey, typename ArgumentHash, typename Hasher, typename ArgumentEqual, typename Equal, typename ArgumentAlloc, typename EntryAlloc>
class ska::detailv3::sherwood_v3_table< T, FindKey, ArgumentHash, Hasher, ArgumentEqual, Equal, ArgumentAlloc, EntryAlloc >

Definition at line 292 of file flat_hash_map.h.

---

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

• c10/util/flat_hash_map.h