Lines Matching refs:__l

180      _RAIter __l,
188 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
195 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
202 _RAIter __l,
210 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
217 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
224 _RAIter __l,
232 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
239 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
246 _RAIter __l,
254 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
261 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
427 _RAIter __l,
436 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
444 __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,
529 _RAIter __l,
535 while (__f != __l)
540 difference_type __n = __l - __f;
541 _RAIter __m = __l;
558 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
563 difference_type __n = __l - __f;
585 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
590 difference_type __n = __l - __f;
614 _RAIter __l,
620 while (__f != __l)
626 difference_type __n = __l - __f;
631 __m = __l - __n;
633 _VSTD::copy_backward(__m, __l, __re);
634 __l = __m;
644 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
649 difference_type __n = __l - __f;
652 --__l;
653 pointer __lb = *__l.__m_iter_;
654 pointer __le = __l.__ptr_ + 1;
663 __l -= __bs - 1;
672 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
677 difference_type __n = __l - __f;
680 --__l;
681 pointer __lb = *__l.__m_iter_;
682 pointer __le = __l.__ptr_ + 1;
691 __l -= __bs - 1;
702 _RAIter __l,
708 while (__f != __l)
713 difference_type __n = __l - __f;
714 _RAIter __m = __l;
731 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
736 difference_type __n = __l - __f;
758 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
763 difference_type __n = __l - __f;
787 _RAIter __l,
793 while (__f != __l)
799 difference_type __n = __l - __f;
804 __m = __l - __n;
806 _VSTD::move_backward(__m, __l, __re);
807 __l = __m;
817 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
822 difference_type __n = __l - __f;
825 --__l;
826 pointer __lb = *__l.__m_iter_;
827 pointer __le = __l.__ptr_ + 1;
836 __l -= __bs - 1;
845 __deque_iterator<_V1, _P1, _R1, _M1, _D1, _B1> __l,
850 difference_type __n = __l - __f;
853 --__l;
854 pointer __lb = *__l.__m_iter_;
855 pointer __le = __l.__ptr_ + 1;
864 __l -= __bs - 1;
1195 deque(_InputIter __f, _InputIter __l,
1198 deque(_InputIter __f, _InputIter __l, const allocator_type& __a,
1222 void assign(_InputIter __f, _InputIter __l,
1226 void assign(_RAIter __f, _RAIter __l,
1311 iterator insert(const_iterator __p, _InputIter __f, _InputIter __l,
1315 iterator insert(const_iterator __p, _ForwardIterator __f, _ForwardIterator __l,
1319 iterator insert(const_iterator __p, _BiIter __f, _BiIter __l,
1329 iterator erase(const_iterator __f, const_iterator __l);
1367 void __append(_InpIter __f, _InpIter __l,
1371 void __append(_ForIter __f, _ForIter __l,
1380 iterator __move_and_check(iterator __f, iterator __l, iterator __r,
1382 iterator __move_backward_and_check(iterator __f, iterator __l, iterator __r,
1384 void __move_construct_and_check(iterator __f, iterator __l,
1386 void __move_construct_backward_and_check(iterator __f, iterator __l,
1449 deque<_Tp, _Allocator>::deque(_InputIter __f, _InputIter __l,
1452 __append(__f, __l);
1457 deque<_Tp, _Allocator>::deque(_InputIter __f, _InputIter __l, const allocator_type& __a,
1461 __append(__f, __l);
1569 deque<_Tp, _Allocator>::assign(_InputIter __f, _InputIter __l,
1575 for (; __f != __l && __i != __e; ++__f, (void) ++__i)
1577 if (__f != __l)
1578 __append(__f, __l);
1586 deque<_Tp, _Allocator>::assign(_RAIter __f, _RAIter __l,
1589 if (static_cast<size_type>(__l - __f) > __base::size())
1593 __append(__m, __l);
1596 __erase_to_end(_VSTD::copy(__f, __l, __base::begin()));
2081 deque<_Tp, _Allocator>::insert(const_iterator __p, _InputIter __f, _InputIter __l,
2086 __buf.__construct_at_end(__f, __l);
2094 deque<_Tp, _Allocator>::insert(const_iterator __p, _ForwardIterator __f, _ForwardIterator __l,
2098 size_type __n = _VSTD::distance(__f, __l);
2100 __buf.__construct_at_end(__f, __l);
2108 deque<_Tp, _Allocator>::insert(const_iterator __p, _BiIter __f, _BiIter __l,
2111 size_type __n = _VSTD::distance(__f, __l);
2125 __m = __pos < __n / 2 ? _VSTD::prev(__l, __pos) : _VSTD::next(__f, __n - __pos);
2141 _VSTD::copy(__m, __l, __old_begin);
2152 _BiIter __m = __l;
2156 __m = __de < __n / 2 ? _VSTD::next(__f, __de) : _VSTD::prev(__l, __n - __de);
2157 for (_BiIter __j = __m; __j != __l; ++__i, (void) ++__j, ++__base::size())
2177 deque<_Tp, _Allocator>::__append(_InpIter __f, _InpIter __l,
2181 for (; __f != __l; ++__f)
2188 deque<_Tp, _Allocator>::__append(_ForIter __f, _ForIter __l,
2191 size_type __n = _VSTD::distance(__f, __l);
2197 for (iterator __i = __base::end(); __f != __l; ++__i, (void) ++__f, ++__base::size())
2548 // move assign [__f, __l) to [__r, __r + (__l-__f)).
2549 // If __vt points into [__f, __l), then subtract (__f - __r) from __vt.
2552 deque<_Tp, _Allocator>::__move_and_check(iterator __f, iterator __l, iterator __r,
2556 // for (; __f != __l; ++__f, ++__r)
2558 difference_type __n = __l - __f;
2578 // move assign [__f, __l) to [__r - (__l-__f), __r) backwards.
2579 // If __vt points into [__f, __l), then add (__r - __l) to __vt.
2582 deque<_Tp, _Allocator>::__move_backward_and_check(iterator __f, iterator __l, iterator __r,
2586 // while (__f != __l)
2587 // *--__r = _VSTD::move(*--__l);
2588 difference_type __n = __l - __f;
2591 --__l;
2592 pointer __lb = *__l.__m_iter_;
2593 pointer __le = __l.__ptr_ + 1;
2601 …__vt = (const_iterator(static_cast<__map_const_pointer>(__l.__m_iter_), __vt) += __r - __l - 1).__…
2604 __l -= __bs - 1;
2609 // move construct [__f, __l) to [__r, __r + (__l-__f)).
2610 // If __vt points into [__f, __l), then add (__r - __f) to __vt.
2613 deque<_Tp, _Allocator>::__move_construct_and_check(iterator __f, iterator __l,
2618 // for (; __f != __l; ++__r, ++__f, ++__base::size())
2620 difference_type __n = __l - __f;
2640 // move construct [__f, __l) to [__r - (__l-__f), __r) backwards.
2641 // If __vt points into [__f, __l), then subtract (__l - __r) from __vt.
2644 deque<_Tp, _Allocator>::__move_construct_backward_and_check(iterator __f, iterator __l,
2649 // for (iterator __j = __l; __j != __f;)
2655 difference_type __n = __l - __f;
2658 --__l;
2659 pointer __lb = *__l.__m_iter_;
2660 pointer __le = __l.__ptr_ + 1;
2668 …__vt = (const_iterator(static_cast<__map_const_pointer>(__l.__m_iter_), __vt) -= __l - __r + 1).__…
2676 __l -= __bs - 1;
2717 deque<_Tp, _Allocator>::erase(const_iterator __f, const_iterator __l)
2719 difference_type __n = __l - __f;