_Rb_tree< _Key, _Compare, _Value, _KeyOfValue, _Traits, > Class Template Reference

#include <_tree.h>

Inherits _Rb_tree_base< _Value, _Alloc >.

Public Types
typedef _Key	key_type
typedef _Value	value_type
typedef _Traits::pointer	pointer
typedef const value_type *	const_pointer
typedef _Traits::reference	reference
typedef const value_type &	const_reference
typedef size_t	size_type
typedef ptrdiff_t	difference_type
typedef bidirectional_iterator_tag	_Iterator_category
typedef _Base::allocator_type	allocator_type
typedef _Traits::_NonConstTraits	_NonConstTraits
typedef _Traits::_ConstTraits	_ConstTraits
typedef _Rb_tree_iterator < value_type, _NonConstTraits >	iterator
typedef _Rb_tree_iterator < value_type, _ConstTraits >	const_iterator
typedef _Base::key_type	key_type
typedef _Traits::_NonConstTraits	_NonConstIteTraits
typedef _Traits::_ConstTraits	_ConstIteTraits
typedef _STLP_PRIV _DBG_iter < _Base, _STLP_PRIV _DbgTraits < _NonConstIteTraits > >	iterator
typedef _STLP_PRIV _DBG_iter < _Base, _STLP_PRIV _DbgTraits < _ConstIteTraits > >	const_iterator
Public Member Functions
	_Rb_tree ()
	_Rb_tree (const _Compare &__comp)
	_Rb_tree (const _Compare &__comp, const allocator_type &__a)
	_Rb_tree (const _Self &__x)
	_Rb_tree (__move_source< _Self > src)
	~_Rb_tree ()
_Self &	operator= (const _Self &__x)
_Compare	key_comp () const
iterator	begin ()
const_iterator	begin () const
iterator	end ()
const_iterator	end () const
reverse_iterator	rbegin ()
const_reverse_iterator	rbegin () const
reverse_iterator	rend ()
const_reverse_iterator	rend () const
bool	empty () const
size_type	size () const
size_type	max_size () const
void	swap (_Self &__t)
pair< iterator, bool >	insert_unique (const value_type &__x)
iterator	insert_equal (const value_type &__x)
iterator	insert_unique (iterator __pos, const value_type &__x)
iterator	insert_equal (iterator __pos, const value_type &__x)
void	insert_unique (const_iterator __first, const_iterator __last)
void	insert_unique (const value_type *__first, const value_type *__last)
void	insert_equal (const_iterator __first, const_iterator __last)
void	insert_equal (const value_type *__first, const value_type *__last)
void	erase (iterator __pos)
size_type	erase (const key_type &__x)
size_type	erase_unique (const key_type &__x)
void	erase (iterator __first, iterator __last)
void	erase (const key_type *__first, const key_type *__last)
void	clear ()
_STLP_TEMPLATE_FOR_CONT_EXT iterator	find (const _KT &__k)
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator	find (const _KT &__k) const
_STLP_TEMPLATE_FOR_CONT_EXT size_type	count (const _KT &__x) const
_STLP_TEMPLATE_FOR_CONT_EXT iterator	lower_bound (const _KT &__x)
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator	lower_bound (const _KT &__x) const
_STLP_TEMPLATE_FOR_CONT_EXT iterator	upper_bound (const _KT &__x)
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator	upper_bound (const _KT &__x) const
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator >	equal_range (const _KT &__x)
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iterator >	equal_range (const _KT &__x) const
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator >	equal_range_unique (const _KT &__x)
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iterator >	equal_range_unique (const _KT &__x) const
	_Rb_tree ()
	_Rb_tree (const _Compare &__comp)
	_Rb_tree (const _Compare &__comp, const allocator_type &__a)
	_Rb_tree (const _Self &__x)
	_Rb_tree (__move_source< _Self > src)
	~_Rb_tree ()
_Self &	operator= (const _Self &__x)
allocator_type	get_allocator () const
_Compare	key_comp () const
iterator	begin ()
const_iterator	begin () const
iterator	end ()
const_iterator	end () const
reverse_iterator	rbegin ()
const_reverse_iterator	rbegin () const
reverse_iterator	rend ()
const_reverse_iterator	rend () const
bool	empty () const
size_type	size () const
size_type	max_size () const
_STLP_TEMPLATE_FOR_CONT_EXT size_type	count (const _KT &__x) const
void	swap (_Self &__t)
_STLP_TEMPLATE_FOR_CONT_EXT iterator	find (const _KT &__k)
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator	find (const _KT &__k) const
_STLP_TEMPLATE_FOR_CONT_EXT iterator	lower_bound (const _KT &__x)
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator	lower_bound (const _KT &__x) const
_STLP_TEMPLATE_FOR_CONT_EXT iterator	upper_bound (const _KT &__x)
_STLP_TEMPLATE_FOR_CONT_EXT const_iterator	upper_bound (const _KT &__x) const
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator >	equal_range (const _KT &__x)
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iterator >	equal_range (const _KT &__x) const
_STLP_TEMPLATE_FOR_CONT_EXT pair< iterator, iterator >	equal_range_unique (const _KT &__x)
_STLP_TEMPLATE_FOR_CONT_EXT pair< const_iterator, const_iterator >	equal_range_unique (const _KT &__x) const
pair< iterator, bool >	insert_unique (const value_type &__x)
iterator	insert_equal (const value_type &__x)
iterator	insert_unique (iterator __pos, const value_type &__x)
iterator	insert_equal (iterator __pos, const value_type &__x)
void	insert_unique (const_iterator __first, const_iterator __last)
void	insert_unique (const value_type *__first, const value_type *__last)
void	insert_equal (const_iterator __first, const_iterator __last)
void	insert_equal (const value_type *__first, const value_type *__last)
void	erase (iterator __pos)
size_type	erase (const key_type &__x)
size_type	erase_unique (const key_type &__x)
void	erase (iterator __first, iterator __last)
void	erase (const key_type *__first, const key_type *__last)
void	clear ()
Data Fields
	_STLP_DECLARE_BIDIRECTIONAL_REVERSE_ITERATORS
Protected Types
typedef _Rb_tree_node_base *	_Base_ptr
typedef _Rb_tree_node< _Value >	_Node
typedef _Node *	_Link_type
typedef _Rb_tree_Color_type	_Color_type
Protected Member Functions
_Base_ptr	_M_create_node (const value_type &__x)
_Base_ptr	_M_clone_node (_Base_ptr __x)
_Base_ptr	_M_root () const
_Base_ptr	_M_leftmost () const
_Base_ptr	_M_rightmost () const
_Base_ptr &	_M_root ()
_Base_ptr &	_M_leftmost ()
_Base_ptr &	_M_rightmost ()
Static Protected Member Functions
static _Base_ptr &_STLP_CALL	_S_left (_Base_ptr __x)
static _Base_ptr &_STLP_CALL	_S_right (_Base_ptr __x)
static _Base_ptr &_STLP_CALL	_S_parent (_Base_ptr __x)
static value_type &_STLP_CALL	_S_value (_Base_ptr __x)
static const _Key &_STLP_CALL	_S_key (_Base_ptr __x)
static _Color_type &_STLP_CALL	_S_color (_Base_ptr __x)
static _Base_ptr _STLP_CALL	_S_minimum (_Base_ptr __x)
static _Base_ptr _STLP_CALL	_S_maximum (_Base_ptr __x)
Protected Attributes
size_type	_M_node_count
_Compare	_M_key_compare
Private Types
typedef _Rb_tree_base< _Value, _Alloc >	_Base
typedef _Rb_tree< _Key, _Compare, _Value, _KeyOfValue, _Traits, _Alloc >	_Self
typedef _STLP_NON_DBG_TREE	_Base
typedef _Rb_tree< _Key, _Compare, _Value, _KeyOfValue, _Traits, _Alloc >	_Self
typedef _Base::iterator	_Base_iterator
typedef _Base::const_iterator	_Base_const_iterator
Private Member Functions
iterator	_M_insert (_Base_ptr __parent, const value_type &__val, _Base_ptr __on_left=0, _Base_ptr __on_right=0)
_Base_ptr	_M_copy (_Base_ptr __x, _Base_ptr __p)
void	_M_erase (_Base_ptr __x)
_STLP_TEMPLATE_FOR_CONT_EXT _Base_ptr	_M_find (const _KT &__k) const
_STLP_TEMPLATE_FOR_CONT_EXT _Base_ptr	_M_lower_bound (const _KT &__k) const
_STLP_TEMPLATE_FOR_CONT_EXT _Base_ptr	_M_upper_bound (const _KT &__k) const
void	_Invalidate_iterator (const iterator &__it)
void	_Invalidate_iterators (const iterator &__first, const iterator &__last)
Private Attributes
_Base	_M_non_dbg_impl
_STLP_PRIV __owned_list	_M_iter_list

---

Detailed Description

template<class _Key, class _Compare, class _Value, class _KeyOfValue, class _Traits, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >)>
class _Rb_tree< _Key, _Compare, _Value, _KeyOfValue, _Traits, >

Definition at line 292 of file _tree.h.

---

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

• include/c++/stlport/stl/_tree.h
• include/c++/stlport/stl/debug/_tree.h
• include/c++/stlport/stl/_tree.c