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: williamr@2: /* NOTE: This is an internal header file, included by other STL headers. williamr@2: * You should not attempt to use it directly. williamr@2: */ williamr@2: williamr@2: #ifndef _STLP_INTERNAL_VECTOR_H williamr@2: #define _STLP_INTERNAL_VECTOR_H williamr@2: williamr@2: williamr@2: williamr@2: # ifndef _STLP_INTERNAL_ALGOBASE_H williamr@2: # include williamr@2: # endif williamr@2: williamr@2: # ifndef _STLP_INTERNAL_ALLOC_H williamr@2: # include williamr@2: # endif williamr@2: williamr@2: # ifndef _STLP_INTERNAL_ITERATOR_H williamr@2: # include williamr@2: # endif williamr@2: williamr@2: # ifndef _STLP_INTERNAL_UNINITIALIZED_H williamr@2: # include williamr@2: # endif williamr@2: williamr@2: # ifndef _STLP_RANGE_ERRORS_H williamr@2: # include 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: // The vector base class serves two purposes. First, its constructor williamr@2: // and destructor allocate (but don't initialize) storage. This makes williamr@2: // exception safety easier. williamr@2: williamr@2: template williamr@2: class _Vector_base { williamr@2: public: williamr@2: typedef _Vector_base<_Tp, _Alloc> _Base; williamr@2: _STLP_FORCE_ALLOCATORS(_Tp, _Alloc) williamr@2: typedef typename _Alloc_traits<_Tp, _Alloc>::allocator_type allocator_type; williamr@2: williamr@2: _Vector_base(const _Alloc& __a) williamr@2: : _M_start(0), _M_finish(0), _M_end_of_storage(__a, 0) { williamr@2: // no push here as not needed williamr@2: } williamr@2: _Vector_base(size_t __n, const _Alloc& __a) williamr@2: : _M_start(0), _M_finish(0), _M_end_of_storage(__a, 0) williamr@2: { williamr@2: _STLP_PUSH_CLEANUP_ITEM(_Base, this) williamr@2: _M_start = _M_end_of_storage.allocate(__n); williamr@2: _M_finish = _M_start; williamr@2: _M_end_of_storage._M_data = _M_start + __n; williamr@2: _STLP_MPWFIX_TRY _STLP_MPWFIX_CATCH williamr@2: } williamr@2: williamr@2: ~_Vector_base() { williamr@2: if (_M_start !=0) williamr@2: _M_end_of_storage.deallocate(_M_start, _M_end_of_storage._M_data - _M_start); williamr@2: } williamr@2: williamr@2: protected: williamr@2: _Tp* _M_start; williamr@2: _Tp* _M_finish; williamr@2: _STLP_alloc_proxy<_Tp*, _Tp, allocator_type> _M_end_of_storage; williamr@2: }; williamr@2: williamr@2: template williamr@2: class vector : public _Vector_base<_Tp, _Alloc> williamr@2: { williamr@2: private: williamr@2: typedef _Vector_base<_Tp, _Alloc> _Base; williamr@2: public: williamr@2: typedef _Tp value_type; williamr@2: typedef value_type* pointer; williamr@2: typedef const value_type* const_pointer; williamr@2: typedef value_type* iterator; williamr@2: typedef const value_type* const_iterator; williamr@2: williamr@2: public: williamr@2: typedef value_type& reference; williamr@2: typedef const value_type& const_reference; williamr@2: typedef size_t size_type; williamr@2: typedef ptrdiff_t difference_type; williamr@2: typedef random_access_iterator_tag _Iterator_category; williamr@2: williamr@2: _STLP_DECLARE_RANDOM_ACCESS_REVERSE_ITERATORS; williamr@2: _STLP_FORCE_ALLOCATORS(_Tp, _Alloc) williamr@2: typedef typename _Vector_base<_Tp, _Alloc>::allocator_type allocator_type; williamr@2: williamr@2: allocator_type get_allocator() const { williamr@2: return _STLP_CONVERT_ALLOCATOR((const allocator_type&)this->_M_end_of_storage, _Tp); williamr@2: } williamr@2: williamr@2: #ifdef _STLP_USE_TRAP_LEAVE williamr@2: public: williamr@2: static void* operator new (size_t __n, TLeave) { return _STLP_StackHelper::_NewLC(__n); } williamr@2: static void* operator new (size_t __n) { return _STLP_StackHelper::_NewLC(__n); } williamr@2: #endif williamr@2: williamr@2: protected: williamr@2: typedef typename __type_traits<_Tp>::has_trivial_assignment_operator _TrivialAss; williamr@2: typedef typename __type_traits<_Tp>::has_trivial_assignment_operator _IsPODType; williamr@2: williamr@2: // handles insertions on overflow williamr@2: void _M_insert_overflow(pointer __position, const _Tp& __x, const __false_type&, williamr@2: size_type __fill_len, bool __atend = false) { williamr@2: const size_type __old_size = size(); williamr@2: const size_type __len = __old_size + (max)(__old_size, __fill_len); williamr@2: williamr@2: _STLP_LEAVE_VOLATILE pointer __new_start = this->_M_end_of_storage.allocate(__len); williamr@2: _STLP_LEAVE_VOLATILE pointer __new_finish = __new_start; williamr@2: _STLP_TRY { williamr@2: __new_finish = __uninitialized_copy(this->_M_start, __position, __new_start, __false_type()); williamr@2: // handle insertion williamr@2: if (__fill_len == 1) { williamr@2: _Construct(__new_finish, __x); williamr@2: ++__new_finish; williamr@2: } else williamr@2: __new_finish = __uninitialized_fill_n(__new_finish, __fill_len, __x, __false_type()); williamr@2: if (!__atend) williamr@2: // copy remainder williamr@2: __new_finish = __uninitialized_copy(__position, this->_M_finish, __new_finish, __false_type()); williamr@2: } williamr@2: _STLP_UNWIND((_Destroy(__new_start,__new_finish), williamr@2: this->_M_end_of_storage.deallocate(__new_start,__len))); williamr@2: _M_clear(); williamr@2: _M_set(__new_start, __new_finish, __new_start + __len); williamr@2: } williamr@2: williamr@2: void _M_insert_overflow(pointer __position, const _Tp& __x, const __true_type&, williamr@2: size_type __fill_len, bool __atend = false) { williamr@2: const size_type __old_size = size(); williamr@2: const size_type __len = __old_size + (max)(__old_size, __fill_len); williamr@2: williamr@2: pointer __new_start = this->_M_end_of_storage.allocate(__len); williamr@2: pointer __new_finish = (pointer)__copy_trivial(this->_M_start, __position, __new_start); williamr@2: // handle insertion williamr@2: __new_finish = fill_n(__new_finish, __fill_len, __x); williamr@2: if (!__atend) williamr@2: // copy remainder williamr@2: __new_finish = (pointer)__copy_trivial(__position, this->_M_finish, __new_finish); williamr@2: _M_clear(); williamr@2: _M_set(__new_start, __new_finish, __new_start + __len); williamr@2: } williamr@2: williamr@2: void _M_range_check(size_type __n) const { williamr@2: if (__n >= size_type(this->_M_finish-this->_M_start)) williamr@2: __stl_throw_out_of_range("vector"); williamr@2: } williamr@2: williamr@2: public: williamr@2: iterator begin() { return this->_M_start; } williamr@2: const_iterator begin() const { return this->_M_start; } williamr@2: iterator end() { return this->_M_finish; } williamr@2: const_iterator end() const { return this->_M_finish; } williamr@2: williamr@2: reverse_iterator rbegin() { return reverse_iterator(end()); } williamr@2: const_reverse_iterator rbegin() const { return const_reverse_iterator(end()); } williamr@2: reverse_iterator rend() { return reverse_iterator(begin()); } williamr@2: const_reverse_iterator rend() const { return const_reverse_iterator(begin()); } williamr@2: williamr@2: size_type size() const { return size_type(this->_M_finish - this->_M_start); } williamr@2: size_type max_size() const { return size_type(-1) / sizeof(_Tp); } williamr@2: size_type capacity() const { return size_type(this->_M_end_of_storage._M_data - this->_M_start); } williamr@2: bool empty() const { return this->_M_start == this->_M_finish; } williamr@2: williamr@2: reference operator[](size_type __n) { return *(begin() + __n); } williamr@2: const_reference operator[](size_type __n) const { return *(begin() + __n); } williamr@2: williamr@2: reference front() { return *begin(); } williamr@2: const_reference front() const { return *begin(); } williamr@2: reference back() { return *(end() - 1); } williamr@2: const_reference back() const { return *(end() - 1); } williamr@2: williamr@2: reference at(size_type __n) { _M_range_check(__n); return (*this)[__n]; } williamr@2: const_reference at(size_type __n) const { _M_range_check(__n); return (*this)[__n]; } williamr@2: williamr@2: //explicit vector(const allocator_type& __a = allocator_type()) : williamr@2: vector(const allocator_type& __a = allocator_type()) : //to useimplicitly constructor taking allocator williamr@2: _Vector_base<_Tp, _Alloc>(__a) { williamr@2: // needed for new() to work correctly williamr@2: _STLP_POP_IF_CHECK williamr@2: } williamr@2: williamr@2: vector(size_type __n, const _Tp& __val, williamr@2: const allocator_type& __a = allocator_type()) williamr@2: : _Vector_base<_Tp, _Alloc>(__n, __a) { williamr@2: this->_M_finish = uninitialized_fill_n(this->_M_start, __n, __val); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: williamr@2: explicit vector(size_type __n) williamr@2: : _Vector_base<_Tp, _Alloc>(__n, allocator_type() ) { williamr@2: # ifdef _STLP_USE_TRAP_LEAVE williamr@2: _Tp __p; williamr@2: _STLP_PUSH_CLEANUP_ITEM(_Tp, &__p) williamr@2: this->_M_finish = uninitialized_fill_n(this->_M_start, __n, __p); williamr@2: // unconditional for __p williamr@2: CleanupStack::Pop(); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: # else williamr@2: this->_M_finish = uninitialized_fill_n(this->_M_start, __n, _Tp()); williamr@2: # endif williamr@2: } williamr@2: williamr@2: vector(const vector<_Tp, _Alloc>& __x) williamr@2: : _Vector_base<_Tp, _Alloc>(__x.size(), __x.get_allocator()) { williamr@2: this->_M_finish = __uninitialized_copy((const_pointer)__x._M_start, williamr@2: (const_pointer)__x._M_finish, this->_M_start, _IsPODType()); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: williamr@2: #if defined (_STLP_MEMBER_TEMPLATES) williamr@2: template williamr@2: void _M_initialize_aux(_Integer __n, _Integer __val, const __true_type&) { williamr@2: this->_M_start = this->_M_end_of_storage.allocate(__n); williamr@2: this->_M_end_of_storage._M_data = this->_M_start + __n; williamr@2: this->_M_finish = uninitialized_fill_n(this->_M_start, __n, __val); williamr@2: } williamr@2: williamr@2: template williamr@2: void _M_initialize_aux(_InputIterator __first, _InputIterator __last, williamr@2: const __false_type&) { williamr@2: _M_range_initialize(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator)); williamr@2: } williamr@2: williamr@2: // Check whether it's an integral type. If so, it's not an iterator. williamr@2: # ifdef _STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS williamr@2: template williamr@2: vector(_InputIterator __first, _InputIterator __last) : williamr@2: _Vector_base<_Tp, _Alloc>(allocator_type()) { williamr@2: typedef typename _Is_integer<_InputIterator>::_Integral _Integral; williamr@2: _STLP_PUSH_CLEANUP_ITEM(_Base, this) williamr@2: _M_initialize_aux(__first, __last, _Integral()); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: # endif williamr@2: template williamr@2: vector(_InputIterator __first, _InputIterator __last, williamr@2: const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL ) : williamr@2: _Vector_base<_Tp, _Alloc>(__a) { williamr@2: typedef typename _Is_integer<_InputIterator>::_Integral _Integral; williamr@2: _STLP_PUSH_CLEANUP_ITEM(_Base, this) williamr@2: _M_initialize_aux(__first, __last, _Integral()); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: williamr@2: #else williamr@2: vector(const _Tp* __first, const _Tp* __last, williamr@2: const allocator_type& __a = allocator_type()) williamr@2: : _Vector_base<_Tp, _Alloc>(__last - __first, __a) { williamr@2: this->_M_finish = __uninitialized_copy(__first, __last, this->_M_start, _IsPODType()); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: ~vector() { _Destroy(this->_M_start, this->_M_finish); } williamr@2: williamr@2: vector<_Tp, _Alloc>& operator=(const vector<_Tp, _Alloc>& __x); williamr@2: williamr@2: void reserve(size_type __n); williamr@2: williamr@2: // assign(), a generalized assignment member function. Two williamr@2: // versions: one that takes a count, and one that takes a range. williamr@2: // The range version is a member template, so we dispatch on whether williamr@2: // or not the type is an integer. williamr@2: williamr@2: void assign(size_type __n, const _Tp& __val) { _M_fill_assign(__n, __val); } williamr@2: void _M_fill_assign(size_type __n, const _Tp& __val); williamr@2: williamr@2: #ifdef _STLP_MEMBER_TEMPLATES williamr@2: template williamr@2: void _M_assign_aux(_ForwardIter __first, _ForwardIter __last, const forward_iterator_tag &) williamr@2: #else williamr@2: void assign(const_iterator __first, const_iterator __last) williamr@2: #endif williamr@2: { williamr@2: size_type __len = distance(__first, __last); williamr@2: williamr@2: if (__len > capacity()) { williamr@2: iterator __tmp = _M_allocate_and_copy(__len, __first, __last); williamr@2: _M_clear(); williamr@2: _M_set(__tmp, __tmp + __len, __tmp + __len); williamr@2: } williamr@2: else if (size() >= __len) { williamr@2: iterator __new_finish = copy(__first, __last, this->_M_start); williamr@2: _Destroy(__new_finish, this->_M_finish); williamr@2: this->_M_finish = __new_finish; williamr@2: } williamr@2: else { williamr@2: # if defined ( _STLP_MEMBER_TEMPLATES ) williamr@2: _ForwardIter __mid = __first; williamr@2: advance(__mid, size()); williamr@2: # else williamr@2: const_iterator __mid = __first + size() ; williamr@2: # endif williamr@2: copy(__first, __mid, this->_M_start); williamr@2: this->_M_finish = __uninitialized_copy(__mid, __last, this->_M_finish, _IsPODType()); williamr@2: } williamr@2: } williamr@2: williamr@2: #ifdef _STLP_MEMBER_TEMPLATES williamr@2: template williamr@2: void _M_assign_aux(_InputIter __first, _InputIter __last, williamr@2: const input_iterator_tag &) { williamr@2: iterator __cur = begin(); williamr@2: for ( ; __first != __last && __cur != end(); ++__cur, ++__first) williamr@2: *__cur = *__first; williamr@2: if (__first == __last) williamr@2: erase(__cur, end()); williamr@2: else williamr@2: insert(end(), __first, __last); williamr@2: } williamr@2: williamr@2: template williamr@2: void _M_assign_dispatch(_Integer __n, _Integer __val, const __true_type&) williamr@2: { assign((size_type) __n, (_Tp) __val); } williamr@2: williamr@2: template williamr@2: void _M_assign_dispatch(_InputIter __first, _InputIter __last, const __false_type&) williamr@2: { _M_assign_aux(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIter)); } williamr@2: williamr@2: template williamr@2: void assign(_InputIterator __first, _InputIterator __last) { williamr@2: typedef typename _Is_integer<_InputIterator>::_Integral _Integral; williamr@2: _M_assign_dispatch(__first, __last, _Integral()); williamr@2: } williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: void push_back(const _Tp& __x) { williamr@2: if (this->_M_finish != this->_M_end_of_storage._M_data) { williamr@2: _Construct(this->_M_finish, __x); williamr@2: ++this->_M_finish; williamr@2: } williamr@2: else williamr@2: _M_insert_overflow(this->_M_finish, __x, _IsPODType(), 1UL, true); williamr@2: } williamr@2: williamr@2: void swap(vector<_Tp, _Alloc>& __x) { williamr@2: _STLP_STD::swap(this->_M_start, __x._M_start); williamr@2: _STLP_STD::swap(this->_M_finish, __x._M_finish); williamr@2: _STLP_STD::swap(this->_M_end_of_storage, __x._M_end_of_storage); williamr@2: } williamr@2: williamr@2: iterator insert(iterator __position, const _Tp& __x) { williamr@2: size_type __n = __position - begin(); williamr@2: if (this->_M_finish != this->_M_end_of_storage._M_data) { williamr@2: if (__position == end()) { williamr@2: _Construct(this->_M_finish, __x); williamr@2: ++this->_M_finish; williamr@2: } else { williamr@2: _Construct(this->_M_finish, *(this->_M_finish - 1)); williamr@2: ++this->_M_finish; williamr@2: _Tp __x_copy = __x; williamr@2: __copy_backward_ptrs(__position, this->_M_finish - 2, this->_M_finish - 1, _TrivialAss()); williamr@2: *__position = __x_copy; williamr@2: } williamr@2: } williamr@2: else williamr@2: _M_insert_overflow(__position, __x, _IsPODType(), 1UL); williamr@2: return begin() + __n; williamr@2: } williamr@2: williamr@2: # ifndef _STLP_NO_ANACHRONISMS williamr@2: void push_back() { push_back(_Tp()); } williamr@2: iterator insert(iterator __position) { return insert(__position, _Tp()); } williamr@2: # endif williamr@2: williamr@2: void _M_fill_insert (iterator __pos, size_type __n, const _Tp& __x); williamr@2: williamr@2: #if defined ( _STLP_MEMBER_TEMPLATES) williamr@2: williamr@2: template williamr@2: void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val, williamr@2: const __true_type&) { williamr@2: _M_fill_insert(__pos, (size_type) __n, (_Tp) __val); williamr@2: } williamr@2: williamr@2: template williamr@2: void _M_insert_dispatch(iterator __pos, williamr@2: _InputIterator __first, _InputIterator __last, williamr@2: const __false_type&) { williamr@2: _M_range_insert(__pos, __first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator)); williamr@2: } williamr@2: williamr@2: // Check whether it's an integral type. If so, it's not an iterator. williamr@2: template williamr@2: void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { williamr@2: typedef typename _Is_integer<_InputIterator>::_Integral _Integral; williamr@2: _M_insert_dispatch(__pos, __first, __last, _Integral()); williamr@2: } williamr@2: williamr@2: template williamr@2: void _M_range_insert(iterator __pos, williamr@2: _InputIterator __first, williamr@2: _InputIterator __last, williamr@2: const input_iterator_tag &) { williamr@2: for ( ; __first != __last; ++__first) { williamr@2: __pos = insert(__pos, *__first); williamr@2: ++__pos; williamr@2: } williamr@2: } williamr@2: williamr@2: template williamr@2: void _M_range_insert(iterator __position, williamr@2: _ForwardIterator __first, williamr@2: _ForwardIterator __last, williamr@2: const forward_iterator_tag &) williamr@2: #else /* _STLP_MEMBER_TEMPLATES */ williamr@2: void insert(iterator __position, williamr@2: const_iterator __first, const_iterator __last) williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: { williamr@2: if (__first != __last) { williamr@2: size_type __n = distance(__first, __last); williamr@2: williamr@2: if (size_type(this->_M_end_of_storage._M_data - this->_M_finish) >= __n) { 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: copy(__first, __last, __position); williamr@2: } williamr@2: else { williamr@2: # if defined ( _STLP_MEMBER_TEMPLATES ) williamr@2: _ForwardIterator __mid = __first; williamr@2: advance(__mid, __elems_after); williamr@2: # else williamr@2: const_pointer __mid = __first + __elems_after; williamr@2: # endif williamr@2: __uninitialized_copy(__mid, __last, this->_M_finish, _IsPODType()); 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: copy(__first, __mid, __position); williamr@2: } /* elems_after */ williamr@2: } williamr@2: else { williamr@2: const size_type __old_size = size(); williamr@2: const size_type __len = __old_size + (max)(__old_size, __n); williamr@2: _STLP_LEAVE_VOLATILE pointer __new_start = this->_M_end_of_storage.allocate(__len); williamr@2: _STLP_LEAVE_VOLATILE pointer __new_finish = __new_start; williamr@2: _STLP_TRY { williamr@2: __new_finish = __uninitialized_copy(this->_M_start, __position, __new_start, _IsPODType()); williamr@2: __new_finish = __uninitialized_copy(__first, __last, __new_finish, _IsPODType()); williamr@2: __new_finish = __uninitialized_copy(__position, this->_M_finish, __new_finish, _IsPODType()); williamr@2: } williamr@2: _STLP_UNWIND((_Destroy(__new_start,__new_finish), williamr@2: this->_M_end_of_storage.deallocate(__new_start,__len))); williamr@2: _M_clear(); williamr@2: _M_set(__new_start, __new_finish, __new_start + __len); williamr@2: } williamr@2: } williamr@2: } williamr@2: void insert (iterator __pos, size_type __n, const _Tp& __x) williamr@2: { _M_fill_insert(__pos, __n, __x); } williamr@2: williamr@2: void pop_back() { williamr@2: --this->_M_finish; williamr@2: _Destroy(this->_M_finish); williamr@2: } williamr@2: iterator erase(iterator __position) { williamr@2: if (__position + 1 != end()) williamr@2: __copy_ptrs(__position + 1, this->_M_finish, __position, _TrivialAss()); williamr@2: --this->_M_finish; williamr@2: _Destroy(this->_M_finish); williamr@2: return __position; williamr@2: } williamr@2: iterator erase(iterator __first, iterator __last) { williamr@2: pointer __i = __copy_ptrs(__last, this->_M_finish, __first, _TrivialAss()); williamr@2: _Destroy(__i, this->_M_finish); williamr@2: this->_M_finish = __i; williamr@2: return __first; williamr@2: } williamr@2: williamr@2: void resize(size_type __new_size, _Tp __x) { williamr@2: if (__new_size < size()) williamr@2: erase(begin() + __new_size, end()); williamr@2: else williamr@2: insert(end(), __new_size - size(), __x); williamr@2: } williamr@2: williamr@2: void resize(size_type __new_size) { williamr@2: resize(__new_size, _Tp()); williamr@2: } williamr@2: williamr@2: void clear() { williamr@2: erase(begin(), end()); williamr@2: } williamr@2: williamr@2: protected: williamr@2: williamr@2: void _M_clear() { williamr@2: // if (this->_M_start) { williamr@2: _Destroy(this->_M_start, this->_M_finish); williamr@2: this->_M_end_of_storage.deallocate(this->_M_start, this->_M_end_of_storage._M_data - this->_M_start); williamr@2: // } williamr@2: } williamr@2: williamr@2: void _M_set(pointer __s, pointer __f, pointer __e) { williamr@2: this->_M_start = __s; williamr@2: this->_M_finish = __f; williamr@2: this->_M_end_of_storage._M_data = __e; williamr@2: } williamr@2: williamr@2: #ifdef _STLP_MEMBER_TEMPLATES williamr@2: template williamr@2: pointer _M_allocate_and_copy(size_type __n, _ForwardIterator __first, williamr@2: _ForwardIterator __last) williamr@2: #else /* _STLP_MEMBER_TEMPLATES */ williamr@2: pointer _M_allocate_and_copy(size_type __n, const_pointer __first, williamr@2: const_pointer __last) williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: { williamr@2: _STLP_LEAVE_VOLATILE pointer __result = this->_M_end_of_storage.allocate(__n); williamr@2: _STLP_TRY { williamr@2: #if (!defined(__MRC__)) //*TY 12/17/2000 - added workaround for MrCpp. it confuses on nested try/catch block williamr@2: __uninitialized_copy(__first, __last, __result, _IsPODType()); williamr@2: #else williamr@2: uninitialized_copy(__first, __last, __result); williamr@2: #endif williamr@2: // return __result; williamr@2: } williamr@2: _STLP_UNWIND(this->_M_end_of_storage.deallocate(__result, __n)); williamr@2: return __result; williamr@2: } williamr@2: williamr@2: williamr@2: #ifdef _STLP_MEMBER_TEMPLATES williamr@2: template williamr@2: void _M_range_initialize(_InputIterator __first, williamr@2: _InputIterator __last, const input_iterator_tag &) { williamr@2: for ( ; __first != __last; ++__first) williamr@2: push_back(*__first); williamr@2: } williamr@2: // This function is only called by the constructor. williamr@2: template williamr@2: void _M_range_initialize(_ForwardIterator __first, williamr@2: _ForwardIterator __last, const forward_iterator_tag &) { williamr@2: size_type __n = distance(__first, __last); williamr@2: this->_M_start = this->_M_end_of_storage.allocate(__n); williamr@2: this->_M_end_of_storage._M_data = this->_M_start + __n; williamr@2: this->_M_finish = __uninitialized_copy(__first, __last, this->_M_start, _IsPODType()); williamr@2: } williamr@2: williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: }; williamr@2: williamr@2: # define _STLP_TEMPLATE_CONTAINER vector<_Tp, _Alloc> williamr@2: # define _STLP_TEMPLATE_HEADER template williamr@2: # include williamr@2: # undef _STLP_TEMPLATE_CONTAINER williamr@2: # undef _STLP_TEMPLATE_HEADER williamr@2: williamr@2: # if defined (_STLP_USE_TEMPLATE_EXPORT) williamr@2: _STLP_EXPORT_TEMPLATE_CLASS allocator; williamr@2: _STLP_EXPORT_TEMPLATE_CLASS _STLP_alloc_proxy >; williamr@2: _STLP_EXPORT_TEMPLATE_CLASS _Vector_base >; williamr@2: _STLP_EXPORT_TEMPLATE_CLASS vector >; williamr@2: # endif williamr@2: williamr@2: # undef vector williamr@2: # undef __vector__ williamr@2: # define __vector__ __WORKAROUND_RENAME(vector) williamr@2: williamr@2: _STLP_END_NAMESPACE williamr@2: williamr@2: # if !defined (_STLP_LINK_TIME_INSTANTIATION) williamr@2: # include williamr@2: # endif williamr@2: williamr@2: #ifndef _STLP_INTERNAL_BVECTOR_H williamr@2: # include williamr@2: #endif williamr@2: williamr@2: # if defined (_STLP_DEBUG) williamr@2: # include williamr@2: # endif williamr@2: williamr@2: # if defined (_STLP_USE_WRAPPER_FOR_ALLOC_PARAM) williamr@2: # include williamr@2: # endif williamr@2: williamr@2: #endif /* _STLP_VECTOR_H */ williamr@2: williamr@2: // Local Variables: williamr@2: // mode:C++ williamr@2: // End: williamr@2: