williamr@2: /* williamr@2: * williamr@2: * williamr@2: * Copyright (c) 1994 williamr@2: * Hewlett-Packard Company williamr@2: * williamr@2: * Copyright (c) 1996,1997 williamr@2: * Silicon Graphics Computer Systems, Inc. williamr@2: * williamr@2: * Copyright (c) 1997 williamr@2: * Moscow Center for SPARC Technology williamr@2: * williamr@2: * Copyright (c) 1999 williamr@2: * Boris Fomitchev williamr@2: * williamr@2: * This material is provided "as is", with absolutely no warranty expressed williamr@2: * or implied. Any use is at your own risk. williamr@2: * williamr@2: * Permission to use or copy this software for any purpose is hereby granted williamr@2: * without fee, provided the above notices are retained on all copies. williamr@2: * Permission to modify the code and to distribute modified code is granted, williamr@2: * provided the above notices are retained, and a notice that the code was williamr@2: * modified is included with the above copyright notice. williamr@2: * williamr@2: */ williamr@2: #ifndef _STLP_VECTOR_C williamr@2: #define _STLP_VECTOR_C williamr@2: williamr@2: # if !defined (_STLP_INTERNAL_VECTOR_H) williamr@2: # include williamr@2: # endif williamr@2: williamr@2: # if defined ( _STLP_NESTED_TYPE_PARAM_BUG ) williamr@2: # define iterator _Tp* williamr@2: # define size_type size_t williamr@2: # endif williamr@2: williamr@2: # undef vector williamr@2: # define vector __WORKAROUND_DBG_RENAME(vector) williamr@2: williamr@2: _STLP_BEGIN_NAMESPACE williamr@2: williamr@2: template williamr@2: void williamr@2: __vector__<_Tp, _Alloc>::reserve(size_type __n) { williamr@2: if (capacity() < __n) { williamr@2: const size_type __old_size = size(); williamr@2: pointer __tmp; williamr@2: if (this->_M_start) { williamr@2: __tmp = _M_allocate_and_copy(__n, this->_M_start, this->_M_finish); williamr@2: _M_clear(); williamr@2: } else { williamr@2: __tmp = this->_M_end_of_storage.allocate(__n); williamr@2: } williamr@2: _M_set(__tmp, __tmp + __old_size, __tmp + __n); williamr@2: } williamr@2: } williamr@2: williamr@2: template williamr@2: void williamr@2: __vector__<_Tp, _Alloc>::_M_fill_insert( williamr@2: iterator __position, williamr@2: size_type __n, const _Tp& __x) { williamr@2: if (__n != 0) { williamr@2: if (size_type(this->_M_end_of_storage._M_data - this->_M_finish) >= __n) { williamr@2: _Tp __x_copy = __x; williamr@2: const size_type __elems_after = this->_M_finish - __position; williamr@2: pointer __old_finish = this->_M_finish; williamr@2: if (__elems_after > __n) { williamr@2: __uninitialized_copy(this->_M_finish - __n, this->_M_finish, this->_M_finish, _IsPODType()); williamr@2: this->_M_finish += __n; williamr@2: __copy_backward_ptrs(__position, __old_finish - __n, __old_finish, _TrivialAss()); williamr@2: _STLP_STD::fill(__position, __position + __n, __x_copy); williamr@2: } williamr@2: else { williamr@2: uninitialized_fill_n(this->_M_finish, __n - __elems_after, __x_copy); williamr@2: this->_M_finish += __n - __elems_after; williamr@2: __uninitialized_copy(__position, __old_finish, this->_M_finish, _IsPODType()); williamr@2: this->_M_finish += __elems_after; williamr@2: _STLP_STD::fill(__position, __old_finish, __x_copy); williamr@2: } williamr@2: } williamr@2: else williamr@2: _M_insert_overflow(__position, __x, _IsPODType(), __n); williamr@2: } williamr@2: } williamr@2: williamr@2: template williamr@2: __vector__<_Tp,_Alloc>& williamr@2: __vector__<_Tp,_Alloc>::operator=(const __vector__<_Tp, _Alloc>& __x) williamr@2: { williamr@2: if (&__x != this) { williamr@2: const size_type __xlen = __x.size(); williamr@2: if (__xlen > capacity()) { williamr@2: pointer __tmp = _M_allocate_and_copy(__xlen, (const_pointer)__x._M_start+0, (const_pointer)__x._M_finish+0); williamr@2: _M_clear(); williamr@2: this->_M_start = __tmp; williamr@2: this->_M_end_of_storage._M_data = this->_M_start + __xlen; williamr@2: } williamr@2: else if (size() >= __xlen) { williamr@2: pointer __i = __copy_ptrs((const_pointer)__x._M_start+0, (const_pointer)__x._M_finish+0, (pointer)this->_M_start, _TrivialAss()); williamr@2: _STLP_STD::_Destroy(__i, this->_M_finish); williamr@2: } williamr@2: else { williamr@2: __copy_ptrs((const_pointer)__x._M_start, (const_pointer)__x._M_start + size(), (pointer)this->_M_start, _TrivialAss()); williamr@2: __uninitialized_copy((const_pointer)__x._M_start + size(), (const_pointer)__x._M_finish+0, this->_M_finish, _IsPODType()); williamr@2: } williamr@2: this->_M_finish = this->_M_start + __xlen; williamr@2: } williamr@2: return *this; williamr@2: } williamr@2: williamr@2: template williamr@2: void __vector__<_Tp, _Alloc>::_M_fill_assign(size_t __n, const _Tp& __val) { williamr@2: if (__n > capacity()) { williamr@2: __vector__<_Tp, _Alloc> __tmp(__n, __val, get_allocator()); williamr@2: __tmp.swap(*this); williamr@2: } williamr@2: else if (__n > size()) { williamr@2: fill(begin(), end(), __val); williamr@2: this->_M_finish = _STLP_STD::uninitialized_fill_n(this->_M_finish, __n - size(), __val); williamr@2: } williamr@2: else williamr@2: erase(_STLP_STD::fill_n(begin(), __n, __val), end()); williamr@2: } williamr@2: williamr@2: _STLP_END_NAMESPACE williamr@2: williamr@2: # undef size_type williamr@2: # undef iterator williamr@2: # undef vector williamr@2: williamr@2: #endif /* _STLP_VECTOR_C */ williamr@2: williamr@2: // Local Variables: williamr@2: // mode:C++ williamr@2: // End: