• Home
  • Raw
  • Download

Lines Matching refs:__l

192      _RAIter __l,
200 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
207 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
214 _RAIter __l,
222 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
229 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
236 _RAIter __l,
244 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
251 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
258 _RAIter __l,
266 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
273 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
452 _RAIter __l,
461 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
469 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
477 _RAIter __l,
486 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
494 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
502 _RAIter __l,
511 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
519 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
527 _RAIter __l,
536 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
544 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
560 _RAIter __l,
567 while (__f != __l)
572 difference_type __n = __l - __f;
573 _RAIter __m = __l;
590 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
596 difference_type __n = __l - __f;
618 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
624 difference_type __n = __l - __f;
648 _RAIter __l,
654 while (__f != __l)
660 difference_type __n = __l - __f;
665 __m = __l - __n;
667 _VSTD::copy_backward(__m, __l, __re);
668 __l = __m;
678 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
683 difference_type __n = __l - __f;
686 --__l;
687 pointer __lb = *__l.__m_iter_;
688 pointer __le = __l.__ptr_ + 1;
697 __l -= __bs - 1;
706 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
711 difference_type __n = __l - __f;
714 --__l;
715 pointer __lb = *__l.__m_iter_;
716 pointer __le = __l.__ptr_ + 1;
725 __l -= __bs - 1;
736 _RAIter __l,
743 while (__f != __l)
748 difference_type __n = __l - __f;
749 _RAIter __m = __l;
766 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
772 difference_type __n = __l - __f;
794 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
800 difference_type __n = __l - __f;
824 _RAIter __l,
830 while (__f != __l)
836 difference_type __n = __l - __f;
841 __m = __l - __n;
843 _VSTD::move_backward(__m, __l, __re);
844 __l = __m;
854 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
859 difference_type __n = __l - __f;
862 --__l;
863 pointer __lb = *__l.__m_iter_;
864 pointer __le = __l.__ptr_ + 1;
873 __l -= __bs - 1;
882 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
887 difference_type __n = __l - __f;
890 --__l;
891 pointer __lb = *__l.__m_iter_;
892 pointer __le = __l.__ptr_ + 1;
901 __l -= __bs - 1;
1239 deque(_InputIter __f, _InputIter __l,
1242 deque(_InputIter __f, _InputIter __l, const allocator_type& __a,
1270 void assign(_InputIter __f, _InputIter __l,
1274 void assign(_RAIter __f, _RAIter __l,
1374 iterator insert(const_iterator __p, _InputIter __f, _InputIter __l,
1378 iterator insert(const_iterator __p, _ForwardIterator __f, _ForwardIterator __l,
1382 iterator insert(const_iterator __p, _BiIter __f, _BiIter __l,
1388 iterator erase(const_iterator __f, const_iterator __l);
1428 void __append(_InpIter __f, _InpIter __l,
1432 void __append(_ForIter __f, _ForIter __l,
1441 iterator __move_and_check(iterator __f, iterator __l, iterator __r,
1443 iterator __move_backward_and_check(iterator __f, iterator __l, iterator __r,
1445 void __move_construct_and_check(iterator __f, iterator __l,
1447 void __move_construct_backward_and_check(iterator __f, iterator __l,
1527 deque<_Tp, _Allocator>::deque(_InputIter __f, _InputIter __l,
1530 __append(__f, __l);
1535 deque<_Tp, _Allocator>::deque(_InputIter __f, _InputIter __l, const allocator_type& __a,
1539 __append(__f, __l);
1643 deque<_Tp, _Allocator>::assign(_InputIter __f, _InputIter __l,
1649 for (; __f != __l && __i != __e; ++__f, (void) ++__i)
1651 if (__f != __l)
1652 __append(__f, __l);
1660 deque<_Tp, _Allocator>::assign(_RAIter __f, _RAIter __l,
1663 if (static_cast<size_type>(__l - __f) > __base::size())
1667 __append(__m, __l);
1670 __erase_to_end(_VSTD::copy(__f, __l, __base::begin()));
2154 deque<_Tp, _Allocator>::insert(const_iterator __p, _InputIter __f, _InputIter __l,
2159 __buf.__construct_at_end(__f, __l);
2167 deque<_Tp, _Allocator>::insert(const_iterator __p, _ForwardIterator __f, _ForwardIterator __l,
2171 size_type __n = _VSTD::distance(__f, __l);
2173 __buf.__construct_at_end(__f, __l);
2181 deque<_Tp, _Allocator>::insert(const_iterator __p, _BiIter __f, _BiIter __l,
2184 size_type __n = _VSTD::distance(__f, __l);
2198 __m = __pos < __n / 2 ? _VSTD::prev(__l, __pos) : _VSTD::next(__f, __n - __pos);
2214 _VSTD::copy(__m, __l, __old_begin);
2225 _BiIter __m = __l;
2229 __m = __de < __n / 2 ? _VSTD::next(__f, __de) : _VSTD::prev(__l, __n - __de);
2230 for (_BiIter __j = __m; __j != __l; ++__i, (void) ++__j, ++__base::size())
2250 deque<_Tp, _Allocator>::__append(_InpIter __f, _InpIter __l,
2254 for (; __f != __l; ++__f)
2265 deque<_Tp, _Allocator>::__append(_ForIter __f, _ForIter __l,
2268 size_type __n = _VSTD::distance(__f, __l);
2274 for (iterator __i = __base::end(); __f != __l; ++__i, (void) ++__f, ++__base::size())
2626 // move assign [__f, __l) to [__r, __r + (__l-__f)).
2627 // If __vt points into [__f, __l), then subtract (__f - __r) from __vt.
2630 deque<_Tp, _Allocator>::__move_and_check(iterator __f, iterator __l, iterator __r,
2634 // for (; __f != __l; ++__f, ++__r)
2636 difference_type __n = __l - __f;
2656 // move assign [__f, __l) to [__r - (__l-__f), __r) backwards.
2657 // If __vt points into [__f, __l), then add (__r - __l) to __vt.
2660 deque<_Tp, _Allocator>::__move_backward_and_check(iterator __f, iterator __l, iterator __r,
2664 // while (__f != __l)
2665 // *--__r = _VSTD::move(*--__l);
2666 difference_type __n = __l - __f;
2669 --__l;
2670 pointer __lb = *__l.__m_iter_;
2671 pointer __le = __l.__ptr_ + 1;
2679 …__vt = (const_iterator(static_cast<__map_const_pointer>(__l.__m_iter_), __vt) += __r - __l - 1).__…
2682 __l -= __bs - 1;
2687 // move construct [__f, __l) to [__r, __r + (__l-__f)).
2688 // If __vt points into [__f, __l), then add (__r - __f) to __vt.
2691 deque<_Tp, _Allocator>::__move_construct_and_check(iterator __f, iterator __l,
2696 // for (; __f != __l; ++__r, ++__f, ++__base::size())
2698 difference_type __n = __l - __f;
2718 // move construct [__f, __l) to [__r - (__l-__f), __r) backwards.
2719 // If __vt points into [__f, __l), then subtract (__l - __r) from __vt.
2722 deque<_Tp, _Allocator>::__move_construct_backward_and_check(iterator __f, iterator __l,
2727 // for (iterator __j = __l; __j != __f;)
2733 difference_type __n = __l - __f;
2736 --__l;
2737 pointer __lb = *__l.__m_iter_;
2738 pointer __le = __l.__ptr_ + 1;
2746 …__vt = (const_iterator(static_cast<__map_const_pointer>(__l.__m_iter_), __vt) -= __l - __r + 1).__…
2754 __l -= __bs - 1;
2795 deque<_Tp, _Allocator>::erase(const_iterator __f, const_iterator __l)
2797 difference_type __n = __l - __f;