Lines Matching refs:__l

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_;
684         __node_pointer __l = static_cast<__node_pointer>(
686         __unlink_nodes(__f, __l->__prev_);
688         while (__f != __l)
701             if (__i->__ptr_ != __l)
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)
1056     __p->__prev_ = __l;
1057     __l->__next_ = __p;
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)
1067     __l->__next_ = base::__end_.__next_;
1068     __l->__next_->__prev_ = __l;
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)
1078     __l->__next_ = base::__end_.__self();
1081     base::__end_.__prev_ = __l;
1147 list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l,
1153     for (; __f != __l; ++__f)
1159 list<_Tp, _Alloc>::list(_InpIter __f, _InpIter __l, const allocator_type& __a,
1166     for (; __f != __l; ++__f)
1306 list<_Tp, _Alloc>::assign(_InpIter __f, _InpIter __l,
1311     for (; __f != __l && __i != __e; ++__f, ++__i)
1314         insert(__e, __f, __l);
1433 list<_Tp, _Alloc>::insert(const_iterator __p, _InpIter __f, _InpIter __l,
1444     if (__f != __l)
1464             for (++__f; __f != __l; ++__f, (void) ++__e, (void) ++__ds)
1731 list<_Tp, _Alloc>::erase(const_iterator __f, const_iterator __l)
1738     if (__f != __l)
1741         base::__unlink_nodes(__f.__ptr_, __l.__ptr_->__prev_);
1742         while (__f != __l)
1767     return iterator(__l.__ptr_, this);
1769     return iterator(__l.__ptr_);
1906         __node_pointer __l = __c.__end_.__prev_;
1907         base::__unlink_nodes(__f, __l);
1908         __link_nodes(__p.__ptr_, __f, __l);
1978 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l)
1989         for (const_iterator __i = __f; __i != __l; ++__i)
1996     if (__f != __l)
2000             size_type __s = _VSTD::distance(__f, __l);
2005         --__l;
2006         __node_pointer __last = __l.__ptr_;
2018                                           __k != __l.__ptr_; __k = __k->__next_)
2130                 __node_pointer __l = __m2.__ptr_->__prev_;
2132                 base::__unlink_nodes(__f, __l);
2134                 __link_nodes(__f1.__ptr_, __f, __l);
2210         __node_pointer __l = __m2.__ptr_->__prev_;
2213         base::__unlink_nodes(__f, __l);
2215         __link_nodes(__f1.__ptr_, __f, __l);
2228             __node_pointer __l = __m2.__ptr_->__prev_;
2232             base::__unlink_nodes(__f, __l);
2234             __link_nodes(__f1.__ptr_, __f, __l);