• Home
  • Raw
  • Download

Lines Matching refs:__f

595     static void __unlink_nodes(__link_pointer __f, __link_pointer __l) _NOEXCEPT;
703 // Unlink nodes [__f, __l]
707 __list_imp<_Tp, _Alloc>::__unlink_nodes(__link_pointer __f, __link_pointer __l)
710 __f->__prev_->__next_ = __l->__next_;
711 __l->__next_->__prev_ = __f->__prev_;
754 __link_pointer __f = __end_.__next_;
756 __unlink_nodes(__f, __l->__prev_);
758 while (__f != __l)
760 __node_pointer __np = __f->__as_node();
761 __f = __f->__next_;
884 list(_InpIter __f, _InpIter __l,
887 list(_InpIter __f, _InpIter __l, const allocator_type& __a,
919 void assign(_InpIter __f, _InpIter __l,
1036 iterator insert(const_iterator __p, _InpIter __f, _InpIter __l,
1055 iterator erase(const_iterator __f, const_iterator __l);
1068 void splice(const_iterator __p, list&& __c, const_iterator __f, const_iterator __l)
1069 {splice(__p, __c, __f, __l);}
1072 void splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l);
1124 static void __link_nodes (__link_pointer __p, __link_pointer __f, __link_pointer __l);
1126 void __link_nodes_at_front(__link_pointer __f, __link_pointer __l);
1128 void __link_nodes_at_back (__link_pointer __f, __link_pointer __l);
1154 // Link in nodes [__f, __l] just prior to __p
1158 list<_Tp, _Alloc>::__link_nodes(__link_pointer __p, __link_pointer __f, __link_pointer __l)
1160 __p->__prev_->__next_ = __f;
1161 __f->__prev_ = __p->__prev_;
1166 // Link in nodes [__f, __l] at the front of the list
1170 list<_Tp, _Alloc>::__link_nodes_at_front(__link_pointer __f, __link_pointer __l)
1172 __f->__prev_ = base::__end_as_link();
1175 base::__end_.__next_ = __f;
1178 // Link in nodes [__f, __l] at the back of the list
1182 list<_Tp, _Alloc>::__link_nodes_at_back(__link_pointer __f, __link_pointer __l)
1185 __f->__prev_ = base::__end_.__prev_;
1186 __f->__prev_->__next_ = __f;
1249 list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l,
1255 for (; __f != __l; ++__f)
1256 __emplace_back(*__f);
1261 list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l, const allocator_type& __a,
1268 for (; __f != __l; ++__f)
1269 __emplace_back(*__f);
1400 list<_Tp, _Alloc>::assign(_InpIter __f, _InpIter __l,
1405 for (; __f != __l && __i != __e; ++__f, ++__i)
1406 *__i = *__f;
1408 insert(__e, __f, __l);
1529 list<_Tp, _Alloc>::insert(const_iterator __p, _InpIter __f, _InpIter __l,
1540 if (__f != __l)
1545 __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), *__f);
1558 for (++__f; __f != __l; ++__f, (void) ++__e, (void) ++__ds)
1561 __node_alloc_traits::construct(__na, _VSTD::addressof(__hold->__value_), *__f);
1836 list<_Tp, _Alloc>::erase(const_iterator __f, const_iterator __l)
1839 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__f) == this,
1846 if (__f != __l)
1849 base::__unlink_nodes(__f.__ptr_, __l.__ptr_->__prev_);
1850 while (__f != __l)
1852 __link_pointer __n = __f.__ptr_;
1853 ++__f;
2010 __link_pointer __f = __c.__end_.__next_;
2012 base::__unlink_nodes(__f, __l);
2013 __link_nodes(__p.__ptr_, __f, __l);
2054 __link_pointer __f = __i.__ptr_;
2055 base::__unlink_nodes(__f, __f);
2056 __link_nodes(__p.__ptr_, __f, __f);
2067 if (__j->__ptr_ == __f)
2082 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l)
2088 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__f) == &__c,
2093 for (const_iterator __i = __f; __i != __l; ++__i)
2100 if (__f != __l)
2102 __link_pointer __first = __f.__ptr_;
2107 size_type __s = _VSTD::distance(__f, __l) + 1;
2121 for (__link_pointer __k = __f.__ptr_;
2233 __link_pointer __f = __f2.__ptr_;
2236 base::__unlink_nodes(__f, __l);
2238 __link_nodes(__f1.__ptr_, __f, __l);
2296 __link_pointer __f = __e2.__ptr_;
2297 base::__unlink_nodes(__f, __f);
2298 __link_nodes(__f1.__ptr_, __f, __f);
2312 __link_pointer __f = __f2.__ptr_;
2316 base::__unlink_nodes(__f, __l);
2318 __link_nodes(__f1.__ptr_, __f, __l);
2330 __link_pointer __f = __f2.__ptr_;
2335 base::__unlink_nodes(__f, __l);
2337 __link_nodes(__f1.__ptr_, __f, __l);