libstdc++
GNU C++ library
Loading...
Searching...
No Matches

◆ 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.

3380 {
3382 return (__j == end()
3383 || _M_key_compare(__k, _S_key(__j._M_node))) ? end() : __j;
3384 }
_Base_ptr _M_end() const noexcept
Definition stl_tree.h:1390
static const _Key & _S_key(const _Node &__node)
Definition stl_tree.h:1410
iterator end() noexcept
Definition stl_tree.h:1648
bool _M_key_compare(const _Key1 &__k1, const _Key2 &__k2) const
Definition stl_tree.h:1397
_Base_ptr _M_lower_bound(_Base_ptr __x, _Base_ptr __y, const _Key &__k) const
Definition stl_tree.h:2641
_Node_traits::_Const_iterator const_iterator
Definition stl_tree.h:1447
_Base_ptr _M_begin() const noexcept
Definition stl_tree.h:1377

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: