_Base _Base _Base_const_iterator _Base_iterator _Base_ptr _Color_type _ConstIteTraits _ConstTraits _Invalidate_iterator _Invalidate_iterators _Iterator_category _Link_type _M_clone_node _M_copy _M_create_node _M_erase _M_find _M_insert _M_iter_list _M_key_compare _M_leftmost _M_leftmost _M_lower_bound _M_node_count _M_non_dbg_impl _M_rightmost _M_rightmost _M_root _M_root _M_upper_bound _Node _NonConstIteTraits _NonConstTraits _Rb_tree _Rb_tree _Rb_tree _Rb_tree _Rb_tree _Rb_tree _Rb_tree _Rb_tree _Rb_tree _Rb_tree _S_color _S_key _S_left _S_maximum _S_minimum _S_parent _S_right _S_value _Self _Self _STLP_DECLARE_BIDIRECTIONAL_REVERSE_ITERATORS allocator_type begin begin begin begin clear clear const_iterator const_iterator const_pointer const_reference count count difference_type empty empty end end end end equal_range equal_range equal_range equal_range equal_range_unique equal_range_unique equal_range_unique equal_range_unique erase erase erase erase erase erase erase erase erase_unique erase_unique find find find find get_allocator insert_equal insert_equal insert_equal insert_equal insert_equal insert_equal insert_equal insert_equal insert_unique insert_unique insert_unique insert_unique insert_unique insert_unique insert_unique insert_unique iterator iterator key_comp key_comp key_type key_type lower_bound lower_bound lower_bound lower_bound max_size max_size operator= operator= pointer rbegin rbegin rbegin rbegin reference rend rend rend rend size size size_type swap swap upper_bound upper_bound upper_bound upper_bound value_type ~_Rb_tree ~_Rb_tree

template<class _Key, class _Compare, class _Value, class _KeyOfValue, class _Traits, _STLP_DFL_TMPL_PARAM(_Alloc, allocator< _Value >) > _STLP_TEMPLATE_FOR_CONT_EXT _Base_ptr _Rb_tree< _Key, _Compare, _Value, _KeyOfValue, _Traits, >::_M_upper_bound ( const _KT &  __k ) const [inline, private] Definition at line 581 of file _tree.h. Referenced by _Rb_tree< key_type, key_compare, value_type, _STLP_SELECT1ST(value_type, IncompleteClass), _MapTraits, _Alloc >::upper_bound(). { _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is greater than __k. */ _Base_ptr __x = _M_root(); /* Current node. */ while (__x != 0) if (_M_key_compare(__k, _S_key(__x))) __y = __x, __x = _S_left(__x); else __x = _S_right(__x); return __y; }