示例#1
0
文件: _vector.c 项目: Arkshine/NS
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);
  }
}
示例#2
0
文件: _vector.c 项目: RenEvo/dead6
void _VECTOR_IMPL<_Tp, _Alloc>::_M_fill_insert(iterator __pos,
                                               size_type __n, const _Tp& __x) {
  if (__n != 0) {
    if (size_type(this->_M_end_of_storage._M_data - this->_M_finish) >= __n) {
      _M_fill_insert_aux(__pos, __n, __x, _Movable());
    } else 
      _M_insert_overflow(__pos, __x, _TrivialCpy(), __n);
  }
}
示例#3
0
void _VectorBase::_M_push_back(const void* __data, size_t __unit_size)
{
    STL_ASSERT((_M_get_finish() >= _M_get_start()) && (_M_get_end_of_storage() >= _M_get_finish()) && (__data != NULL));
    if (__M_finish != __M_end_of_storage)
    {
        VOS_memcpy_s(__M_finish, __unit_size, __data, __unit_size);
        __M_finish = _M_get_finish() + __unit_size;
    }
    else
    {
        _M_insert_overflow(__M_finish, 1, __data, __unit_size);
    }
}
示例#4
0
void _VectorBase::_M_fill_insert(void* __pos, size_t __count, const void* __data, size_t __unit_size)
{
    STL_ASSERT((static_cast<char*>(__pos) >= _M_get_start()) && (static_cast<char*>(__pos) <= _M_get_finish()) 
               && (_M_get_end_of_storage() >= _M_get_finish()) && (__data != NULL));
    if (__count <= 0)
    {
        return;
    }

    if (static_cast<size_t>(_M_get_end_of_storage() - _M_get_finish()) >= (__count * __unit_size))
    {
        _M_fill_insert_aux(__pos, __count, __data, __unit_size);
    }
    else
    {
        _M_insert_overflow(__pos, __count, __data, __unit_size);
    }
}
示例#5
0
__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;
}