Detailed Description

template<typename Key, typename Less = fl::less<Key>>
class fl::flat_set< Key, Less >

Definition at line 24 of file flat_set.h.

#include <flat_set.h>

Collaboration diagram for fl::flat_set< Key, Less >:

Public Types
using	const_iterator = typename vector_type::const_iterator

using	const_pointer = const value_type*

using	const_reference = const value_type&

using	const_reverse_iterator = typename vector_type::const_reverse_iterator

using	difference_type = ptrdiff_t

using	iterator = typename vector_type::iterator

using	key_compare = Less

using	key_type = Key

using	pointer = value_type*

using	reference = value_type&

using	reverse_iterator = typename vector_type::reverse_iterator

using	size_type = fl::size

using	value_compare = Less

using	value_type = Key

using	vector_type = fl::vector<value_type>

Public Member Functions
	flat_set () FL_NOEXCEPT=default

	flat_set (const flat_set &other) FL_NOEXCEPT=default

	flat_set (const Less &less)

	flat_set (const Less &less, memory_resource *resource)

	flat_set (flat_set &&other) FL_NOEXCEPT

	flat_set (memory_resource *resource)

iterator	begin ()

const_iterator	begin () const

size_type	capacity () const

const_iterator	cbegin () const

const_iterator	cend () const

void	clear ()

bool	contains (const Key &key) const

size_type	count (const Key &key) const

template<typename... Args>
fl::pair< iterator, bool >	emplace (Args &&... args)

template<typename... Args>
iterator	emplace_hint (const_iterator hint, Args &&... args)

bool	empty () const

iterator	end ()

const_iterator	end () const

fl::pair< iterator, iterator >	equal_range (const Key &key)

fl::pair< const_iterator, const_iterator >	equal_range (const Key &key) const

size_type	erase (const Key &key)

iterator	erase (const_iterator first, const_iterator last)

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

fl::pair< iterator, bool >	insert (const value_type &value)

iterator	insert (const_iterator hint, const value_type &value)

iterator	insert (const_iterator hint, value_type &&value)

fl::pair< iterator, bool >	insert (value_type &&value)

key_compare	key_comp () const

iterator	lower_bound (const Key &key)

const_iterator	lower_bound (const Key &key) const

size_type	max_size () const

flat_set &	operator= (const flat_set &other)=default

flat_set &	operator= (flat_set &&other) FL_NOEXCEPT

reverse_iterator	rbegin ()

const_reverse_iterator	rbegin () const

reverse_iterator	rend ()

const_reverse_iterator	rend () const

void	reserve (size_type n)

size_type	size () const

void	swap (flat_set &other) FL_NOEXCEPT

iterator	upper_bound (const Key &key)

const_iterator	upper_bound (const Key &key) const

value_compare	value_comp () const

Private Attributes
vector_type	mData

Less	mLess

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

fl/stl/flat_set.h

Detailed Description

Public Types

Public Member Functions

Private Attributes