Lines Matching refs:__l

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_;
755         __link_pointer __l = __end_as_link();
756         __unlink_nodes(__f, __l->__prev_);
758         while (__f != __l)
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)
1162     __p->__prev_ = __l;
1163     __l->__next_ = __p;
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)
1173     __l->__next_ = base::__end_.__next_;
1174     __l->__next_->__prev_ = __l;
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)
1184     __l->__next_ = base::__end_as_link();
1187     base::__end_.__prev_ = __l;
1249 list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l,
1255     for (; __f != __l; ++__f)
1261 list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l, const allocator_type& __a,
1268     for (; __f != __l; ++__f)
1400 list<_Tp, _Alloc>::assign(_InpIter __f, _InpIter __l,
1405     for (; __f != __l && __i != __e; ++__f, ++__i)
1408         insert(__e, __f, __l);
1529 list<_Tp, _Alloc>::insert(const_iterator __p, _InpIter __f, _InpIter __l,
1540     if (__f != __l)
1558             for (++__f; __f != __l; ++__f, (void) ++__e, (void) ++__ds)
1836 list<_Tp, _Alloc>::erase(const_iterator __f, const_iterator __l)
1842    _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__l) == this,
1846     if (__f != __l)
1849         base::__unlink_nodes(__f.__ptr_, __l.__ptr_->__prev_);
1850         while (__f != __l)
1876     return iterator(__l.__ptr_, this);
1878     return iterator(__l.__ptr_);
2011         __link_pointer __l = __c.__end_.__prev_;
2012         base::__unlink_nodes(__f, __l);
2013         __link_nodes(__p.__ptr_, __f, __l);
2082 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l)
2093         for (const_iterator __i = __f; __i != __l; ++__i)
2100     if (__f != __l)
2103         --__l;
2104         __link_pointer __last = __l.__ptr_;
2107             size_type __s = _VSTD::distance(__f, __l) + 1;
2122                                           __k != __l.__ptr_; __k = __k->__next_)
2234                 __link_pointer __l = __m2.__ptr_->__prev_;
2236                 base::__unlink_nodes(__f, __l);
2238                 __link_nodes(__f1.__ptr_, __f, __l);
2313         __link_pointer __l = __m2.__ptr_->__prev_;
2316         base::__unlink_nodes(__f, __l);
2318         __link_nodes(__f1.__ptr_, __f, __l);
2331             __link_pointer __l = __m2.__ptr_->__prev_;
2335             base::__unlink_nodes(__f, __l);
2337             __link_nodes(__f1.__ptr_, __f, __l);