Detailed Description

template<typename Key, typename Hash = Hash<Key>, typename KeyEqual = EqualTo<Key>>
class fl::unordered_set< Key, Hash, KeyEqual >

Definition at line 17 of file unordered_set.h.

Collaboration diagram for fl::unordered_set< Key, Hash, KeyEqual >:

Public Member Functions
	unordered_set () FL_NOEXCEPT=default

	unordered_set (const unordered_set &other) FL_NOEXCEPT=default

	unordered_set (memory_resource *resource)

	unordered_set (unordered_set &&other) FL_NOEXCEPT=default

	~unordered_set () FL_NOEXCEPT=default

iterator	begin ()

const_iterator	begin () const

fl::size	capacity () const

const_iterator	cbegin () const

const_iterator	cend () const

void	clear ()

bool	contains (const Key &key) const

fl::size	count (const Key &key) const

template<typename... Args>
bool	emplace (Args &&... args)

bool	empty () const

iterator	end ()

const_iterator	end () const

bool	erase (const Key &key)

iterator	erase (const_iterator pos)

iterator	erase (iterator pos)

iterator	find (const Key &key)

const_iterator	find (const Key &key) const

memory_resource *	get_memory_resource () const

bool	has (const Key &key) const

bool	insert (const Key &key)

bool	insert (Key &&key)

bool	operator!= (const unordered_set &other) const
	Inequality comparison.

unordered_set &	operator= (const unordered_set &other) FL_NOEXCEPT=default

unordered_set &	operator= (unordered_set &&other) FL_NOEXCEPT=default

bool	operator== (const unordered_set &other) const
	Equality comparison (set equality: same elements, order-independent)

fl::size	size () const

Private Attributes
fl::unordered_map< Key, bool, Hash, KeyEqual >	data

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

Classes