lower_bound() [2/2]

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

const_iterator std::_Rb_tree< _Key, _Val, _KeyOfValue, _Compare, _Alloc >::lower_bound ( const key_type & __k ) const

inline

Definition at line 1923 of file stl_tree.h.

      {
      return const_iterator
        (_M_lower_bound(_M_begin(), _M_end(), __k));