headers/cpp/stl_tree.h

1115 _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::find(const _Key& __k)
1117   _Link_type __y = _M_header;      // Last node which is not less than __k.
1121     if (!_M_key_compare(_S_key(__x), __k))
1127   return (__j == end() || _M_key_compare(__k, _S_key(__j._M_node))) ?
1134 _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::find(const _Key& __k) const
1136   _Link_type __y = _M_header; /* Last node which is not less than __k. */
1140     if (!_M_key_compare(_S_key(__x), __k))
1146   return (__j == end() || _M_key_compare(__k, _S_key(__j._M_node))) ?
1154   ::count(const _Key& __k) const
1156   pair<const_iterator, const_iterator> __p = equal_range(__k);
1166   ::lower_bound(const _Key& __k)
1168   _Link_type __y = _M_header; /* Last node which is not less than __k. */
1172     if (!_M_key_compare(_S_key(__x), __k))
1184   ::lower_bound(const _Key& __k) const
1186   _Link_type __y = _M_header; /* Last node which is not less than __k. */
1190     if (!_M_key_compare(_S_key(__x), __k))
1202   ::upper_bound(const _Key& __k)
1204   _Link_type __y = _M_header; /* Last node which is greater than __k. */
1208      if (_M_key_compare(__k, _S_key(__x)))
1220   ::upper_bound(const _Key& __k) const
1222   _Link_type __y = _M_header; /* Last node which is greater than __k. */
1226      if (_M_key_compare(__k, _S_key(__x)))
1240   ::equal_range(const _Key& __k)
1242   return pair<iterator, iterator>(lower_bound(__k), upper_bound(__k));
1250   ::equal_range(const _Key& __k) const
1252   return pair<const_iterator,const_iterator>(lower_bound(__k),
1253                                              upper_bound(__k));