|
| _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 () |
|
allocator_type | get_allocator () const |
|
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.
template<class _Key, class _Compare, class _Value, class _KeyOfValue, class _Traits, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
Definition at line 337 of file _tree.h.
Referenced by _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_Rb_tree(), _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::begin(), and _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::clear().
template<class _Key, class _Compare, class _Value, class _KeyOfValue, class _Traits, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
Definition at line 335 of file _tree.h.
Referenced by _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_find(), _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_lower_bound(), _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_upper_bound(), _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_Rb_tree(), _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::clear(), and _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::operator=().
template<class _Key, class _Compare, class _Value, class _KeyOfValue, class _Traits, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
Definition at line 359 of file _tree.h.
_Rb_tree_Color_type _Color_type
Referenced by _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_clone_node(), and _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_Rb_tree().
template<class _Key, class _Compare, class _Value, class _KeyOfValue, class _Traits, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
Definition at line 357 of file _tree.h.
358 {
return _KeyOfValue()(
_S_value(__x));}
static value_type &_STLP_CALL _S_value(_Base_ptr __x)
Referenced by _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_find(), _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_lower_bound(), _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_upper_bound(), and _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::equal_range_unique().
template<class _Key, class _Compare, class _Value, class _KeyOfValue, class _Traits, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
Definition at line 349 of file _tree.h.
350 {
return __x->_M_left; }
Referenced by _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_create_node(), _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_find(), _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_lower_bound(), and _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_upper_bound().
template<class _Key, class _Compare, class _Value, class _KeyOfValue, class _Traits, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
Definition at line 351 of file _tree.h.
352 {
return __x->_M_right; }
Referenced by _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_create_node(), _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_find(), _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_lower_bound(), and _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_upper_bound().
template<class _Key, class _Compare, class _Value, class _KeyOfValue, class _Traits, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
Definition at line 355 of file _tree.h.
#define __STATIC_CAST(__x, __y)
Referenced by _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_M_clone_node(), _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::_S_key(), and _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::erase().
template<class _Key, class _Compare, class _Value, class _KeyOfValue, class _Traits, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
Definition at line 609 of file _tree.h.
_STLP_TEMPLATE_FOR_CONT_EXT iterator upper_bound(const _KT &__x)
_STLP_TEMPLATE_FOR_CONT_EXT iterator lower_bound(const _KT &__x)
Referenced by _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::count(), and _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::erase().
template<class _Key, class _Compare, class _Value, class _KeyOfValue, class _Traits, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
Definition at line 492 of file _tree.h.
494 this->_M_header._M_data._M_parent,
495 this->_M_header._M_data._M_left,
496 this->_M_header._M_data._M_right);
_Rb_tree_node_base * _Base_ptr
#define __STATIC_CAST(__x, __y)
static _Base_ptr _STLP_CALL _Rebalance_for_erase(_Base_ptr __z, _Base_ptr &__root, _Base_ptr &__leftmost, _Base_ptr &__rightmost)
void _Destroy(_Tp *__pointer)
static value_type &_STLP_CALL _S_value(_Base_ptr __x)
Referenced by _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::erase(), and _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::erase_unique().
template<class _Key, class _Compare, class _Value, class _KeyOfValue, class _Traits, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) >
Definition at line 601 of file _tree.h.
_STLP_TEMPLATE_FOR_CONT_EXT _Base_ptr _M_lower_bound(const _KT &__k) const
_Rb_tree_iterator< value_type, _NonConstTraits > iterator
Referenced by _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::equal_range(), and _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, void), _MapTraits, _Alloc >::equal_range_unique().