equal_range() [1/2]

template<typename _Key, typename _Val, typename _KeyOfValue, typename _Compare, typename _Alloc>

pair< typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::iterator, typename _Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::iterator > std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::equal_range

(

const key_type &

__k

)

Definition at line 2704 of file stl_tree.h.

    {
      typedef pair<iterator, iterator> _Ret;
 
      _Base_ptr __x = _M_begin();
      _Base_ptr __y = _M_end();
      while (__x)
      {
        if (_M_key_compare(_S_key(__x), __k))
          __x = _S_right(__x);
        else if (_M_key_compare(__k, _S_key(__x)))
          __y = __x, __x = _S_left(__x);
        else
          {
            _Base_ptr __xu(__x);
            _Base_ptr __yu(__y);
            __y = __x, __x = _S_left(__x);
            __xu = _S_right(__xu);
            return _Ret(iterator(_M_lower_bound(__x, __y, __k)),
                    iterator(_M_upper_bound(__xu, __yu, __k)));
          }
      }
      return _Ret(iterator(__y), iterator(__y));
    }

References _Rb_tree(), _M_begin(), _M_end(), _M_key_compare(), _M_lower_bound(), _M_upper_bound(), _S_key(), _S_left(), and _S_right().

Referenced by count(), and erase().

Here is the call graph for this function:

Here is the caller graph for this function: