#include <tpl_dynMapTree.H>

Diagrama de herencias de Aleph::DynMapRbTree< Key, Type, Compare >

Diagrama de colaboración para Aleph::DynMapRbTree< Key, Type, Compare >:

Otros miembros heredados
Tipos públicos heredados desde Aleph::DynMapTree< Key, Type, Rb_Tree, Compare >
typedef Key	Key_Type

typedef Key	Item_Type

typedef Type	Value_Type

Tipos públicos heredados desde Aleph::DynSetTree< std::pair< Key, Type >, Rb_Tree, Dft_Pair_Cmp< Key, Type, Compare > >
typedef Rb_Tree< std::pair < Key, Type >, Dft_Pair_Cmp < Key, Type, Compare > >::Node	Node

typedef DynSetTree	Set_Type

typedef std::pair< Key, Type >	Item_Type

typedef std::pair< Key, Type >	Key_Type

Métodos públicos heredados desde Aleph::DynMapTree< Key, Type, Rb_Tree, Compare >
Type &	get_data (const Key &key)

const Key &	get_key (Type *data_ptr)

Key *	insert (const Key &key, const Type &data)

Key *	insert (const Key &key, Type &&data=Type())

Key *	insert (Key &&key, const Type &data)

Key *	insert (Key &&key, Type &&data=Type())

Key *	search_or_insert (const Key &key, const Type &data)

Type *	search_or_insert (const Key &key, Type &&data)

Type *	search_or_insert (Key &&key, const Type &data)

Type *	search_or_insert (Key &&key, Type &&data)

Key *	put (const Key &key, const Type &data)

Key *	put (const Key &key, Type &&data)

Key *	put (Key &&key, const Type &data)

Key *	put (Key &&key, Type &&data)

size_t	remove (const Key &key)

bool	test_key (const Key &key) const
	Retorna true si key está presente dentro del mapeo.

bool	has (const Key &key) const

Type *	test (const Key &key)

Type *	search (const Key &key) const

Type &	find (const Key &key)

	Map_Sequences_Methods ()

	Generate_Proxy_Operator (DynMapTree)

Métodos públicos heredados desde Aleph::DynSetTree< std::pair< Key, Type >, Rb_Tree, Dft_Pair_Cmp< Key, Type, Compare > >
void	swap (DynSetTree &dset)

	DynSetTree (Dft_Pair_Cmp< Key, Type, Compare > &&cmp=Dft_Pair_Cmp< Key, Type, Compare >())
	Instancia un conjunto dinámico vacío.

	DynSetTree (Dft_Pair_Cmp< Key, Type, Compare > &cmp)

	DynSetTree (const DynSetTree &srcTree)
	Instancia un conjunto dinámico copia de srcTree.

	DynSetTree (const DynList< std::pair< Key, Type > > &list)

	DynSetTree (DynSetTree &&srcTree)

void	empty ()
	Elimina todos los elementos del conjunto.

DynSetTree &	operator= (const DynList< std::pair< Key, Type > > &list)

DynSetTree &	operator= (const DynSetTree &srcTree)
	Asigna a this el conjunto dinámico srcTree.

DynSetTree &	operator= (DynSetTree &&srcTree)
	Asigna a this el conjunto dinámico srcTree.

virtual	~DynSetTree ()
	Destructor; todos los elementos son liberados.

std::pair< Key, Type > *	insert (const std::pair< Key, Type > &key)

std::pair< Key, Type > *	insert (std::pair< Key, Type > &&key)

std::pair< Key, Type > *	append (const std::pair< Key, Type > &key)

std::pair< Key, Type > *	append (std::pair< Key, Type > &&key)

std::pair< Key, Type > *	search_or_insert (const std::pair< Key, Type > &key)

std::pair< Key, Type > *	search_or_insert (std::pair< Key, Type > &&key)

std::pair< Key, Type > *	insert_dup (const std::pair< Key, Type > &key)

std::pair< Key, Type > *	insert_dup (std::pair< Key, Type > &&key)

std::pair< Key, Type > *	put (const std::pair< Key, Type > &key)
	Seudo sinonimo de insert; no retorna ningún valor.

std::pair< Key, Type > *	put (std::pair< Key, Type > &&key)

size_t	remove (const std::pair< Key, Type > &key)

bool	exist (const std::pair< Key, Type > &key) const
	Retorna true si key pertenece al conjunto dinámico.

bool	has (const std::pair< Key, Type > &key) const

bool	contains (const std::pair< Key, Type > &key) const

std::pair< Key, Type > &	find (const std::pair< Key, Type > &key) throw (std::exception, std::domain_error)

std::pair< int, std::pair< Key, Type > * >	find_position (const std::pair< Key, Type > &key) const

std::pair< Key, Type > *	search (const std::pair< Key, Type > &key) const throw (std::exception, std::domain_error)

const std::pair< Key, Type > &	min () const

const std::pair< Key, Type > &	get_first ()

const std::pair< Key, Type > &	max () const

const std::pair< Key, Type > &	get_last ()

const std::pair< Key, Type > &	get ()
	Sinónimo de max.

const size_t &	size () const
	Retorna la cardinalidad del conjunto.

bool	is_empty () const
	Retorna true si el conjunto está vacío.

size_t	internal_path_length () const

Node *	get_root_node () const

const std::pair< Key, Type > &	get_root () const

size_t	height () const
	Calcula y retorna la altura del árbol binario de búsqueda.

void	for_each_in_preorder (void(visitFct)(Node , int, int))

long	position (const std::pair< Key, Type > &key) const

std::pair< Key, Type > &	select (const size_t &i)

const std::pair< Key, Type > &	select (const size_t &i) const

std::pair< Key, Type > &	operator() (const size_t &i)

std::pair< Key, Type > &	access (const size_t &i)

bool	verify ()

void	for_each_preorder (Key_Op &key_op)

void	for_each_preorder (Key_Op &&key_op=Key_Op())

void	for_each_inorder (Key_Op &key_op)

void	for_each_inorder (Key_Op &&key_op=Key_Op())

void	for_each_postorder (Key_Op &key_op)

void	for_each_postorder (Key_Op &&key_op=Key_Op())

DynSetTree &	join (DynSetTree &t, DynSetTree &dup)

DynSetTree &	join (DynSetTree &t, DynSetTree &&dup=DynSetTree())

DynSetTree &	join_dup (DynSetTree &t)

bool	split_key (const std::pair< Key, Type > &key, DynSetTree &l, DynSetTree &r)

void	split_pos (const size_t pos, DynSetTree &l, DynSetTree &r)

void	split_key_dup (const std::pair< Key, Type > &key, DynSetTree &l, DynSetTree &r)

bool	traverse (Operation &op)

bool	traverse (Operation &&op=Operation())

bool	traverse (Operation &op) const

bool	traverse (Operation &&op=Operation()) const

	Functional_Methods (std::pair< Key, Type >)

	Generic_Keys (std::pair< Key, Type >)

	Equal_To_Method (DynSetTree)

Descripción detallada

template<typename Key, typename Type, class Compare = Aleph::less<Key>>
class Aleph::DynMapRbTree< Key, Type, Compare >

Mapeo dinámico implementado con árboles binario de búsqueda rojo-negro.

Ver también: Rb_Tree DynMapTree

La documentación para esta clase fue generada a partir del siguiente fichero:

tpl_dynMapTree.H

Otros miembros heredados

Descripción detallada

template<typename Key, typename Type, class Compare = Aleph::less<Key>> class Aleph::DynMapRbTree< Key, Type, Compare >

template<typename Key, typename Type, class Compare = Aleph::less<Key>>
class Aleph::DynMapRbTree< Key, Type, Compare >