void __vector__<_Tp, _Alloc>::_M_fill_insert( iterator __position, size_type __n, const _Tp& __x) { if (__n != 0) { if (size_type(this->_M_end_of_storage._M_data - this->_M_finish) >= __n) { _Tp __x_copy = __x; const size_type __elems_after = this->_M_finish - __position; pointer __old_finish = this->_M_finish; if (__elems_after > __n) { __uninitialized_copy(this->_M_finish - __n, this->_M_finish, this->_M_finish, _IsPODType()); this->_M_finish += __n; __copy_backward_ptrs(__position, __old_finish - __n, __old_finish, _TrivialAss()); _STLP_STD::fill(__position, __position + __n, __x_copy); } else { uninitialized_fill_n(this->_M_finish, __n - __elems_after, __x_copy); this->_M_finish += __n - __elems_after; __uninitialized_copy(__position, __old_finish, this->_M_finish, _IsPODType()); this->_M_finish += __elems_after; _STLP_STD::fill(__position, __old_finish, __x_copy); } } else _M_insert_overflow(__position, __x, _IsPODType(), __n); } }
template <class _CharT, class _Traits, class _Alloc> basic_string<_CharT,_Traits,_Alloc>& basic_string<_CharT,_Traits,_Alloc>::append(size_type __n, _CharT __c) { if (__n > max_size() || size() > max_size() - __n) this->_M_throw_length_error(); if (size() + __n > capacity()) reserve(size() + (max)(size(), __n)); if (__n > 0) { uninitialized_fill_n(this->_M_finish + 1, __n - 1, __c); _STLP_TRY { _M_construct_null(this->_M_finish + __n); } _STLP_UNWIND(_Destroy(this->_M_finish + 1, this->_M_finish + __n)); _Traits::assign(*end(), __c); this->_M_finish += __n; }
void _VECTOR_IMPL<_Tp, _Alloc>::_M_fill_insert_aux (iterator __pos, size_type __n, const _Tp& __x, const __false_type& /*_Movable*/) { if (&__x >= this->_M_start && &__x < this->_M_finish) { _Tp __x_copy = __x; _M_fill_insert_aux(__pos, __n, __x_copy, __false_type()); return; } const size_type __elems_after = this->_M_finish - __pos; pointer __old_finish = this->_M_finish; if (__elems_after > __n) { __uninitialized_copy(this->_M_finish - __n, this->_M_finish, this->_M_finish, _TrivialUCpy()); this->_M_finish += __n; __copy_backward_ptrs(__pos, __old_finish - __n, __old_finish, _TrivialAss()); _STLP_STD::fill(__pos, __pos + __n, __x); } else { uninitialized_fill_n(this->_M_finish, __n - __elems_after, __x); this->_M_finish += __n - __elems_after; __uninitialized_copy(__pos, __old_finish, this->_M_finish, _TrivialUCpy()); this->_M_finish += __elems_after; _STLP_STD::fill(__pos, __old_finish, __x); } }