headers/cpp/stl_deque.h

35  *  For any nonsingular iterator i:
42  *      pointer, even if i is a past-the-end iterator.
100   typedef _Deque_iterator<_Tp,_Tp&,_Tp*,__bufsiz>             iterator;
107   typedef _Deque_iterator<_Tp, _Tp&, _Tp*>             iterator;
132   _Deque_iterator(const iterator& __x)
344   typedef _Deque_iterator<_Tp,_Tp&,_Tp*,__bufsiz>              iterator;
361   iterator _M_start;
362   iterator _M_finish;
371   typedef _Deque_iterator<_Tp,_Tp&,_Tp*,__bufsiz>              iterator;
374   typedef _Deque_iterator<_Tp,_Tp&,_Tp*>                      iterator;
398   iterator _M_start;
399   iterator _M_finish;
495   typedef typename _Base::iterator       iterator;
500   typedef reverse_iterator<iterator> reverse_iterator;
505   typedef reverse_iterator<iterator, value_type, reference, difference_type>
531   iterator begin() { return _M_start; }
532   iterator end() { return _M_finish; }
550     iterator __tmp = _M_finish;
578   // Check whether it's an integral type.  If so, it's not an iterator.
751   iterator insert(iterator position, const value_type& __x) {
758       iterator __tmp = _M_finish;
767   iterator insert(iterator __position)
770   void insert(iterator __pos, size_type __n, const value_type& __x);
774   // Check whether it's an integral type.  If so, it's not an iterator.
776   void insert(iterator __pos, _InputIterator __first, _InputIterator __last) {
782   void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
788   void _M_insert_dispatch(iterator __pos,
796   void insert(iterator __pos,
798   void insert(iterator __pos,
814   iterator erase(iterator __pos) {
815     iterator __next = __pos;
829   iterator erase(iterator __first, iterator __last);
862   void insert(iterator __pos, _InputIterator __first, _InputIterator __last,
866   void insert(iterator __pos,
872   iterator _M_insert_aux(iterator __pos, const value_type& __x);
873   iterator _M_insert_aux(iterator __pos);
874   void _M_insert_aux(iterator __pos, size_type __n, const value_type& __x);
879   void _M_insert_aux(iterator __pos,
885   void _M_insert_aux(iterator __pos,
889   void _M_insert_aux(iterator __pos,
895   iterator _M_reserve_elements_at_front(size_type __n) {
902   iterator _M_reserve_elements_at_back(size_type __n) {
953   iterator __cur = begin();
966 deque<_Tp, _Alloc, __bufsize>::insert(iterator __pos,
970     iterator __new_start = _M_reserve_elements_at_front(__n);
975     iterator __new_finish = _M_reserve_elements_at_back(__n);
986 void deque<_Tp, _Alloc, __bufsize>::insert(iterator __pos,
991     iterator __new_start = _M_reserve_elements_at_front(__n);
999     iterator __new_finish = _M_reserve_elements_at_back(__n);
1012 void deque<_Tp,_Alloc,__bufsize>::insert(iterator __pos,
1018     iterator __new_start = _M_reserve_elements_at_front(__n);
1026     iterator __new_finish = _M_reserve_elements_at_back(__n);
1041 deque<_Tp,_Alloc,__bufsize>::iterator
1042 deque<_Tp,_Alloc,__bufsize>::erase(iterator __first, iterator __last)
1053       iterator __new_start = _M_start + __n;
1060       iterator __new_finish = _M_finish - __n;
1101   __STL_UNWIND(destroy(_M_start, iterator(*__cur, __cur)));
1141   __STL_UNWIND(destroy(_M_start, iterator(*__cur_node, __cur_node)));
1238 deque<_Tp,_Alloc,__bufsize>::insert(iterator __pos,
1249 deque<_Tp,_Alloc,__bufsize>::insert(iterator __pos,
1256     iterator __new_start = _M_reserve_elements_at_front(__n);
1264     iterator __new_finish = _M_reserve_elements_at_back(__n);
1279 typename deque<_Tp, _Alloc, __bufsize>::iterator
1280 deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos,
1287     iterator __front1 = _M_start;
1289     iterator __front2 = __front1;
1292     iterator __pos1 = __pos;
1298     iterator __back1 = _M_finish;
1300     iterator __back2 = __back1;
1310 typename deque<_Tp,_Alloc,__bufsize>::iterator
1311 deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos)
1316     iterator __front1 = _M_start;
1318     iterator __front2 = __front1;
1321     iterator __pos1 = __pos;
1327     iterator __back1 = _M_finish;
1329     iterator __back2 = __back1;
1340 deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos,
1348     iterator __new_start = _M_reserve_elements_at_front(__n);
1349     iterator __old_start = _M_start;
1353         iterator __start_n = _M_start + difference_type(__n);
1369     iterator __new_finish = _M_reserve_elements_at_back(__n);
1370     iterator __old_finish = _M_finish;
1376         iterator __finish_n = _M_finish - difference_type(__n);
1399 deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos,
1407     iterator __new_start = _M_reserve_elements_at_front(__n);
1408     iterator __old_start = _M_start;
1412         iterator __start_n = _M_start + difference_type(__n);
1430     iterator __new_finish = _M_reserve_elements_at_back(__n);
1431     iterator __old_finish = _M_finish;
1437         iterator __finish_n = _M_finish - difference_type(__n);
1460 deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos,
1468     iterator __new_start = _M_reserve_elements_at_front(__n);
1469     iterator __old_start = _M_start;
1473         iterator __start_n = _M_start + difference_type(__n);
1491     iterator __new_finish = _M_reserve_elements_at_back(__n);
1492     iterator __old_finish = _M_finish;
1498         iterator __finish_n = _M_finish - difference_type(__n);
1518 deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos,
1526     iterator __new_start = _M_reserve_elements_at_front(__n);
1527     iterator __old_start = _M_start;
1531         iterator __start_n = _M_start + __n;
1548     iterator __new_finish = _M_reserve_elements_at_back(__n);
1549     iterator __old_finish = _M_finish;
1554         iterator __finish_n = _M_finish - difference_type(__n);