Lines Matching refs:__l

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_;
757         __link_pointer __l = __end_as_link();
758         __unlink_nodes(__f, __l->__prev_);
760         while (__f != __l)
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)
1169     __p->__prev_ = __l;
1170     __l->__next_ = __p;
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)
1180     __l->__next_ = base::__end_.__next_;
1181     __l->__next_->__prev_ = __l;
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)
1191     __l->__next_ = base::__end_as_link();
1194     base::__end_.__prev_ = __l;
1256 list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l,
1262     for (; __f != __l; ++__f)
1268 list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l, const allocator_type& __a,
1275     for (; __f != __l; ++__f)
1407 list<_Tp, _Alloc>::assign(_InpIter __f, _InpIter __l,
1412     for (; __f != __l && __i != __e; ++__f, ++__i)
1415         insert(__e, __f, __l);
1536 list<_Tp, _Alloc>::insert(const_iterator __p, _InpIter __f, _InpIter __l,
1547     if (__f != __l)
1565             for (++__f; __f != __l; ++__f, (void) ++__e, (void) ++__ds)
1843 list<_Tp, _Alloc>::erase(const_iterator __f, const_iterator __l)
1849    _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__l) == this,
1853     if (__f != __l)
1856         base::__unlink_nodes(__f.__ptr_, __l.__ptr_->__prev_);
1857         while (__f != __l)
1883     return iterator(__l.__ptr_, this);
1885     return iterator(__l.__ptr_);
2018         __link_pointer __l = __c.__end_.__prev_;
2019         base::__unlink_nodes(__f, __l);
2020         __link_nodes(__p.__ptr_, __f, __l);
2093 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l)
2104         for (const_iterator __i = __f; __i != __l; ++__i)
2111     if (__f != __l)
2114         --__l;
2115         __link_pointer __last = __l.__ptr_;
2118             size_type __s = _VSTD::distance(__f, __l) + 1;
2134                                               __k != __l.__ptr_; __k = __k->__next_)
2250                 __link_pointer __l = __m2.__ptr_->__prev_;
2252                 base::__unlink_nodes(__f, __l);
2254                 __link_nodes(__f1.__ptr_, __f, __l);
2329         __link_pointer __l = __m2.__ptr_->__prev_;
2332         base::__unlink_nodes(__f, __l);
2334         __link_nodes(__f1.__ptr_, __f, __l);
2347             __link_pointer __l = __m2.__ptr_->__prev_;
2351             base::__unlink_nodes(__f, __l);
2353             __link_nodes(__f1.__ptr_, __f, __l);