/home/gian/Progetti/falcon/core/include/falcon/xtree_fix.h File Reference

#include <cstddef>
#include <iterator>
#include <memory>
#include <xutility>

Include dependency graph for xtree_fix.h:

Go to the source code of this file.

Classes
class	_Tree< _K, _Ty, _Kfn, _Pr, _A >
struct	_Tree< _K, _Ty, _Kfn, _Pr, _A >::_Tree::_Node
class	_Tree< _K, _Ty, _Kfn, _Pr, _A >::_Tree::const_iterator
class	_Tree< _K, _Ty, _Kfn, _Pr, _A >::_Tree::iterator
Defines
#define	_IsNil(x)   (_Left(x) == 0)
#define	_IsNotNil(x)   (_Left(x) != 0)
Functions
template<class _K , class _Ty , class _Kfn , class _Pr , class _A >
bool	operator!= (const _Tree< _K, _Ty, _Kfn, _Pr, _A > &_X, const _Tree< _K, _Ty, _Kfn, _Pr, _A > &_Y)
template<class _K , class _Ty , class _Kfn , class _Pr , class _A >
bool	operator< (const _Tree< _K, _Ty, _Kfn, _Pr, _A > &_X, const _Tree< _K, _Ty, _Kfn, _Pr, _A > &_Y)
template<class _K , class _Ty , class _Kfn , class _Pr , class _A >
bool	operator<= (const _Tree< _K, _Ty, _Kfn, _Pr, _A > &_X, const _Tree< _K, _Ty, _Kfn, _Pr, _A > &_Y)
template<class _K , class _Ty , class _Kfn , class _Pr , class _A >
bool	operator== (const _Tree< _K, _Ty, _Kfn, _Pr, _A > &_X, const _Tree< _K, _Ty, _Kfn, _Pr, _A > &_Y)
template<class _K , class _Ty , class _Kfn , class _Pr , class _A >
bool	operator> (const _Tree< _K, _Ty, _Kfn, _Pr, _A > &_X, const _Tree< _K, _Ty, _Kfn, _Pr, _A > &_Y)
template<class _K , class _Ty , class _Kfn , class _Pr , class _A >
bool	operator>= (const _Tree< _K, _Ty, _Kfn, _Pr, _A > &_X, const _Tree< _K, _Ty, _Kfn, _Pr, _A > &_Y)

---

Define Documentation

#define _IsNil

(

x

)

(_Left(x) == 0)

Referenced by _Tree< _K, _Ty, _Kfn, _Pr, _A >::erase(), and _Tree< _K, _Ty, _Kfn, _Pr, _A >::insert().

#define _IsNotNil

(

x

)

(_Left(x) != 0)

Referenced by _Tree< _K, _Ty, _Kfn, _Pr, _A >::_Copy(), _Tree< _K, _Ty, _Kfn, _Pr, _A >::_Tree::const_iterator::_Dec(), _Tree< _K, _Ty, _Kfn, _Pr, _A >::_Erase(), _Tree< _K, _Ty, _Kfn, _Pr, _A >::_Tree::const_iterator::_Inc(), _Tree< _K, _Ty, _Kfn, _Pr, _A >::_Insert(), _Tree< _K, _Ty, _Kfn, _Pr, _A >::_Lbound(), _Tree< _K, _Ty, _Kfn, _Pr, _A >::_Lrotate(), _Tree< _K, _Ty, _Kfn, _Pr, _A >::_Max(), _Tree< _K, _Ty, _Kfn, _Pr, _A >::_Min(), _Tree< _K, _Ty, _Kfn, _Pr, _A >::_Rrotate(), _Tree< _K, _Ty, _Kfn, _Pr, _A >::_Ubound(), and _Tree< _K, _Ty, _Kfn, _Pr, _A >::insert().

---

Function Documentation

template<class _K , class _Ty , class _Kfn , class _Pr , class _A >

bool operator!=	(	const _Tree< _K, _Ty, _Kfn, _Pr, _A > &	_X,
		const _Tree< _K, _Ty, _Kfn, _Pr, _A > &	_Y
	)			[inline]

template<class _K , class _Ty , class _Kfn , class _Pr , class _A >

bool operator<	(	const _Tree< _K, _Ty, _Kfn, _Pr, _A > &	_X,
		const _Tree< _K, _Ty, _Kfn, _Pr, _A > &	_Y
	)			[inline]

template<class _K , class _Ty , class _Kfn , class _Pr , class _A >

bool operator<=	(	const _Tree< _K, _Ty, _Kfn, _Pr, _A > &	_X,
		const _Tree< _K, _Ty, _Kfn, _Pr, _A > &	_Y
	)			[inline]

template<class _K , class _Ty , class _Kfn , class _Pr , class _A >

bool operator==	(	const _Tree< _K, _Ty, _Kfn, _Pr, _A > &	_X,
		const _Tree< _K, _Ty, _Kfn, _Pr, _A > &	_Y
	)			[inline]

References _Tree< _K, _Ty, _Kfn, _Pr, _A >::begin(), _Tree< _K, _Ty, _Kfn, _Pr, _A >::end(), and _Tree< _K, _Ty, _Kfn, _Pr, _A >::size().

template<class _K , class _Ty , class _Kfn , class _Pr , class _A >

bool operator>	(	const _Tree< _K, _Ty, _Kfn, _Pr, _A > &	_X,
		const _Tree< _K, _Ty, _Kfn, _Pr, _A > &	_Y
	)			[inline]

template<class _K , class _Ty , class _Kfn , class _Pr , class _A >

bool operator>=	(	const _Tree< _K, _Ty, _Kfn, _Pr, _A > &	_X,
		const _Tree< _K, _Ty, _Kfn, _Pr, _A > &	_Y
	)			[inline]