Detailed Description

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

Definition at line 526 of file rbtree.h.

#include <rbtree.h>

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

Public Types
using	iterator_category = fl::bidirectional_iterator_tag

using	value_type = T

Public Member Functions
	reverse_iterator () FL_NOEXCEPT

	reverse_iterator (RBNode n, const RedBlackTree t)

bool	operator!= (const reverse_iterator &other) const

value_type &	operator* () const

reverse_iterator &	operator++ ()

reverse_iterator	operator++ (int)

reverse_iterator &	operator-- ()

reverse_iterator	operator-- (int)

value_type *	operator-> () const

bool	operator== (const reverse_iterator &other) const

Private Member Functions
RBNode *	predecessor (RBNode *x) const

RBNode *	successor (RBNode *x) const

Private Attributes
RBNode *	mNode

const RedBlackTree *	mTree

Friends
class	const_reverse_iterator

class	RedBlackTree

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

fl/stl/detail/rbtree.h

Detailed Description

Public Types

Public Member Functions

Private Member Functions

Private Attributes

Friends