Lines Matching refs:__n
717 __node_pointer __n = __f;
719 __node_alloc_traits::destroy(__na, _VSTD::addressof(__n->__value_));
720 __node_alloc_traits::deallocate(__na, __n, 1);
845 explicit list(size_type __n);
847 explicit list(size_type __n, const allocator_type& __a);
849 list(size_type __n, const value_type& __x);
850 list(size_type __n, const value_type& __x, const allocator_type& __a);
883 void assign(size_type __n, const value_type& __x);
975 iterator insert(const_iterator __p, size_type __n, const value_type& __x);
999 void resize(size_type __n);
1000 void resize(size_type __n, const value_type& __x);
1049 bool __addable(const const_iterator* __i, ptrdiff_t __n) const;
1050 bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const;
1058 iterator __iterator(size_type __n);
1060 static iterator __sort(iterator __f1, iterator __e2, size_type __n, _Comp& __comp);
1107 list<_Tp, _Alloc>::__iterator(size_type __n)
1109 return __n <= base::__sz() / 2 ? _VSTD::next(begin(), __n)
1110 : _VSTD::prev(end(), base::__sz() - __n);
1114 list<_Tp, _Alloc>::list(size_type __n)
1119 for (; __n > 0; --__n)
1129 list<_Tp, _Alloc>::list(size_type __n, const allocator_type& __a) : base(__a)
1134 for (; __n > 0; --__n)
1144 list<_Tp, _Alloc>::list(size_type __n, const value_type& __x)
1149 for (; __n > 0; --__n)
1154 list<_Tp, _Alloc>::list(size_type __n, const value_type& __x, const allocator_type& __a)
1160 for (; __n > 0; --__n)
1340 list<_Tp, _Alloc>::assign(size_type __n, const value_type& __x)
1344 for (; __n > 0 && __i != __e; --__n, ++__i)
1347 insert(__e, __n, __x);
1385 list<_Tp, _Alloc>::insert(const_iterator __p, size_type __n, const value_type& __x)
1395 if (__n > 0)
1415 for (--__n; __n != 0; --__n, ++__e, ++__ds)
1658 __node_pointer __n = base::__end_.__next_;
1659 base::__unlink_nodes(__n, __n);
1667 if (__i->__ptr_ == __n)
1676 __node_alloc_traits::destroy(__na, _VSTD::addressof(__n->__value_));
1677 __node_alloc_traits::deallocate(__na, __n, 1);
1686 __node_pointer __n = base::__end_.__prev_;
1687 base::__unlink_nodes(__n, __n);
1695 if (__i->__ptr_ == __n)
1704 __node_alloc_traits::destroy(__na, _VSTD::addressof(__n->__value_));
1705 __node_alloc_traits::deallocate(__na, __n, 1);
1720 __node_pointer __n = __p.__ptr_;
1721 __node_pointer __r = __n->__next_;
1722 base::__unlink_nodes(__n, __n);
1730 if (__i->__ptr_ == __n)
1739 __node_alloc_traits::destroy(__na, _VSTD::addressof(__n->__value_));
1740 __node_alloc_traits::deallocate(__na, __n, 1);
1763 __node_pointer __n = __f.__ptr_;
1772 if (__i->__ptr_ == __n)
1781 __node_alloc_traits::destroy(__na, _VSTD::addressof(__n->__value_));
1782 __node_alloc_traits::deallocate(__na, __n, 1);
1794 list<_Tp, _Alloc>::resize(size_type __n)
1796 if (__n < base::__sz())
1797 erase(__iterator(__n), end());
1798 else if (__n > base::__sz())
1800 __n -= base::__sz();
1818 for (--__n; __n != 0; --__n, ++__e, ++__ds)
1853 list<_Tp, _Alloc>::resize(size_type __n, const value_type& __x)
1855 if (__n < base::__sz())
1856 erase(__iterator(__n), end());
1857 else if (__n > base::__sz())
1859 __n -= base::__sz();
1877 for (--__n; __n != 0; --__n, ++__e, ++__ds)
2202 list<_Tp, _Alloc>::__sort(iterator __f1, iterator __e2, size_type __n, _Comp& __comp)
2204 switch (__n)
2219 size_type __n2 = __n / 2;
2222 iterator __f2 = __e1 = __sort(__e1, __e2, __n - __n2, __comp);
2304 list<_Tp, _Alloc>::__addable(const const_iterator* __i, ptrdiff_t __n) const
2311 list<_Tp, _Alloc>::__subscriptable(const const_iterator* __i, ptrdiff_t __n) const