include/bits/stl_vector.h

192 	    _S_grow(_Vector_impl& __impl, size_type __n)
193 	    { _S_adjust(__impl, __impl._M_finish, __impl._M_finish + __n); }
196 	    _S_shrink(_Vector_impl& __impl, size_type __n)
197 	    { _S_adjust(__impl, __impl._M_finish + __n, __impl._M_finish); }
234 	      _Grow(_Vector_impl& __impl, size_type __n)
235 	      : _M_impl(__impl), _M_n(__n)
236 	      { _S_grow(_M_impl, __n); }
240 	      void _M_grew(size_type __n) { _M_n -= __n; }
298       _Vector_base(size_t __n)
300       { _M_create_storage(__n); }
303       _Vector_base(size_t __n, const allocator_type& __a)
305       { _M_create_storage(__n); }
322 	    size_t __n = __x._M_impl._M_finish - __x._M_impl._M_start;
323 	    _M_create_storage(__n);
343       _M_allocate(size_t __n)
346 	return __n != 0 ? _Tr::allocate(_M_impl, __n) : pointer();
350       _M_deallocate(pointer __p, size_t __n)
354 	  _Tr::deallocate(_M_impl, __p, __n);
359       _M_create_storage(size_t __n)
361 	this->_M_impl._M_start = this->_M_allocate(__n);
363 	this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
503        *  @param  __n  The number of elements to initially create.
506        *  This constructor fills the %vector with @a __n default
510       vector(size_type __n, const allocator_type& __a = allocator_type())
511       : _Base(_S_check_init_len(__n, __a), __a)
512       { _M_default_initialize(__n); }
516        *  @param  __n  The number of elements to initially create.
520        *  This constructor fills the %vector with @a __n copies of @a __value.
522       vector(size_type __n, const value_type& __value,
524       : _Base(_S_check_init_len(__n, __a), __a)
525       { _M_fill_initialize(__n, __value); }
529        *  @param  __n  The number of elements to initially create.
533        *  This constructor fills the %vector with @a __n copies of @a __value.
536       vector(size_type __n, const value_type& __value = value_type(),
538       : _Base(_S_check_init_len(__n, __a), __a)
539       { _M_fill_initialize(__n, __value); }
740        *  @param  __n  Number of elements to be assigned.
743        *  This function fills a %vector with @a __n copies of the given
749       assign(size_type __n, const value_type& __val)
750       { _M_fill_assign(__n, __val); }
1013        *  @param  __n  Number of elements required.
1028       reserve(size_type __n);
1033        *  @param __n The index of the element for which data should be
1043       operator[](size_type __n) _GLIBCXX_NOEXCEPT
1045 	__glibcxx_requires_subscript(__n);
1046 	return *(this->_M_impl._M_start + __n);
1051        *  @param __n The index of the element for which data should be
1061       operator[](size_type __n) const _GLIBCXX_NOEXCEPT
1063 	__glibcxx_requires_subscript(__n);
1064 	return *(this->_M_impl._M_start + __n);
1070       _M_range_check(size_type __n) const
1072 	if (__n >= this->size())
1073 	  __throw_out_of_range_fmt(__N("vector::_M_range_check: __n "
1076 				   __n, this->size());
1082        *  @param __n The index of the element for which data should be
1085        *  @throw  std::out_of_range  If @a __n is an invalid index.
1092       at(size_type __n)
1094 	_M_range_check(__n);
1095 	return (*this)[__n];
1100        *  @param __n The index of the element for which data should be
1103        *  @throw  std::out_of_range  If @a __n is an invalid index.
1110       at(size_type __n) const
1112 	_M_range_check(__n);
1113 	return (*this)[__n];
1323        *  @param  __n  Number of elements to be inserted.
1335       insert(const_iterator __position, size_type __n, const value_type& __x)
1338 	_M_fill_insert(begin() + __offset, __n, __x);
1345        *  @param  __n  Number of elements to be inserted.
1356       insert(iterator __position, size_type __n, const value_type& __x)
1357       { _M_fill_insert(__position, __n, __x); }
1508 	_M_allocate_and_copy(size_type __n,
1511 	  pointer __result = this->_M_allocate(__n);
1520 	      _M_deallocate(__result, __n);
1535 	_M_initialize_dispatch(_Integer __n, _Integer __value, __true_type)
1538 		static_cast<size_type>(__n), _M_get_Tp_allocator()));
1540 	    this->_M_impl._M_start + static_cast<size_type>(__n);
1541 	  _M_fill_initialize(static_cast<size_type>(__n), __value);
1580 	  const size_type __n = std::distance(__first, __last);
1582 	    = this->_M_allocate(_S_check_init_len(__n, _M_get_Tp_allocator()));
1583 	  this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
1593       _M_fill_initialize(size_type __n, const value_type& __value)
1596 	  std::__uninitialized_fill_n_a(this->_M_impl._M_start, __n, __value,
1603       _M_default_initialize(size_type __n)
1606 	  std::__uninitialized_default_n_a(this->_M_impl._M_start, __n,
1620 	_M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
1621 	{ _M_fill_assign(__n, __val); }
1645       _M_fill_assign(size_type __n, const value_type& __val);
1655 	_M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
1657 	{ _M_fill_insert(__pos, __n, __val); }
1684       _M_fill_insert(iterator __pos, size_type __n, const value_type& __x);
1689       _M_default_append(size_type __n);
1756       _M_check_len(size_type __n, const char* __s) const
1758 	if (max_size() - size() < __n)
1761 	const size_type __len = size() + (std::max)(size(), __n);
1767       _S_check_init_len(size_type __n, const allocator_type& __a)
1769 	if (__n > _S_max_size(_Tp_alloc_type(__a)))
1772 	return __n;
1794 	if (size_type __n = this->_M_impl._M_finish - __pos)
1799 	    _GLIBCXX_ASAN_ANNOTATE_SHRINK(__n);