Lines Matching refs:__f
625 _LIBCPP_HIDE_FROM_ABI deque(_InputIter __f, _InputIter __l);
627 _LIBCPP_HIDE_FROM_ABI deque(_InputIter __f, _InputIter __l, const allocator_type& __a);
671 _LIBCPP_HIDE_FROM_ABI void assign(_InputIter __f, _InputIter __l);
673 _LIBCPP_HIDE_FROM_ABI void assign(_RAIter __f, _RAIter __l);
798 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, _InputIter __f, _InputIter __l);
801 …_LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, _ForwardIterator __f, _ForwardIterator _…
803 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __p, _BiIter __f, _BiIter __l);
825 _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __f, const_iterator __l);
1167 _LIBCPP_HIDE_FROM_ABI void __assign_with_sentinel(_Iterator __f, _Sentinel __l);
1170 …_LIBCPP_HIDE_FROM_ABI void __assign_with_size_random_access(_RandomAccessIterator __f, difference_…
1172 _LIBCPP_HIDE_FROM_ABI void __assign_with_size(_Iterator __f, difference_type __n);
1175 …_LIBCPP_HIDE_FROM_ABI iterator __insert_with_sentinel(const_iterator __p, _Iterator __f, _Sentinel…
1178 …_LIBCPP_HIDE_FROM_ABI iterator __insert_with_size(const_iterator __p, _Iterator __f, size_type __n…
1182 __insert_bidirectional(const_iterator __p, _BiIter __f, _Sentinel __sent, size_type __n);
1184 …_LIBCPP_HIDE_FROM_ABI iterator __insert_bidirectional(const_iterator __p, _BiIter __f, _BiIter __l…
1187 _LIBCPP_HIDE_FROM_ABI void __append(_InpIter __f, _InpIter __l);
1189 _LIBCPP_HIDE_FROM_ABI void __append(_ForIter __f, _ForIter __l);
1194 _LIBCPP_HIDE_FROM_ABI void __append_with_sentinel(_InputIterator __f, _Sentinel __l);
1198 _LIBCPP_HIDE_FROM_ABI void __erase_to_end(const_iterator __f);
1203 …_LIBCPP_HIDE_FROM_ABI iterator __move_and_check(iterator __f, iterator __l, iterator __r, const_po…
1205 __move_backward_and_check(iterator __f, iterator __l, iterator __r, const_pointer& __vt);
1206 …_LIBCPP_HIDE_FROM_ABI void __move_construct_and_check(iterator __f, iterator __l, iterator __r, co…
1208 …__move_construct_backward_and_check(iterator __f, iterator __l, iterator __r, const_pointer& __vt);
1281 deque<_Tp, _Allocator>::deque(_InputIter __f, _InputIter __l) : __start_(0), __size_(0, __default_i…
1283 __append(__f, __l);
1288 deque<_Tp, _Allocator>::deque(_InputIter __f, _InputIter __l, const allocator_type& __a)
1291 __append(__f, __l);
1390 void deque<_Tp, _Allocator>::assign(_InputIter __f, _InputIter __l) {
1391 __assign_with_sentinel(__f, __l);
1396 _LIBCPP_HIDE_FROM_ABI void deque<_Tp, _Allocator>::__assign_with_sentinel(_Iterator __f, _Sentinel …
1399 for (; __f != __l && __i != __e; ++__f, (void)++__i)
1400 *__i = *__f;
1401 if (__f != __l)
1402 __append_with_sentinel(std::move(__f), std::move(__l));
1409 void deque<_Tp, _Allocator>::assign(_RAIter __f, _RAIter __l) {
1410 __assign_with_size_random_access(__f, __l - __f);
1416 deque<_Tp, _Allocator>::__assign_with_size_random_access(_RandomAccessIterator __f, difference_type…
1418 auto __l = __f + size();
1419 std::copy(__f, __l, begin());
1422 __erase_to_end(std::copy_n(__f, __n, begin()));
1427 _LIBCPP_HIDE_FROM_ABI void deque<_Tp, _Allocator>::__assign_with_size(_Iterator __f, difference_typ…
1433 *__i++ = *__f++;
1436 __append_with_size(__f, __added_size);
1439 __erase_to_end(std::copy_n(__f, __n, begin()));
1840 deque<_Tp, _Allocator>::insert(const_iterator __p, _InputIter __f, _InputIter __l) {
1841 return __insert_with_sentinel(__p, __f, __l);
1847 deque<_Tp, _Allocator>::__insert_with_sentinel(const_iterator __p, _Iterator __f, _Sentinel __l) {
1849 __buf.__construct_at_end_with_sentinel(std::move(__f), std::move(__l));
1857 deque<_Tp, _Allocator>::insert(const_iterator __p, _ForwardIterator __f, _ForwardIterator __l) {
1858 return __insert_with_size(__p, __f, std::distance(__f, __l));
1864 deque<_Tp, _Allocator>::__insert_with_size(const_iterator __p, _Iterator __f, size_type __n) {
1866 __buf.__construct_at_end_with_size(__f, __n);
1873 …Allocator>::iterator deque<_Tp, _Allocator>::insert(const_iterator __p, _BiIter __f, _BiIter __l) {
1874 return __insert_bidirectional(__p, __f, __l, std::distance(__f, __l));
1880 deque<_Tp, _Allocator>::__insert_bidirectional(const_iterator __p, _BiIter __f, _Sentinel, size_typ…
1881 return __insert_bidirectional(__p, __f, std::next(__f, __n), __n);
1887 deque<_Tp, _Allocator>::__insert_bidirectional(const_iterator __p, _BiIter __f, _BiIter __l, size_t…
1898 _BiIter __m = __f;
1900 __m = __pos < __n / 2 ? std::prev(__l, __pos) : std::next(__f, __n - __pos);
1901 for (_BiIter __j = __m; __j != __f; --__start_, ++__size())
1927 __m = __de < __n / 2 ? std::next(__f, __de) : std::prev(__l, __n - __de);
1938 std::copy_backward(__f, __m, __old_end);
1946 void deque<_Tp, _Allocator>::__append(_InpIter __f, _InpIter __l) {
1947 __append_with_sentinel(__f, __l);
1952 _LIBCPP_HIDE_FROM_ABI void deque<_Tp, _Allocator>::__append_with_sentinel(_InputIterator __f, _Sent…
1953 for (; __f != __l; ++__f)
1955 push_back(*__f);
1957 emplace_back(*__f);
1963 void deque<_Tp, _Allocator>::__append(_ForIter __f, _ForIter __l) {
1964 __append_with_size(__f, std::distance(__f, __l));
1969 _LIBCPP_HIDE_FROM_ABI void deque<_Tp, _Allocator>::__append_with_size(_InputIterator __f, size_type…
1979 for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_, (void)++__f) {
1980 __alloc_traits::construct(__a, std::__to_address(__tx.__pos_), *__f);
2292 // move assign [__f, __l) to [__r, __r + (__l-__f)).
2293 // If __vt points into [__f, __l), then subtract (__f - __r) from __vt.
2296 deque<_Tp, _Allocator>::__move_and_check(iterator __f, iterator __l, iterator __r, const_pointer& _…
2298 // for (; __f != __l; ++__f, ++__r)
2299 // *__r = std::move(*__f);
2300 difference_type __n = __l - __f;
2302 pointer __fb = __f.__ptr_;
2303 pointer __fe = *__f.__m_iter_ + __block_size;
2310 …__vt = (const_iterator(static_cast<__map_const_pointer>(__f.__m_iter_), __vt) -= __f - __r).__ptr_;
2313 __f += __bs;
2318 // move assign [__f, __l) to [__r - (__l-__f), __r) backwards.
2319 // If __vt points into [__f, __l), then add (__r - __l) to __vt.
2322 deque<_Tp, _Allocator>::__move_backward_and_check(iterator __f, iterator __l, iterator __r, const_p…
2324 // while (__f != __l)
2326 difference_type __n = __l - __f;
2345 // move construct [__f, __l) to [__r, __r + (__l-__f)).
2346 // If __vt points into [__f, __l), then add (__r - __f) to __vt.
2348 void deque<_Tp, _Allocator>::__move_construct_and_check(iterator __f, iterator __l, iterator __r, c…
2351 // for (; __f != __l; ++__r, ++__f, ++__size())
2352 // __alloc_traits::construct(__a, std::addressof(*__r), std::move(*__f));
2353 difference_type __n = __l - __f;
2355 pointer __fb = __f.__ptr_;
2356 pointer __fe = *__f.__m_iter_ + __block_size;
2363 …__vt = (const_iterator(static_cast<__map_const_pointer>(__f.__m_iter_), __vt) += __r - __f).__ptr_;
2367 __f += __bs;
2371 // move construct [__f, __l) to [__r - (__l-__f), __r) backwards.
2372 // If __vt points into [__f, __l), then subtract (__l - __r) from __vt.
2375 iterator __f, iterator __l, iterator __r, const_pointer& __vt) {
2378 // for (iterator __j = __l; __j != __f;)
2384 difference_type __n = __l - __f;
2407 typename deque<_Tp, _Allocator>::iterator deque<_Tp, _Allocator>::erase(const_iterator __f) {
2409 __f != end(), "deque::erase(iterator) called with a non-dereferenceable iterator");
2413 difference_type __pos = __f - __b;
2434 typename deque<_Tp, _Allocator>::iterator deque<_Tp, _Allocator>::erase(const_iterator __f, const_i…
2435 …_LIBCPP_ASSERT_VALID_INPUT_RANGE(__f <= __l, "deque::erase(first, last) called with an invalid ran…
2438 difference_type __n = __l - __f;
2440 difference_type __pos = __f - __b;
2467 void deque<_Tp, _Allocator>::__erase_to_end(const_iterator __f) {
2471 difference_type __n = __e - __f;
2475 difference_type __pos = __f - __b;