Lines Matching refs:__f
543 static void __unlink_nodes(__node_pointer __f, __node_pointer __l) _NOEXCEPT;
641 // Unlink nodes [__f, __l]
645 __list_imp<_Tp, _Alloc>::__unlink_nodes(__node_pointer __f, __node_pointer __l)
648 __f->__prev_->__next_ = __l->__next_;
649 __l->__next_->__prev_ = __f->__prev_;
683 __node_pointer __f = __end_.__next_;
686 __unlink_nodes(__f, __l->__prev_);
688 while (__f != __l)
690 __node_pointer __n = __f;
691 __f = __f->__next_;
829 list(_InpIter __f, _InpIter __l,
832 list(_InpIter __f, _InpIter __l, const allocator_type& __a,
858 void assign(_InpIter __f, _InpIter __l,
954 iterator insert(const_iterator __p, _InpIter __f, _InpIter __l,
978 iterator erase(const_iterator __f, const_iterator __l);
994 void splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l);
997 void splice(const_iterator __p, list&& __c, const_iterator __f, const_iterator __l)
998 {splice(__p, __c, __f, __l);}
1036 static void __link_nodes (__node_pointer __p, __node_pointer __f, __node_pointer __l);
1037 void __link_nodes_at_front(__node_pointer __f, __node_pointer __l);
1038 void __link_nodes_at_back (__node_pointer __f, __node_pointer __l);
1048 // Link in nodes [__f, __l] just prior to __p
1052 list<_Tp, _Alloc>::__link_nodes(__node_pointer __p, __node_pointer __f, __node_pointer __l)
1054 __p->__prev_->__next_ = __f;
1055 __f->__prev_ = __p->__prev_;
1060 // Link in nodes [__f, __l] at the front of the list
1064 list<_Tp, _Alloc>::__link_nodes_at_front(__node_pointer __f, __node_pointer __l)
1066 __f->__prev_ = base::__end_.__self();
1069 base::__end_.__next_ = __f;
1072 // Link in nodes [__f, __l] at the front of the list
1076 list<_Tp, _Alloc>::__link_nodes_at_back(__node_pointer __f, __node_pointer __l)
1079 __f->__prev_ = base::__end_.__prev_;
1080 __f->__prev_->__next_ = __f;
1147 list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l,
1153 for (; __f != __l; ++__f)
1154 push_back(*__f);
1159 list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l, const allocator_type& __a,
1166 for (; __f != __l; ++__f)
1167 push_back(*__f);
1306 list<_Tp, _Alloc>::assign(_InpIter __f, _InpIter __l,
1311 for (; __f != __l && __i != __e; ++__f, ++__i)
1312 *__i = *__f;
1314 insert(__e, __f, __l);
1433 list<_Tp, _Alloc>::insert(const_iterator __p, _InpIter __f, _InpIter __l,
1444 if (__f != __l)
1451 __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), *__f);
1464 for (++__f; __f != __l; ++__f, (void) ++__e, (void) ++__ds)
1467 __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), *__f);
1731 list<_Tp, _Alloc>::erase(const_iterator __f, const_iterator __l)
1734 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__f) == this,
1738 if (__f != __l)
1741 base::__unlink_nodes(__f.__ptr_, __l.__ptr_->__prev_);
1742 while (__f != __l)
1744 __node_pointer __n = __f.__ptr_;
1745 ++__f;
1905 __node_pointer __f = __c.__end_.__next_;
1907 base::__unlink_nodes(__f, __l);
1908 __link_nodes(__p.__ptr_, __f, __l);
1950 __node_pointer __f = __i.__ptr_;
1951 base::__unlink_nodes(__f, __f);
1952 __link_nodes(__p.__ptr_, __f, __f);
1963 if (__j->__ptr_ == __f)
1978 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l)
1984 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__f) == &__c,
1989 for (const_iterator __i = __f; __i != __l; ++__i)
1996 if (__f != __l)
2000 size_type __s = _VSTD::distance(__f, __l);
2004 __node_pointer __first = __f.__ptr_;
2017 for (__node_pointer __k = __f.__ptr_;
2129 __node_pointer __f = __f2.__ptr_;
2132 base::__unlink_nodes(__f, __l);
2134 __link_nodes(__f1.__ptr_, __f, __l);
2193 __node_pointer __f = __e2.__ptr_;
2194 base::__unlink_nodes(__f, __f);
2195 __link_nodes(__f1.__ptr_, __f, __f);
2209 __node_pointer __f = __f2.__ptr_;
2213 base::__unlink_nodes(__f, __l);
2215 __link_nodes(__f1.__ptr_, __f, __l);
2227 __node_pointer __f = __f2.__ptr_;
2232 base::__unlink_nodes(__f, __l);
2234 __link_nodes(__f1.__ptr_, __f, __l);