pfc::avltree_t< t_storage, t_comparator > Class Template Reference

#include <avltree.h>

List of all members.

Public Types
typedef avltree_t< t_storage, t_comparator >	t_self
typedef pfc::const_iterator < t_storage >	const_iterator
typedef pfc::iterator< t_storage >	iterator
typedef t_storage	t_item
Public Member Functions
	avltree_t ()
	~avltree_t ()
const t_self &	operator= (const t_self &p_other)
	avltree_t (const t_self &p_other)
template<typename t_other>
const t_self &	operator= (const t_other &p_other)
template<typename t_other>
	avltree_t (const t_other &p_other)
template<bool inclusive, bool above, typename t_search>
const t_storage *	find_nearest_item (const t_search &p_search) const
template<bool inclusive, bool above, typename t_search>
t_storage *	find_nearest_item (const t_search &p_search)
template<typename t_param>
t_storage &	add_item (t_param const &p_item)
template<typename t_param>
t_self &	operator+= (const t_param &p_item)
template<typename t_param>
t_self &	operator-= (const t_param &p_item)
template<typename t_param>
bool	add_item_check (t_param const &item)
	Returns true when the list has been altered, false when the item was already present before.
template<typename t_param>
t_storage &	add_item_ex (t_param const &p_item, bool &p_isnew)
template<typename t_param>
void	set_item (const t_param &p_item)
template<typename t_param>
const t_storage *	find_item_ptr (t_param const &p_item) const
template<typename t_param>
t_storage *	find_item_ptr (t_param const &p_item)
	WARNING: caller must not alter the item in a way that changes the sort order.
template<typename t_param>
bool	contains (const t_param &p_item) const
template<typename t_param>
bool	have_item (const t_param &p_item) const
	Same as contains().
void	remove_all () throw ()
bool	remove (const_iterator const &iter)
template<typename t_param>
bool	remove_item (t_param const &p_item)
t_size	get_count () const throw ()
template<typename t_callback>
void	enumerate (t_callback &p_callback) const
template<typename t_callback>
void	_enumerate_var (t_callback &p_callback)
template<typename t_param>
iterator	insert (const t_param &p_item)
template<typename t_param>
t_storage &	add (const t_param &p_item)
template<typename t_param>
t_storage &	add_ex (const t_param &p_item, bool &p_isnew)
template<typename t_param>
const t_storage *	find_ptr (t_param const &p_item) const
template<typename t_param>
t_storage *	find_ptr (t_param const &p_item)
template<typename t_param>
bool	exists (t_param const &p_item) const
void	reset ()
const_iterator	first () const throw ()
const_iterator	last () const throw ()
iterator	_first_var ()
iterator	_last_var ()
template<typename t_param>
bool	get_first (t_param &p_item) const throw ()
template<typename t_param>
bool	get_last (t_param &p_item) const throw ()
bool	operator== (const t_self &other) const
bool	operator!= (const t_self &other) const
Static Public Member Functions
static bool	equals (const t_self &v1, const t_self &v2)

template<typename t_storage, typename t_comparator = comparator_default>
class pfc::avltree_t< t_storage, t_comparator >

---

Member Typedef Documentation

template<typename t_storage, typename t_comparator = comparator_default>

typedef avltree_t<t_storage,t_comparator> pfc::avltree_t< t_storage, t_comparator >::t_self

template<typename t_storage, typename t_comparator = comparator_default>

typedef pfc::const_iterator<t_storage> pfc::avltree_t< t_storage, t_comparator >::const_iterator

template<typename t_storage, typename t_comparator = comparator_default>

typedef pfc::iterator<t_storage> pfc::avltree_t< t_storage, t_comparator >::iterator

template<typename t_storage, typename t_comparator = comparator_default>

typedef t_storage pfc::avltree_t< t_storage, t_comparator >::t_item

---

Constructor & Destructor Documentation

template<typename t_storage, typename t_comparator = comparator_default>

pfc::avltree_t< t_storage, t_comparator >::avltree_t

(

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

pfc::avltree_t< t_storage, t_comparator >::~avltree_t

(

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

pfc::avltree_t< t_storage, t_comparator >::avltree_t

(

const t_self &

p_other

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_other>

pfc::avltree_t< t_storage, t_comparator >::avltree_t

(

const t_other &

p_other

)

[inline]

---

Member Function Documentation

template<typename t_storage, typename t_comparator = comparator_default>

const t_self& pfc::avltree_t< t_storage, t_comparator >::operator=

(

const t_self &

p_other

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_other>

const t_self& pfc::avltree_t< t_storage, t_comparator >::operator=

(

const t_other &

p_other

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<bool inclusive, bool above, typename t_search>

const t_storage* pfc::avltree_t< t_storage, t_comparator >::find_nearest_item

(

const t_search &

p_search

)

const [inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<bool inclusive, bool above, typename t_search>

t_storage* pfc::avltree_t< t_storage, t_comparator >::find_nearest_item

(

const t_search &

p_search

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

t_storage& pfc::avltree_t< t_storage, t_comparator >::add_item

(

t_param const &

p_item

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

t_self& pfc::avltree_t< t_storage, t_comparator >::operator+=

(

const t_param &

p_item

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

t_self& pfc::avltree_t< t_storage, t_comparator >::operator-=

(

const t_param &

p_item

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

bool pfc::avltree_t< t_storage, t_comparator >::add_item_check

(

t_param const &

item

)

[inline]

Returns true when the list has been altered, false when the item was already present before.

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

t_storage& pfc::avltree_t< t_storage, t_comparator >::add_item_ex	(	t_param const &	p_item,
		bool &	p_isnew
	)			[inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

void pfc::avltree_t< t_storage, t_comparator >::set_item

(

const t_param &

p_item

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

const t_storage* pfc::avltree_t< t_storage, t_comparator >::find_item_ptr

(

t_param const &

p_item

)

const [inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

t_storage* pfc::avltree_t< t_storage, t_comparator >::find_item_ptr

(

t_param const &

p_item

)

[inline]

WARNING: caller must not alter the item in a way that changes the sort order.

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

bool pfc::avltree_t< t_storage, t_comparator >::contains

(

const t_param &

p_item

)

const [inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

bool pfc::avltree_t< t_storage, t_comparator >::have_item

(

const t_param &

p_item

)

const [inline]

Same as contains().

template<typename t_storage, typename t_comparator = comparator_default>

void pfc::avltree_t< t_storage, t_comparator >::remove_all

(

)

throw () [inline]

template<typename t_storage, typename t_comparator = comparator_default>

bool pfc::avltree_t< t_storage, t_comparator >::remove

(

const_iterator const &

iter

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

bool pfc::avltree_t< t_storage, t_comparator >::remove_item

(

t_param const &

p_item

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

t_size pfc::avltree_t< t_storage, t_comparator >::get_count

(

)

const throw () [inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_callback>

void pfc::avltree_t< t_storage, t_comparator >::enumerate

(

t_callback &

p_callback

)

const [inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_callback>

void pfc::avltree_t< t_storage, t_comparator >::_enumerate_var

(

t_callback &

p_callback

)

[inline]

Allows callback to modify the tree content. WARNING: items must not be altered in a way that changes their sort order.

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

iterator pfc::avltree_t< t_storage, t_comparator >::insert

(

const t_param &

p_item

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

t_storage& pfc::avltree_t< t_storage, t_comparator >::add

(

const t_param &

p_item

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

t_storage& pfc::avltree_t< t_storage, t_comparator >::add_ex	(	const t_param &	p_item,
		bool &	p_isnew
	)			[inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

const t_storage* pfc::avltree_t< t_storage, t_comparator >::find_ptr

(

t_param const &

p_item

)

const [inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

t_storage* pfc::avltree_t< t_storage, t_comparator >::find_ptr

(

t_param const &

p_item

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

bool pfc::avltree_t< t_storage, t_comparator >::exists

(

t_param const &

p_item

)

const [inline]

template<typename t_storage, typename t_comparator = comparator_default>

void pfc::avltree_t< t_storage, t_comparator >::reset

(

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

const_iterator pfc::avltree_t< t_storage, t_comparator >::first

(

)

const throw () [inline]

template<typename t_storage, typename t_comparator = comparator_default>

const_iterator pfc::avltree_t< t_storage, t_comparator >::last

(

)

const throw () [inline]

template<typename t_storage, typename t_comparator = comparator_default>

iterator pfc::avltree_t< t_storage, t_comparator >::_first_var

(

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

iterator pfc::avltree_t< t_storage, t_comparator >::_last_var

(

)

[inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

bool pfc::avltree_t< t_storage, t_comparator >::get_first

(

t_param &

p_item

)

const throw () [inline]

template<typename t_storage, typename t_comparator = comparator_default>

template<typename t_param>

bool pfc::avltree_t< t_storage, t_comparator >::get_last

(

t_param &

p_item

)

const throw () [inline]

template<typename t_storage, typename t_comparator = comparator_default>

static bool pfc::avltree_t< t_storage, t_comparator >::equals	(	const t_self &	v1,
		const t_self &	v2
	)			[inline, static]

template<typename t_storage, typename t_comparator = comparator_default>

bool pfc::avltree_t< t_storage, t_comparator >::operator==

(

const t_self &

other

)

const [inline]

template<typename t_storage, typename t_comparator = comparator_default>

bool pfc::avltree_t< t_storage, t_comparator >::operator!=

(

const t_self &

other

)

const [inline]

---

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

• pfc/avltree.h