Lines Matching refs:__f
597 static void __unlink_nodes(__link_pointer __f, __link_pointer __l) _NOEXCEPT;
705 // Unlink nodes [__f, __l]
709 __list_imp<_Tp, _Alloc>::__unlink_nodes(__link_pointer __f, __link_pointer __l)
712 __f->__prev_->__next_ = __l->__next_;
713 __l->__next_->__prev_ = __f->__prev_;
756 __link_pointer __f = __end_.__next_;
758 __unlink_nodes(__f, __l->__prev_);
760 while (__f != __l)
762 __node_pointer __np = __f->__as_node();
763 __f = __f->__next_;
891 list(_InpIter __f, _InpIter __l,
894 list(_InpIter __f, _InpIter __l, const allocator_type& __a,
926 void assign(_InpIter __f, _InpIter __l,
1043 iterator insert(const_iterator __p, _InpIter __f, _InpIter __l,
1062 iterator erase(const_iterator __f, const_iterator __l);
1075 void splice(const_iterator __p, list&& __c, const_iterator __f, const_iterator __l)
1076 {splice(__p, __c, __f, __l);}
1079 void splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l);
1131 static void __link_nodes (__link_pointer __p, __link_pointer __f, __link_pointer __l);
1133 void __link_nodes_at_front(__link_pointer __f, __link_pointer __l);
1135 void __link_nodes_at_back (__link_pointer __f, __link_pointer __l);
1161 // Link in nodes [__f, __l] just prior to __p
1165 list<_Tp, _Alloc>::__link_nodes(__link_pointer __p, __link_pointer __f, __link_pointer __l)
1167 __p->__prev_->__next_ = __f;
1168 __f->__prev_ = __p->__prev_;
1173 // Link in nodes [__f, __l] at the front of the list
1177 list<_Tp, _Alloc>::__link_nodes_at_front(__link_pointer __f, __link_pointer __l)
1179 __f->__prev_ = base::__end_as_link();
1182 base::__end_.__next_ = __f;
1185 // Link in nodes [__f, __l] at the back of the list
1189 list<_Tp, _Alloc>::__link_nodes_at_back(__link_pointer __f, __link_pointer __l)
1192 __f->__prev_ = base::__end_.__prev_;
1193 __f->__prev_->__next_ = __f;
1256 list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l,
1262 for (; __f != __l; ++__f)
1263 __emplace_back(*__f);
1268 list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l, const allocator_type& __a,
1275 for (; __f != __l; ++__f)
1276 __emplace_back(*__f);
1407 list<_Tp, _Alloc>::assign(_InpIter __f, _InpIter __l,
1412 for (; __f != __l && __i != __e; ++__f, ++__i)
1413 *__i = *__f;
1415 insert(__e, __f, __l);
1536 list<_Tp, _Alloc>::insert(const_iterator __p, _InpIter __f, _InpIter __l,
1547 if (__f != __l)
1552 __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), *__f);
1565 for (++__f; __f != __l; ++__f, (void) ++__e, (void) ++__ds)
1568 __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), *__f);
1843 list<_Tp, _Alloc>::erase(const_iterator __f, const_iterator __l)
1846 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__f) == this,
1853 if (__f != __l)
1856 base::__unlink_nodes(__f.__ptr_, __l.__ptr_->__prev_);
1857 while (__f != __l)
1859 __link_pointer __n = __f.__ptr_;
1860 ++__f;
2017 __link_pointer __f = __c.__end_.__next_;
2019 base::__unlink_nodes(__f, __l);
2020 __link_nodes(__p.__ptr_, __f, __l);
2063 __link_pointer __f = __i.__ptr_;
2064 base::__unlink_nodes(__f, __f);
2065 __link_nodes(__p.__ptr_, __f, __f);
2077 if (__j->__ptr_ == __f)
2093 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l)
2099 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__f) == &__c,
2104 for (const_iterator __i = __f; __i != __l; ++__i)
2111 if (__f != __l)
2113 __link_pointer __first = __f.__ptr_;
2118 size_type __s = _VSTD::distance(__f, __l) + 1;
2133 for (__link_pointer __k = __f.__ptr_;
2249 __link_pointer __f = __f2.__ptr_;
2252 base::__unlink_nodes(__f, __l);
2254 __link_nodes(__f1.__ptr_, __f, __l);
2312 __link_pointer __f = __e2.__ptr_;
2313 base::__unlink_nodes(__f, __f);
2314 __link_nodes(__f1.__ptr_, __f, __f);
2328 __link_pointer __f = __f2.__ptr_;
2332 base::__unlink_nodes(__f, __l);
2334 __link_nodes(__f1.__ptr_, __f, __l);
2346 __link_pointer __f = __f2.__ptr_;
2351 base::__unlink_nodes(__f, __l);
2353 __link_nodes(__f1.__ptr_, __f, __l);