Detailed Description

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

Definition at line 278 of file set.h.

#include <set.h>

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

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

Public Types
using	const_iterator = typename TreeType::const_iterator

using	const_pointer = const Key*

using	const_reference = const Key&

using	difference_type = ptrdiff_t

using	iterator = const_iterator

using	key_type = Key

using	pointer = const Key*

using	reference = const Key&

using	size_type = fl::size

using	value_type = Key

Public Member Functions
	set ()=default

	set (const set &other)=default

	set (set &&other)=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

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

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

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

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>

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

Public Types