Lines Matching refs:__n

877     explicit list(size_type __n);
879     explicit list(size_type __n, const allocator_type& __a);
881     list(size_type __n, const value_type& __x);
882     list(size_type __n, const value_type& __x, const allocator_type& __a);
921     void assign(size_type __n, const value_type& __x);
1034     iterator insert(const_iterator __p, size_type __n, const value_type& __x);
1057     void resize(size_type __n);
1058     void resize(size_type __n, const value_type& __x);
1117     bool __addable(const const_iterator* __i, ptrdiff_t __n) const;
1118     bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const;
1129     iterator __iterator(size_type __n);
1131         static iterator __sort(iterator __f1, iterator __e2, size_type __n, _Comp& __comp);
1194 list<_Tp, _Alloc>::__iterator(size_type __n)
1196     return __n <= base::__sz() / 2 ? _VSTD::next(begin(), __n)
1197                                    : _VSTD::prev(end(), base::__sz() - __n);
1201 list<_Tp, _Alloc>::list(size_type __n)
1206     for (; __n > 0; --__n)
1216 list<_Tp, _Alloc>::list(size_type __n, const allocator_type& __a) : base(__a)
1221     for (; __n > 0; --__n)
1227 list<_Tp, _Alloc>::list(size_type __n, const value_type& __x)
1232     for (; __n > 0; --__n)
1237 list<_Tp, _Alloc>::list(size_type __n, const value_type& __x, const allocator_type& __a)
1243     for (; __n > 0; --__n)
1418 list<_Tp, _Alloc>::assign(size_type __n, const value_type& __x)
1422     for (; __n > 0 && __i != __e; --__n, ++__i)
1425         insert(__e, __n, __x);
1464 list<_Tp, _Alloc>::insert(const_iterator __p, size_type __n, const value_type& __x)
1474     if (__n > 0)
1492             for (--__n; __n != 0; --__n, ++__e, ++__ds)
1741     __link_pointer __n = base::__end_.__next_;
1742     base::__unlink_nodes(__n, __n);
1750         if (__i->__ptr_ == __n)
1759     __node_pointer __np = __n->__as_node();
1770     __link_pointer __n = base::__end_.__prev_;
1771     base::__unlink_nodes(__n, __n);
1779         if (__i->__ptr_ == __n)
1788     __node_pointer __np = __n->__as_node();
1805     __link_pointer __n = __p.__ptr_;
1806     __link_pointer __r = __n->__next_;
1807     base::__unlink_nodes(__n, __n);
1815         if (__i->__ptr_ == __n)
1824     __node_pointer __np = __n->__as_node();
1852             __link_pointer __n = __f.__ptr_;
1861                 if (__i->__ptr_ == __n)
1870             __node_pointer __np = __n->__as_node();
1884 list<_Tp, _Alloc>::resize(size_type __n)
1886     if (__n < base::__sz())
1887         erase(__iterator(__n), end());
1888     else if (__n > base::__sz())
1890         __n -= base::__sz();
1906             for (--__n; __n != 0; --__n, ++__e, ++__ds)
1941 list<_Tp, _Alloc>::resize(size_type __n, const value_type& __x)
1943     if (__n < base::__sz())
1944         erase(__iterator(__n), end());
1945     else if (__n > base::__sz())
1947         __n -= base::__sz();
1964             for (--__n; __n != 0; --__n, ++__e, ++__ds)
2286 list<_Tp, _Alloc>::__sort(iterator __f1, iterator __e2, size_type __n, _Comp& __comp)
2288     switch (__n)
2303     size_type __n2 = __n / 2;
2306     iterator __f2 = __e1 = __sort(__e1, __e2, __n - __n2, __comp);