headers/cpp/stl_tree.h

156     iterator;
165   _Rb_tree_iterator(const iterator& __it) { _M_node = __it._M_node; }
621   typedef _Rb_tree_iterator<value_type, reference, pointer> iterator;
627   typedef reverse_iterator<iterator> reverse_iterator;
629   typedef reverse_bidirectional_iterator<iterator, value_type, reference,
638   iterator _M_insert(_Base_ptr __x, _Base_ptr __y, const value_type& __v);
677                                           // __root, in iterator.operator++
686   iterator begin() { return _M_leftmost(); }
688   iterator end() { return _M_header; }
710   pair<iterator,bool> insert_unique(const value_type& __x);
711   iterator insert_equal(const value_type& __x);
713   iterator insert_unique(iterator __position, const value_type& __x);
714   iterator insert_equal(iterator __position, const value_type& __x);
728   void erase(iterator __position);
730   void erase(iterator __first, iterator __last);
744   iterator find(const key_type& __x);
747   iterator lower_bound(const key_type& __x);
749   iterator upper_bound(const key_type& __x);
751   pair<iterator,iterator> equal_range(const key_type& __x);
821 typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator
852   return iterator(__z);
857 typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator
874 pair<typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator,
887   iterator __j = iterator(__y);
890       return pair<iterator,bool>(_M_insert(__x, __y, __v), true);
894     return pair<iterator,bool>(_M_insert(__x, __y, __v), true);
895   return pair<iterator,bool>(__j, false);
901 typename _Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::iterator
903   ::insert_unique(iterator __position, const _Val& __v)
918     iterator __before = __position;
934 typename _Rb_tree<_Key,_Val,_KeyOfValue,_Compare,_Alloc>::iterator
936   ::insert_equal(iterator __position, const _Val& __v)
951     iterator __before = __position;
1026   ::erase(iterator __position)
1042   pair<iterator,iterator> __p = equal_range(__x);
1096   ::erase(iterator __first, iterator __last)
1114 typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator
1126   iterator __j = iterator(__y);
1164 typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator
1177   return iterator(__y);
1200 typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator
1213    return iterator(__y);
1237 pair<typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator,
1238      typename _Rb_tree<_Key,_Value,_KeyOfValue,_Compare,_Alloc>::iterator>
1242   return pair<iterator, iterator>(lower_bound(__k), upper_bound(__k));