headers/cpp/stl_tree.h

158     const_iterator;
623           const_iterator;
626   typedef reverse_iterator<const_iterator> const_reverse_iterator;
632   typedef reverse_bidirectional_iterator<const_iterator, value_type,
687   const_iterator begin() const { return _M_leftmost(); }
689   const_iterator end() const { return _M_header; }
722   void insert_unique(const_iterator __first, const_iterator __last);
724   void insert_equal(const_iterator __first, const_iterator __last);
745   const_iterator find(const key_type& __x) const;
748   const_iterator lower_bound(const key_type& __x) const;
750   const_iterator upper_bound(const key_type& __x) const;
752   pair<const_iterator, const_iterator> equal_range(const key_type& __x) const;
998   ::insert_equal(const_iterator __first, const_iterator __last)
1015   ::insert_unique(const_iterator __first, const_iterator __last)
1133 typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::const_iterator
1145   const_iterator __j = const_iterator(__y);
1156   pair<const_iterator, const_iterator> __p = equal_range(__k);
1182 typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::const_iterator
1195   return const_iterator(__y);
1218 typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::const_iterator
1231    return const_iterator(__y);
1247 pair<typename _Rb_tree<_Key, _Value, _KoV, _Compare, _Alloc>::const_iterator,
1248      typename _Rb_tree<_Key, _Value, _KoV, _Compare, _Alloc>::const_iterator>
1252   return pair<const_iterator,const_iterator>(lower_bound(__k),
1279   for (const_iterator __it = begin(); __it != end(); ++__it) {