Lines Matching refs:__f
580 static void __unlink_nodes(__link_pointer __f, __link_pointer __l) _NOEXCEPT;
683 // Unlink nodes [__f, __l]
687 __list_imp<_Tp, _Alloc>::__unlink_nodes(__link_pointer __f, __link_pointer __l)
690 __f->__prev_->__next_ = __l->__next_;
691 __l->__next_->__prev_ = __f->__prev_;
725 __link_pointer __f = __end_.__next_;
727 __unlink_nodes(__f, __l->__prev_);
729 while (__f != __l)
731 __node_pointer __np = __f->__as_node();
732 __f = __f->__next_;
855 list(_InpIter __f, _InpIter __l,
858 list(_InpIter __f, _InpIter __l, const allocator_type& __a,
890 void assign(_InpIter __f, _InpIter __l,
1007 iterator insert(const_iterator __p, _InpIter __f, _InpIter __l,
1026 iterator erase(const_iterator __f, const_iterator __l);
1039 void splice(const_iterator __p, list&& __c, const_iterator __f, const_iterator __l)
1040 {splice(__p, __c, __f, __l);}
1043 void splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l);
1095 static void __link_nodes (__link_pointer __p, __link_pointer __f, __link_pointer __l);
1097 void __link_nodes_at_front(__link_pointer __f, __link_pointer __l);
1099 void __link_nodes_at_back (__link_pointer __f, __link_pointer __l);
1109 // Link in nodes [__f, __l] just prior to __p
1113 list<_Tp, _Alloc>::__link_nodes(__link_pointer __p, __link_pointer __f, __link_pointer __l)
1115 __p->__prev_->__next_ = __f;
1116 __f->__prev_ = __p->__prev_;
1121 // Link in nodes [__f, __l] at the front of the list
1125 list<_Tp, _Alloc>::__link_nodes_at_front(__link_pointer __f, __link_pointer __l)
1127 __f->__prev_ = base::__end_as_link();
1130 base::__end_.__next_ = __f;
1133 // Link in nodes [__f, __l] at the front of the list
1137 list<_Tp, _Alloc>::__link_nodes_at_back(__link_pointer __f, __link_pointer __l)
1140 __f->__prev_ = base::__end_.__prev_;
1141 __f->__prev_->__next_ = __f;
1204 list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l,
1210 for (; __f != __l; ++__f)
1211 __emplace_back(*__f);
1216 list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l, const allocator_type& __a,
1223 for (; __f != __l; ++__f)
1224 __emplace_back(*__f);
1359 list<_Tp, _Alloc>::assign(_InpIter __f, _InpIter __l,
1364 for (; __f != __l && __i != __e; ++__f, ++__i)
1365 *__i = *__f;
1367 insert(__e, __f, __l);
1488 list<_Tp, _Alloc>::insert(const_iterator __p, _InpIter __f, _InpIter __l,
1499 if (__f != __l)
1504 __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), *__f);
1517 for (++__f; __f != __l; ++__f, (void) ++__e, (void) ++__ds)
1520 __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), *__f);
1795 list<_Tp, _Alloc>::erase(const_iterator __f, const_iterator __l)
1798 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__f) == this,
1805 if (__f != __l)
1808 base::__unlink_nodes(__f.__ptr_, __l.__ptr_->__prev_);
1809 while (__f != __l)
1811 __link_pointer __n = __f.__ptr_;
1812 ++__f;
1969 __link_pointer __f = __c.__end_.__next_;
1971 base::__unlink_nodes(__f, __l);
1972 __link_nodes(__p.__ptr_, __f, __l);
2013 __link_pointer __f = __i.__ptr_;
2014 base::__unlink_nodes(__f, __f);
2015 __link_nodes(__p.__ptr_, __f, __f);
2026 if (__j->__ptr_ == __f)
2041 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l)
2047 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__f) == &__c,
2052 for (const_iterator __i = __f; __i != __l; ++__i)
2059 if (__f != __l)
2061 __link_pointer __first = __f.__ptr_;
2066 size_type __s = _VSTD::distance(__f, __l) + 1;
2080 for (__link_pointer __k = __f.__ptr_;
2192 __link_pointer __f = __f2.__ptr_;
2195 base::__unlink_nodes(__f, __l);
2197 __link_nodes(__f1.__ptr_, __f, __l);
2255 __link_pointer __f = __e2.__ptr_;
2256 base::__unlink_nodes(__f, __f);
2257 __link_nodes(__f1.__ptr_, __f, __f);
2271 __link_pointer __f = __f2.__ptr_;
2275 base::__unlink_nodes(__f, __l);
2277 __link_nodes(__f1.__ptr_, __f, __l);
2289 __link_pointer __f = __f2.__ptr_;
2294 base::__unlink_nodes(__f, __l);
2296 __link_nodes(__f1.__ptr_, __f, __l);