headers/cpp/stl_deque.h

770   void insert(iterator __pos, size_type __n, const value_type& __x);
776   void insert(iterator __pos, _InputIterator __first, _InputIterator __last) {
778     _M_insert_dispatch(__pos, __first, __last, _Integral());
782   void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
784     insert(__pos, (size_type) __n, (value_type) __x);
788   void _M_insert_dispatch(iterator __pos,
791     insert(__pos, __first, __last, __ITERATOR_CATEGORY(__first));
796   void insert(iterator __pos,
798   void insert(iterator __pos,
814   iterator erase(iterator __pos) {
815     iterator __next = __pos;
817     difference_type __index = __pos - _M_start;
819       copy_backward(_M_start, __pos, __next);
823       copy(__next, _M_finish, __pos);
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,
966 deque<_Tp, _Alloc, __bufsize>::insert(iterator __pos,
969   if (__pos._M_cur == _M_start._M_cur) {
974   else if (__pos._M_cur == _M_finish._M_cur) {
980     _M_insert_aux(__pos, __n, __x);
986 void deque<_Tp, _Alloc, __bufsize>::insert(iterator __pos,
990   if (__pos._M_cur == _M_start._M_cur) {
998   else if (__pos._M_cur == _M_finish._M_cur) {
1008     _M_insert_aux(__pos, __first, __last, __n);
1012 void deque<_Tp,_Alloc,__bufsize>::insert(iterator __pos,
1017   if (__pos._M_cur == _M_start._M_cur) {
1025   else if (__pos._M_cur == _M_finish._M_cur) {
1035     _M_insert_aux(__pos, __first, __last, __n);
1238 deque<_Tp,_Alloc,__bufsize>::insert(iterator __pos,
1243   copy(__first, __last, inserter(*this, __pos));
1249 deque<_Tp,_Alloc,__bufsize>::insert(iterator __pos,
1255   if (__pos._M_cur == _M_start._M_cur) {
1263   else if (__pos._M_cur == _M_finish._M_cur) {
1273     _M_insert_aux(__pos, __first, __last, __n);
1280 deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos,
1283   difference_type __index = __pos - _M_start;
1291     __pos = _M_start + __index;
1292     iterator __pos1 = __pos;
1302     __pos = _M_start + __index;
1303     copy_backward(__pos, __back2, __back1);
1305   *__pos = __x_copy;
1306   return __pos;
1311 deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos)
1313   difference_type __index = __pos - _M_start;
1320     __pos = _M_start + __index;
1321     iterator __pos1 = __pos;
1331     __pos = _M_start + __index;
1332     copy_backward(__pos, __back2, __back1);
1334   *__pos = value_type();
1335   return __pos;
1340 deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos,
1344   const difference_type __elems_before = __pos - _M_start;
1350     __pos = _M_start + __elems_before;
1356         copy(__start_n, __pos, __old_start);
1357         fill(__pos - difference_type(__n), __pos, __x_copy);
1360         __uninitialized_copy_fill(_M_start, __pos, __new_start,
1363         fill(__old_start, __pos, __x_copy);
1373     __pos = _M_finish - __elems_after;
1379         copy_backward(__pos, __finish_n, __old_finish);
1380         fill(__pos, __pos + difference_type(__n), __x_copy);
1383         __uninitialized_fill_copy(_M_finish, __pos + difference_type(__n),
1384                                   __x_copy, __pos, _M_finish);
1386         fill(__pos, __old_finish, __x_copy);
1399 deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos,
1404   const difference_type __elemsbefore = __pos - _M_start;
1409     __pos = _M_start + __elemsbefore;
1415         copy(__start_n, __pos, __old_start);
1416         copy(__first, __last, __pos - difference_type(__n));
1421         __uninitialized_copy_copy(_M_start, __pos, __first, __mid,
1434     __pos = _M_finish - __elemsafter;
1440         copy_backward(__pos, __finish_n, __old_finish);
1441         copy(__first, __last, __pos);
1446         __uninitialized_copy_copy(__mid, __last, __pos, _M_finish, _M_finish);
1448         copy(__first, __mid, __pos);
1460 deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos,
1465   const difference_type __elemsbefore = __pos - _M_start;
1470     __pos = _M_start + __elemsbefore;
1476         copy(__start_n, __pos, __old_start);
1477         copy(__first, __last, __pos - difference_type(__n));
1482         __uninitialized_copy_copy(_M_start, __pos, __first, __mid,
1495     __pos = _M_finish - __elemsafter;
1501         copy_backward(__pos, __finish_n, __old_finish);
1502         copy(__first, __last, __pos);
1506         __uninitialized_copy_copy(__mid, __last, __pos, _M_finish, _M_finish);
1508         copy(__first, __mid, __pos);
1518 deque<_Tp,_Alloc,__bufsize>::_M_insert_aux(iterator __pos,
1523   const difference_type __elemsbefore = __pos - _M_start;
1528     __pos = _M_start + __elemsbefore;
1534         copy(__start_n, __pos, __old_start);
1535         copy(__first, __last, __pos - difference_type(__n));
1539         __uninitialized_copy_copy(_M_start, __pos, __first, __mid,
1551     __pos = _M_finish - __elemsafter;
1557         copy_backward(__pos, __finish_n, __old_finish);
1558         copy(__first, __last, __pos);
1562         __uninitialized_copy_copy(__mid, __last, __pos, _M_finish, _M_finish);
1564         copy(__first, __mid, __pos);