RADData::RADFlatHashSet< K, Hash, Eq > Class Template Reference

Flat hash set implemented on top of RADFlatHashMap. More...

#include <RADDataStructures.h>

Public Member Functions
bool	empty () const noexcept
	Returns true when the set contains no keys. More...
size_t	size () const noexcept
	Returns number of stored keys. More...
void	clear () noexcept
	Removes all keys. More...
void	reserve (size_t desired)
	Reserves capacity for desired keys. More...
bool	contains (const K &key) const
	Returns true when key exists. More...
bool	insert (const K &key)
	Inserts key and returns true when newly inserted. More...
bool	erase (const K &key)
	Removes key and returns true when it existed. More...

Detailed Description

template<typename K, typename Hash = std::hash<K>, typename Eq = std::equal_to<K>>
class RADData::RADFlatHashSet< K, Hash, Eq >

Flat hash set implemented on top of RADFlatHashMap.

Member Function Documentation

clear()

template<typename K , typename Hash = std::hash<K>, typename Eq = std::equal_to<K>>

void RADData::RADFlatHashSet< K, Hash, Eq >::clear ( )

inlinenoexcept

Removes all keys.

contains()

template<typename K , typename Hash = std::hash<K>, typename Eq = std::equal_to<K>>

bool RADData::RADFlatHashSet< K, Hash, Eq >::contains ( const K &  key ) const

inline

Returns true when key exists.

empty()

template<typename K , typename Hash = std::hash<K>, typename Eq = std::equal_to<K>>

bool RADData::RADFlatHashSet< K, Hash, Eq >::empty ( ) const

inlinenoexcept

Returns true when the set contains no keys.

erase()

template<typename K , typename Hash = std::hash<K>, typename Eq = std::equal_to<K>>

bool RADData::RADFlatHashSet< K, Hash, Eq >::erase ( const K &  key )

inline

Removes key and returns true when it existed.

insert()

template<typename K , typename Hash = std::hash<K>, typename Eq = std::equal_to<K>>

bool RADData::RADFlatHashSet< K, Hash, Eq >::insert ( const K &  key )

inline

Inserts key and returns true when newly inserted.

reserve()

template<typename K , typename Hash = std::hash<K>, typename Eq = std::equal_to<K>>

void RADData::RADFlatHashSet< K, Hash, Eq >::reserve ( size_t  desired )

inline

Reserves capacity for desired keys.

size()

template<typename K , typename Hash = std::hash<K>, typename Eq = std::equal_to<K>>

size_t RADData::RADFlatHashSet< K, Hash, Eq >::size ( ) const

inlinenoexcept

Returns number of stored keys.

---

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

• /media/jvincent/Kingspec512/repos/RADLib/RADDataStructures/headers/RADDataStructures.h