Detailed Description

template<typename Key, typename Allocator = fl::allocator_slab<Key>>
class fl::set< Key, Allocator >

Definition at line 367 of file set.h.

#include <set.h>

Inheritance diagram for fl::set< Key, Allocator >:

Collaboration diagram for fl::set< Key, Allocator >:

Public Types
using	allocator_type = Allocator

using	const_iterator = typename TreeType::const_iterator

using	const_pointer = const Key*

using	const_reference = const Key&

using	const_reverse_iterator = typename TreeType::const_reverse_iterator

using	difference_type = ptrdiff_t

using	iterator = const_iterator

using	key_type = Key

using	pointer = const Key*

using	reference = const Key&

using	reverse_iterator = const_reverse_iterator

using	size_type = fl::size

using	value_type = Key

Public Member Functions
	set () FL_NOEXCEPT=default

	set (const Allocator &alloc)

	set (const set &other) FL_NOEXCEPT=default

	set (fl::initializer_list< Key > init)

	set (set &&other) FL_NOEXCEPT=default

const_iterator	begin () 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< const_iterator, bool >	emplace (Args &&... args)

bool	empty () const

const_iterator	end () const

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

size_type	erase (const Key &key)

const_iterator	erase (const_iterator pos)

const_iterator	find (const Key &key) const

allocator_type	get_allocator () const

bool	has (const Key &key) const

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

fl::pair< const_iterator, bool >	insert (Key &&key)

const_iterator	lower_bound (const Key &key) const

size_type	max_size () const

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

bool	operator< (const set &other) const
	Lexicographic comparison.

bool	operator<= (const set &other) const
	Less-than-or-equal comparison.

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

set &	operator= (fl::initializer_list< Key > init) FL_NOEXCEPT

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

bool	operator== (const set &other) const
	Equality comparison.

bool	operator> (const set &other) const
	Greater-than comparison.

bool	operator>= (const set &other) const
	Greater-than-or-equal comparison.

const_reverse_iterator	rbegin () const

const_reverse_iterator	rend () const

size_type	size () const

void	swap (set &other)

const_iterator	upper_bound (const Key &key) const

Private Types
using	TreeType = fl::SetRedBlackTree<Key, fl::less<Key>, Allocator>

Private Attributes
TreeType	mTree

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

fl/stl/set.h

Detailed Description

Public Types

Public Member Functions

Private Types

Private Attributes