Detailed Description

template<typename T, typename Compare = less<T>, typename Allocator = allocator_slab<char>>
class fl::RedBlackTree< T, Compare, Allocator >

Definition at line 19 of file rbtree.h.

#include <rbtree.h>

Inheritance diagram for fl::RedBlackTree< T, Compare, Allocator >:

Collaboration diagram for fl::RedBlackTree< T, Compare, Allocator >:

Public Types
using	allocator_type = Allocator

enum	Color { RED , BLACK }

using	compare_type = Compare

using	const_pointer = const value_type*

using	const_reference = const value_type&

using	difference_type = ptrdiff_t

using	pointer = value_type*

using	reference = value_type&

using	size_type = fl::size

using	value_type = T

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

	RedBlackTree (const RedBlackTree &other)

	~RedBlackTree ()

iterator	begin ()

const_iterator	begin () const

const_iterator	cbegin () const

const_iterator	cend () const

void	clear ()

bool	contains (const value_type &value) const

fl::size	count (const value_type &value) const

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

bool	empty () const

iterator	end ()

const_iterator	end () const

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

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

fl::size	erase (const value_type &value)

iterator	erase (const_iterator pos)

iterator	find (const value_type &value)

const_iterator	find (const value_type &value) const

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

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

iterator	lower_bound (const value_type &value)

const_iterator	lower_bound (const value_type &value) const

fl::size	max_size () const

bool	operator!= (const RedBlackTree &other) const

RedBlackTree &	operator= (const RedBlackTree &other)

bool	operator== (const RedBlackTree &other) const

fl::size	size () const

void	swap (RedBlackTree &other)

iterator	upper_bound (const value_type &value)

const_iterator	upper_bound (const value_type &value) const

compare_type	value_comp () const

Private Types
using	NodeAllocator = typename Allocator::template rebind<RBNode>::other

Private Member Functions
RBNode *	copyTree (RBNode node, RBNode parent=nullptr)

void	deleteFixup (RBNode x, RBNode xParent)

void	destroyTree (RBNode *node)

RBNode *	findNode (const value_type &value) const

void	insertFixup (RBNode *z)

template<typename U>
fl::pair< iterator, bool >	insertImpl (U &&value)

RBNode *	lowerBoundNode (const value_type &value) const

RBNode *	maximum (RBNode *x) const

RBNode *	minimum (RBNode *x) const

void	rotateLeft (RBNode *x)

void	rotateRight (RBNode *x)

void	transplant (RBNode u, RBNode v)

RBNode *	upperBoundNode (const value_type &value) const

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

Classes