Whole document tree
Templatestd::_Rb_tree class Reference
Main Page Namespace List Class Hierarchy Alphabetical List Compound List File List Namespace Members Compound Members File Members
std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc > Class Template Reference #include <stl_tree.h >
Inheritance diagram for std::_Rb_tree:
[legend ] Collaboration diagram for std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >:
[legend ] List of all members.
Public Types
typedef _Key key_type
typedef _Value value_type
typedef value_type * pointer
typedef const value_type * const_pointer
typedef value_type & reference
typedef const value_type & const_reference
typedef _Rb_tree_node * _Link_type
typedef size_t size_type
typedef ptrdiff_t difference_type
typedef _Base::allocator_type allocator_type
typedef _Rb_tree_iterator <
value_type , reference , pointer > iterator
typedef _Rb_tree_iterator <
value_type , const_reference ,
const_pointer > const_iterator
typedef reverse_iterator <
const_iterator > const_reverse_iterator
typedef reverse_iterator<
iterator > reverse_iterator
Public Methods
allocator_type get_allocator () const
_Rb_tree ()
_Rb_tree (const _Compare &__comp)
_Rb_tree (const _Compare &__comp, const allocator_type &__a)
_Rb_tree (const _Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__x)
~_Rb_tree ()
_Rb_tree< _Key, _Value, _KeyOfValue,
_Compare, _Alloc > & operator= (const _Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__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 (_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc > &__t)
pair < iterator , bool > insert_unique (const value_type &__x)
iterator insert_equal (const value_type &__x)
iterator insert_unique (iterator __position, const value_type &__x)
iterator insert_equal (iterator __position, const value_type &__x)
template<class _InputIterator> void insert_unique (_InputIterator __first, _InputIterator __last)
template<class _InputIterator> void insert_equal (_InputIterator __first, _InputIterator __last)
void erase (iterator __position)
size_type erase (const key_type &__x)
void erase (iterator __first, iterator __last)
void erase (const key_type *__first, const key_type *__last)
void clear ()
iterator find (const key_type &__x)
const_iterator find (const key_type &__x) const
size_type count (const key_type &__x) const
iterator lower_bound (const key_type &__x)
const_iterator lower_bound (const key_type &__x) const
iterator upper_bound (const key_type &__x)
const_iterator upper_bound (const key_type &__x) const
pair < iterator , iterator > equal_range (const key_type &__x)
pair < const_iterator , const_iterator > equal_range (const key_type &__x) const
bool __rb_verify () const
Protected Types
typedef _Rb_tree_node_base * _Base_ptr
typedef _Rb_tree_node< _Value > _Rb_tree_node
typedef _Rb_tree_Color_type _Color_type
Protected Methods
_Link_type _M_create_node (const value_type &__x)
_Link_type _M_clone_node (_Link_type __x)
void destroy_node (_Link_type __p)
_Link_type & _M_root () const
_Link_type & _M_leftmost () const
_Link_type & _M_rightmost () const
Static Protected Methods
_Link_type & _S_left (_Link_type __x)
_Link_type & _S_right (_Link_type __x)
_Link_type & _S_parent (_Link_type __x)
reference _S_value (_Link_type __x)
const _Key & _S_key (_Link_type __x)
_Color_type & _S_color (_Link_type __x)
_Link_type & _S_left (_Base_ptr __x)
_Link_type & _S_right (_Base_ptr __x)
_Link_type & _S_parent (_Base_ptr __x)
reference _S_value (_Base_ptr __x)
const _Key & _S_key (_Base_ptr __x)
_Color_type & _S_color (_Base_ptr __x)
_Link_type _S_minimum (_Link_type __x)
_Link_type _S_maximum (_Link_type __x)
Protected Attributes
size_type _M_node_count
_Compare _M_key_compare
Private Types
typedef _Rb_tree_base < _Value,
_Alloc > _Base
Private Methods
iterator _M_insert (_Base_ptr __x, _Base_ptr __y, const value_type &__v)
_Link_type _M_copy (_Link_type __x, _Link_type __p)
void _M_erase (_Link_type __x)
void _M_empty_initialize ()
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
class std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >
Member Typedef Documentation
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef _Rb_tree_base <_Value, _Alloc> std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_Base [private]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef _Rb_tree_node_base * std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_Base_ptr [protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef _Rb_tree_Color_type std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_Color_type [protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef _Rb_tree_node * std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_Link_type
Definition at line 541 of file stl_tree.h .
Referenced by std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::__rb_verify (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::_S_color (), and std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::_S_key ().
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef _Rb_tree_node<_Value> std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_Rb_tree_node [protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef _Base::allocator_type std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::allocator_type
Reimplemented from std::_Rb_tree_base< _Value, _Alloc > .
Reimplemented in std::rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc > .
Definition at line 545 of file stl_tree.h .
Referenced by std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::_Rb_tree (), and std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::get_allocator ().
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef _Rb_tree_iterator <value_type , const_reference , const_pointer > std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::const_iterator
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef const value_type * std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::const_pointer
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef const value_type & std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::const_reference
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef reverse_iterator <const_iterator > std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::const_reverse_iterator
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef ptrdiff_t std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::difference_type
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef _Rb_tree_iterator <value_type , reference , pointer > std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::iterator
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef _Key std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::key_type
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef value_type * std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::pointer
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef value_type & std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::reference
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef reverse_iterator<iterator > std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::reverse_iterator
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef size_t std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::size_type
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
typedef _Value std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::value_type
Constructor & Destructor Documentation
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_Rb_tree
(
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_Rb_tree
(
const _Compare &
__comp
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_Rb_tree
(
const _Compare &
__comp ,
const allocator_type &
__a
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_Rb_tree
(
const _Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__x
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::~_Rb_tree
(
)
[inline]
Member Function Documentation
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc>
bool std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::__rb_verify
(
)
const
Definition at line 1249 of file stl_tree.h .
References std::__black_count (), std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_Link_type , std::_Rb_tree_alloc_base< _Value, _Alloc, _Alloc_traits< _Value, _Alloc >::_S_instanceless >::_M_header , std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_key_compare , std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_leftmost (), std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_node_count , std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_rightmost (), std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_root (), std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_key (), std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_left (), std::_S_rb_tree_red , std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_right (), std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::begin (), std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::const_iterator , and std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::end ().
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Link_type std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_clone_node
(
_Link_type
__x
)
[inline, protected]
template<class _Key, class _Val, class _KoV, class _Compare, class _Alloc>
_Rb_tree< _Key, _Val, _KoV, _Compare, _Alloc >::_Link_type std::_Rb_tree< _Key, _Val, _KoV, _Compare, _Alloc >::_M_copy
(
_Link_type
__x ,
_Link_type
__p
)
[private]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Link_type std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_create_node
(
const value_type &
__x
)
[inline, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
void std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_empty_initialize
(
)
[inline, private]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc>
void std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_erase
(
_Link_type
__x
)
[private]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_insert
(
_Base_ptr
__x ,
_Base_ptr
__y ,
const value_type &
__v
)
[private]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Link_type & std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_leftmost
(
)
const [inline, protected]
Definition at line 586 of file stl_tree.h .
Referenced by std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::__rb_verify (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::_M_empty_initialize (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::_Rb_tree (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::begin (), and std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::clear ().
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Link_type & std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_rightmost
(
)
const [inline, protected]
Definition at line 588 of file stl_tree.h .
Referenced by std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::__rb_verify (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::_M_empty_initialize (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::_Rb_tree (), and std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::clear ().
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Link_type & std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_root
(
)
const [inline, protected]
Definition at line 584 of file stl_tree.h .
Referenced by std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::__rb_verify (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::_M_empty_initialize (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::_Rb_tree (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::clear (), and std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::operator= ().
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Color_type & std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_color
(
_Base_ptr
__x
)
[inline, static, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Color_type & std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_color
(
_Link_type
__x
)
[inline, static, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
const _Key& std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_key
(
_Base_ptr
__x
)
[inline, static, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
const _Key& std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_key
(
_Link_type
__x
)
[inline, static, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Link_type & std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_left
(
_Base_ptr
__x
)
[inline, static, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Link_type & std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_left
(
_Link_type
__x
)
[inline, static, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Link_type std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_maximum
(
_Link_type
__x
)
[inline, static, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Link_type std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_minimum
(
_Link_type
__x
)
[inline, static, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Link_type & std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_parent
(
_Base_ptr
__x
)
[inline, static, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Link_type & std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_parent
(
_Link_type
__x
)
[inline, static, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Link_type & std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_right
(
_Base_ptr
__x
)
[inline, static, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Link_type & std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_right
(
_Link_type
__x
)
[inline, static, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
reference std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_value
(
_Base_ptr
__x
)
[inline, static, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
reference std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_S_value
(
_Link_type
__x
)
[inline, static, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
const_iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::begin
(
)
const [inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::begin
(
)
[inline]
Definition at line 680 of file stl_tree.h .
Referenced by std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::__rb_verify (), std::operator== (), and std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::rend ().
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
void std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::clear
(
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
size_type std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::count
(
const key_type &
__x
)
const
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
void std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::destroy_node
(
_Link_type
__p
)
[inline, protected]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
bool std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::empty
(
)
const [inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
const_iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::end
(
)
const [inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::end
(
)
[inline]
Definition at line 682 of file stl_tree.h .
Referenced by std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::__rb_verify (), std::operator== (), and std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::rbegin ().
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
pair <const_iterator , const_iterator > std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::equal_range
(
const key_type &
__x
)
const
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
pair <iterator ,iterator > std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::equal_range
(
const key_type &
__x
)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
void std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::erase
(
const key_type *
__first ,
const key_type *
__last
)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc>
void std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::erase
(
iterator
__first ,
iterator
__last
)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
size_type std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::erase
(
const key_type &
__x
)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc>
void std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::erase
(
iterator
__position
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
const_iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::find
(
const key_type &
__x
)
const
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::find
(
const key_type &
__x
)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
allocator_type std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::get_allocator
(
)
const [inline]
template<class _Key, class _Val, class _KoV, class _Cmp, class _Alloc>
template<class _II>
void std::_Rb_tree< _Key, _Val, _KoV, _Cmp, _Alloc >::insert_equal
(
_InputIterator
__first ,
_InputIterator
__last
)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::insert_equal
(
iterator
__position ,
const value_type &
__x
)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::insert_equal
(
const value_type &
__x
)
template<class _Key, class _Val, class _KoV, class _Cmp, class _Alloc>
template<class _II>
void std::_Rb_tree< _Key, _Val, _KoV, _Cmp, _Alloc >::insert_unique
(
_InputIterator
__first ,
_InputIterator
__last
)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::insert_unique
(
iterator
__position ,
const value_type &
__x
)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
pair <iterator ,bool> std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::insert_unique
(
const value_type &
__x
)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Compare std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::key_comp
(
)
const [inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
const_iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::lower_bound
(
const key_type &
__x
)
const
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::lower_bound
(
const key_type &
__x
)
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
size_type std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::max_size
(
)
const [inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc>
_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc > & std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::operator=
(
const _Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__x
)
Definition at line 813 of file stl_tree.h .
References std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_key_compare , std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_node_count , and std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_root ().
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
const_reverse_iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::rbegin
(
)
const [inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
reverse_iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::rbegin
(
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
const_reverse_iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::rend
(
)
const [inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
reverse_iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::rend
(
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
size_type std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::size
(
)
const [inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
void std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::swap
(
_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc > &
__t
)
[inline]
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
const_iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::upper_bound
(
const key_type &
__x
)
const
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
iterator std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::upper_bound
(
const key_type &
__x
)
Member Data Documentation
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
_Compare std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_key_compare [protected]
Definition at line 582 of file stl_tree.h .
Referenced by std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::__rb_verify (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::_Rb_tree (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::key_comp (), std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::operator= (), and std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::swap ().
template<class _Key, class _Value, class _KeyOfValue, class _Compare, class _Alloc = allocator<_Value>>
size_type std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::_M_node_count [protected]
Definition at line 581 of file stl_tree.h .
Referenced by std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::__rb_verify (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::_Rb_tree (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::clear (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::empty (), std::_Rb_tree< _Key, _Value, _KeyOfValue, _Compare, _Alloc >::operator= (), std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::size (), and std::_Rb_tree< key_type, value_type, _Identity< value_type >, key_compare, _Alloc >::swap ().
The documentation for this class was generated from the following file:
Generated on Mon Apr 8 03:17:24 2002 for libstdc++-v3 Source by
1.2.15