Detailed Description

template<typename Key, typename Compare = less<Key>, typename Allocator = allocator_slab<char>>
class fl::SetRedBlackTree< Key, Compare, Allocator >

Definition at line 1440 of file rbtree.h.

#include <rbtree.h>

Inheritance diagram for fl::SetRedBlackTree< Key, Compare, Allocator >:

Collaboration diagram for fl::SetRedBlackTree< Key, Compare, Allocator >:

Public Types
using	allocator_type = Allocator

using	const_iterator = typename TreeType::const_iterator

using	const_pointer = const value_type*

using	const_reference = const value_type&

using	const_reverse_iterator = typename TreeType::const_reverse_iterator

using	difference_type = ptrdiff_t

using	iterator = typename TreeType::const_iterator

using	key_compare = Compare

using	key_type = Key

using	pointer = const value_type*

using	reference = const value_type&

using	reverse_iterator = typename TreeType::const_reverse_iterator

using	size_type = fl::size

using	value_type = Key

Public Member Functions
	SetRedBlackTree (const Compare &comp=Compare(), const Allocator &alloc=Allocator())

	SetRedBlackTree (const SetRedBlackTree &other) FL_NOEXCEPT=default

	SetRedBlackTree (SetRedBlackTree &&other) FL_NOEXCEPT=default

	~SetRedBlackTree () FL_NOEXCEPT=default

const_iterator	begin () 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>
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

fl::size	erase (const Key &key)

const_iterator	erase (const_iterator pos)

const_iterator	find (const Key &key) const

allocator_type	get_allocator () const

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

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

key_compare	key_comp () const

const_iterator	lower_bound (const Key &key) const

fl::size	max_size () const

bool	operator!= (const SetRedBlackTree &other) const

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

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

bool	operator== (const SetRedBlackTree &other) const

const_reverse_iterator	rbegin () const

const_reverse_iterator	rend () const

fl::size	size () const

void	swap (SetRedBlackTree &other)

const_iterator	upper_bound (const Key &key) const

Private Types
using	TreeType = RedBlackTree<Key, Compare, Allocator>

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

Public Types