#include <UnorderedMap.h>

Inheritance diagram for UnorderedMap< Key, Value, Hash, KeyEqual >:

Public Types
using	size_type = typename Base::size_type

using	iterator = typename Base::iterator

using	const_iterator = typename Base::const_iterator

using	value_type = typename Base::value_type

Public Types inherited from HashTable< Key, std::pair< Key, Value >, UnorderedMapDetail< Key, Value >, Hash, KeyEqual >
using	value_type
	Properties.

using	size_type

using	difference_type

Public Member Functions
Value &	operator[] (const Key &inKey)

template<class... Args>
std::pair< iterator, bool >	try_emplace (const Key &inKey, Args &&...inArgs)

template<class... Args>
std::pair< iterator, bool >	try_emplace (Key &&inKey, Args &&...inArgs)

iterator	find (const Key &inKey)
	Non-const version of find.

Public Member Functions inherited from HashTable< Key, std::pair< Key, Value >, UnorderedMapDetail< Key, Value >, Hash, KeyEqual >
	HashTable ()=default
	Default constructor.

	HashTable (const HashTable &inRHS)
	Copy constructor.

	HashTable (HashTable &&ioRHS) noexcept
	Move constructor.

HashTable &	operator= (const HashTable &inRHS)
	Assignment operator.

HashTable &	operator= (HashTable &&ioRHS) noexcept
	Move assignment operator.

	~HashTable ()
	Destructor.

void	reserve (size_type inMaxSize)
	Reserve memory for a certain number of elements.

void	clear ()
	Destroy the entire hash table.

void	ClearAndKeepMemory ()
	Destroy the entire hash table but keeps the memory allocated.

iterator	begin ()
	Iterator to first element.

const_iterator	begin () const
	Iterator to first element.

iterator	end ()
	Iterator to one beyond last element.

const_iterator	end () const
	Iterator to one beyond last element.

const_iterator	cbegin () const
	Iterator to first element.

const_iterator	cend () const
	Iterator to one beyond last element.

size_type	bucket_count () const
	Number of buckets in the table.

constexpr size_type	max_bucket_count () const
	Max number of buckets that the table can have.

bool	empty () const
	Check if there are no elements in the table.

size_type	size () const
	Number of elements in the table.

constexpr size_type	max_size () const
	Max number of elements that the table can hold.

constexpr float	max_load_factor () const
	Get the max load factor for this table (max number of elements / number of buckets)

std::pair< iterator, bool >	insert (const value_type &inValue)
	Insert a new element, returns iterator and if the element was inserted.

const_iterator	find (const Key &inKey) const
	Find an element, returns iterator to element or end() if not found.

void	erase (const const_iterator &inIterator)
	Erase an element by iterator.

size_type	erase (const Key &inKey)
	Erase an element by key.

void	swap (HashTable &ioRHS) noexcept
	Swap the contents of two hash tables.

void	rehash (size_type)

Additional Inherited Members
Protected Member Functions inherited from HashTable< Key, std::pair< Key, Value >, UnorderedMapDetail< Key, Value >, Hash, KeyEqual >
std::pair< Key, Value > &	GetElement (size_type inIndex) const
	Get an element by index.

bool	InsertKey (const Key &inKey, size_type &outIndex)

Detailed Description

template<class Key, class Value, class Hash, class KeyEqual>
class UnorderedMap< Key, Value, Hash, KeyEqual >

Hash Map class

Template Parameters

Key	Key type
Value	Value type
Hash	Hash function (note should be 64-bits)
KeyEqual	Equality comparison function