Thread safe unordered_map. More...

Public Member Functions
	thread_unordered_map ()
	Constructor Function.

virtual	~thread_unordered_map ()=default
	Destructor Function.

bool	IsEmpty () const
	Is this queue is empty. @reutrn Returns true if empty.

void	Insert (K &&k, V &&v)
	Insert a element to this.

void	Insert (const K &k, const V &v)
	Insert a element to this.

V &	Find (K &&k)
	Find element in this unordered_map.

V &	Find (const K &k)
	Find element in this unordered_map.

bool	HasKey (K &&k)
	Is element in this unordered_map.

bool	HasKey (const K &k)
	Is element in this unordered_map.

void	Clear ()
	Clear this unordered_map.

Private Attributes
std::shared_mutex	m_Mutex
	Mutex of this queue.

std::unordered_map< K, V >	m_Map
	This wrapped unordered_map.

std::atomic_uint32_t	m_Count
	elements of this unordered_map.

Detailed Description

template<typename K, typename V>
class scl::thread_unordered_map< K, V >

Thread safe unordered_map.

Definition at line 17 of file ThreadUnorderedMap.h.

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

Public Member Functions