find() [2/2]

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

_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::const_iterator std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::find

(

const key_type &

__k

)

const

Definition at line 3378 of file stl_tree.h.

    {
      const_iterator __j(_M_lower_bound(_M_begin(), _M_end(), __k));
      return (__j == end()
            || _M_key_compare(__k, _S_key(__j._M_node))) ? end() : __j;
    }

References _Rb_tree(), _M_begin(), _M_end(), _M_key_compare(), _M_lower_bound(), std::__rb_tree::_Iterator< _Const, _ValPtr >::_M_node, _S_key(), and end().

Here is the call graph for this function: