Intrusive binary tree constant reverse iterator. More...

#include <bintree.h>

Public Types
typedef T	value_type

typedef value_type &	reference

typedef const value_type &	const_reference

typedef value_type *	pointer

typedef const value_type *	const_pointer

typedef ptrdiff_t	difference_type

typedef size_t	size_type

typedef std::bidirectional_iterator_tag	iterator_category

Public Member Functions
	BinTreeConstReverseIterator () noexcept

	BinTreeConstReverseIterator (const TContainer container, const T node) noexcept

	BinTreeConstReverseIterator (const BinTreeReverseIterator< TContainer, T > &it) noexcept

	BinTreeConstReverseIterator (const BinTreeConstReverseIterator &it) noexcept=default

	BinTreeConstReverseIterator (BinTreeConstReverseIterator &&it) noexcept=default

	~BinTreeConstReverseIterator () noexcept=default

BinTreeConstReverseIterator &	operator= (const BinTreeReverseIterator< TContainer, T > &it) noexcept

BinTreeConstReverseIterator &	operator= (const BinTreeConstReverseIterator &it) noexcept=default

BinTreeConstReverseIterator &	operator= (BinTreeConstReverseIterator &&it) noexcept=default

BinTreeConstReverseIterator &	operator++ () noexcept

BinTreeConstReverseIterator	operator++ (int) noexcept

const_reference	operator* () const noexcept

const_pointer	operator-> () const noexcept

	operator bool () const noexcept
	Check if the iterator is valid. More...

bool	compare (const T &item1, const T &item2) const noexcept
	Compare two items: if the first item is less than the second one? More...

void	swap (BinTreeConstReverseIterator &it) noexcept
	Swap two instances. More...

Friends
bool	operator== (const BinTreeConstReverseIterator &it1, const BinTreeConstReverseIterator &it2) noexcept

bool	operator!= (const BinTreeConstReverseIterator &it1, const BinTreeConstReverseIterator &it2) noexcept

template<class UContainer , typename U >
void	swap (BinTreeConstReverseIterator< UContainer, U > &it1, BinTreeConstReverseIterator< UContainer, U > &it2) noexcept

Detailed Description

template<class TContainer, typename T>
class CppCommon::BinTreeConstReverseIterator< TContainer, T >

Intrusive binary tree constant reverse iterator.

Not thread-safe.

Definition at line 447 of file bintree.h.

Member Typedef Documentation

◆ const_pointer

template<class TContainer , typename T >

typedef const value_type* CppCommon::BinTreeConstReverseIterator< TContainer, T >::const_pointer

Definition at line 455 of file bintree.h.

◆ const_reference

template<class TContainer , typename T >

typedef const value_type& CppCommon::BinTreeConstReverseIterator< TContainer, T >::const_reference

Definition at line 453 of file bintree.h.

◆ difference_type

template<class TContainer , typename T >

typedef ptrdiff_t CppCommon::BinTreeConstReverseIterator< TContainer, T >::difference_type

Definition at line 456 of file bintree.h.

◆ iterator_category

template<class TContainer , typename T >

typedef std::bidirectional_iterator_tag CppCommon::BinTreeConstReverseIterator< TContainer, T >::iterator_category

Definition at line 458 of file bintree.h.

◆ pointer

template<class TContainer , typename T >

typedef value_type* CppCommon::BinTreeConstReverseIterator< TContainer, T >::pointer

Definition at line 454 of file bintree.h.

◆ reference

template<class TContainer , typename T >

typedef value_type& CppCommon::BinTreeConstReverseIterator< TContainer, T >::reference

Definition at line 452 of file bintree.h.

◆ size_type

template<class TContainer , typename T >

typedef size_t CppCommon::BinTreeConstReverseIterator< TContainer, T >::size_type

Definition at line 457 of file bintree.h.

◆ value_type

template<class TContainer , typename T >

typedef T CppCommon::BinTreeConstReverseIterator< TContainer, T >::value_type

Definition at line 451 of file bintree.h.

Constructor & Destructor Documentation

◆ BinTreeConstReverseIterator() [1/5]

template<class TContainer , typename T >

CppCommon::BinTreeConstReverseIterator< TContainer, T >::BinTreeConstReverseIterator ( )

inlinenoexcept

Definition at line 460 of file bintree.h.

◆ BinTreeConstReverseIterator() [2/5]

template<class TContainer , typename T >

CppCommon::BinTreeConstReverseIterator< TContainer, T >::BinTreeConstReverseIterator	(	const TContainer *	container,
		const T *	node
	)

inlineexplicitnoexcept

Definition at line 461 of file bintree.h.

◆ BinTreeConstReverseIterator() [3/5]

template<class TContainer , typename T >

CppCommon::BinTreeConstReverseIterator< TContainer, T >::BinTreeConstReverseIterator ( const BinTreeReverseIterator< TContainer, T > & it )

inlinenoexcept

Definition at line 462 of file bintree.h.

◆ BinTreeConstReverseIterator() [4/5]

template<class TContainer , typename T >

CppCommon::BinTreeConstReverseIterator< TContainer, T >::BinTreeConstReverseIterator ( const BinTreeConstReverseIterator< TContainer, T > & it )

defaultnoexcept

◆ BinTreeConstReverseIterator() [5/5]

template<class TContainer , typename T >

CppCommon::BinTreeConstReverseIterator< TContainer, T >::BinTreeConstReverseIterator ( BinTreeConstReverseIterator< TContainer, T > && it )

defaultnoexcept

◆ ~BinTreeConstReverseIterator()

template<class TContainer , typename T >

CppCommon::BinTreeConstReverseIterator< TContainer, T >::~BinTreeConstReverseIterator ( )

defaultnoexcept

Member Function Documentation

◆ compare()

template<class TContainer , typename T >

bool CppCommon::BinTreeConstReverseIterator< TContainer, T >::compare	(	const T &	item1,
		const T &	item2
	)		const

inlinenoexcept

Compare two items: if the first item is less than the second one?

Definition at line 487 of file bintree.h.

◆ operator bool()

template<class TContainer , typename T >

CppCommon::BinTreeConstReverseIterator< TContainer, T >::operator bool ( ) const

inlineexplicitnoexcept

Check if the iterator is valid.

Definition at line 484 of file bintree.h.

◆ operator*()

template<class TContainer , typename T >

BinTreeConstReverseIterator< TContainer, T >::const_reference CppCommon::BinTreeConstReverseIterator< TContainer, T >::operator*

noexcept

Definition at line 621 of file bintree.inl.

◆ operator++() [1/2]

template<class TContainer , typename T >

BinTreeConstReverseIterator< TContainer, T > & CppCommon::BinTreeConstReverseIterator< TContainer, T >::operator++

noexcept

Definition at line 592 of file bintree.inl.

◆ operator++() [2/2]

template<class TContainer , typename T >

BinTreeConstReverseIterator< TContainer, T > CppCommon::BinTreeConstReverseIterator< TContainer, T >::operator++ ( int )

inlinenoexcept

Definition at line 613 of file bintree.inl.

◆ operator->()

template<class TContainer , typename T >

BinTreeConstReverseIterator< TContainer, T >::const_pointer CppCommon::BinTreeConstReverseIterator< TContainer, T >::operator->

noexcept

Definition at line 629 of file bintree.inl.

◆ operator=() [1/3]

template<class TContainer , typename T >

BinTreeConstReverseIterator& CppCommon::BinTreeConstReverseIterator< TContainer, T >::operator= ( BinTreeConstReverseIterator< TContainer, T > && it )

defaultnoexcept

◆ operator=() [2/3]

template<class TContainer , typename T >

BinTreeConstReverseIterator& CppCommon::BinTreeConstReverseIterator< TContainer, T >::operator= ( const BinTreeConstReverseIterator< TContainer, T > & it )

defaultnoexcept

◆ operator=() [3/3]

template<class TContainer , typename T >

BinTreeConstReverseIterator& CppCommon::BinTreeConstReverseIterator< TContainer, T >::operator= ( const BinTreeReverseIterator< TContainer, T > & it )

inlinenoexcept

Definition at line 467 of file bintree.h.

◆ swap()

template<class TContainer , typename T >

void CppCommon::BinTreeConstReverseIterator< TContainer, T >::swap ( BinTreeConstReverseIterator< TContainer, T > & it )

noexcept

Swap two instances.

Definition at line 635 of file bintree.inl.

Friends And Related Function Documentation

◆ operator!=

template<class TContainer , typename T >

bool operator!=	(	const BinTreeConstReverseIterator< TContainer, T > &	it1,
		const BinTreeConstReverseIterator< TContainer, T > &	it2
	)

friend

Definition at line 474 of file bintree.h.

◆ operator==

template<class TContainer , typename T >

bool operator==	(	const BinTreeConstReverseIterator< TContainer, T > &	it1,
		const BinTreeConstReverseIterator< TContainer, T > &	it2
	)

friend

Definition at line 472 of file bintree.h.

◆ swap

template<class TContainer , typename T >

template<class UContainer , typename U >

void swap	(	BinTreeConstReverseIterator< UContainer, U > &	it1,
		BinTreeConstReverseIterator< UContainer, U > &	it2
	)

friend

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

include/containers/bintree.h
include/containers/bintree.inl

Public Types

Public Member Functions

Friends

Detailed Description

template<class TContainer, typename T> class CppCommon::BinTreeConstReverseIterator< TContainer, T >

Member Typedef Documentation

◆ const_pointer

◆ const_reference

◆ difference_type

◆ iterator_category

◆ pointer

◆ reference

◆ size_type

◆ value_type

Constructor & Destructor Documentation

◆ BinTreeConstReverseIterator() [1/5]

◆ BinTreeConstReverseIterator() [2/5]

◆ BinTreeConstReverseIterator() [3/5]

◆ BinTreeConstReverseIterator() [4/5]

◆ BinTreeConstReverseIterator() [5/5]

◆ ~BinTreeConstReverseIterator()

Member Function Documentation

◆ compare()

◆ operator bool()

◆ operator*()

◆ operator++() [1/2]

◆ operator++() [2/2]

◆ operator->()

◆ operator=() [1/3]

◆ operator=() [2/3]

◆ operator=() [3/3]

◆ swap()

Friends And Related Function Documentation

◆ operator!=

◆ operator==

◆ swap

template<class TContainer, typename T>
class CppCommon::BinTreeConstReverseIterator< TContainer, T >