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);
}
}
void _VECTOR_IMPL<_Tp, _Alloc>::_M_fill_insert_aux (iterator __pos, size_type __n,
const _Tp& __x, const __false_type& /*_Movable*/) {
//Here self referencing needs to be checked even for non movable types.
if (_M_is_inside(__x)) {
_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 {
this->_M_finish = __uninitialized_fill_n(this->_M_finish, __n - __elems_after, __x, _PODType());
__uninitialized_copy(__pos, __old_finish, this->_M_finish, _TrivialUCpy());
this->_M_finish += __elems_after;
_STLP_STD::fill(__pos, __old_finish, __x);
}
}
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);
}
}
__iterator__
_VECTOR_IMPL<_Tp, _Alloc>::insert(iterator __pos, const _Tp& __x) {
size_type __n = __pos - begin();
if (this->_M_finish != this->_M_end_of_storage._M_data) {
if (__pos == end()) {
_Copy_Construct(this->_M_finish, __x);
++this->_M_finish;
} else {
if (&__x >= this->_M_start && &__x < this->_M_finish) {
_Tp __x_copy = __x;
insert(__pos, __x_copy);
}
else {
_Copy_Construct(this->_M_finish, *(this->_M_finish - 1));
++this->_M_finish;
__copy_backward_ptrs(__pos, this->_M_finish - 2, this->_M_finish - 1, _TrivialAss());
*__pos = __x;
}
}
} else
_M_insert_overflow(__pos, __x, _TrivialCpy(), 1UL);
return begin() + __n;
}
