williamr@4: /*
williamr@4:  *
williamr@4:  * Copyright (c) 1994
williamr@4:  * Hewlett-Packard Company
williamr@4:  *
williamr@4:  * Copyright (c) 1996,1997
williamr@4:  * Silicon Graphics Computer Systems, Inc.
williamr@4:  *
williamr@4:  * Copyright (c) 1997
williamr@4:  * Moscow Center for SPARC Technology
williamr@4:  *
williamr@4:  * Copyright (c) 1999
williamr@4:  * Boris Fomitchev
williamr@4:  *
williamr@4:  * This material is provided "as is", with absolutely no warranty expressed
williamr@4:  * or implied. Any use is at your own risk.
williamr@4:  *
williamr@4:  * Permission to use or copy this software for any purpose is hereby granted
williamr@4:  * without fee, provided the above notices are retained on all copies.
williamr@4:  * Permission to modify the code and to distribute modified code is granted,
williamr@4:  * provided the above notices are retained, and a notice that the code was
williamr@4:  * modified is included with the above copyright notice.
williamr@4:  *
williamr@4:  */
williamr@4: 
williamr@4: /* NOTE: This is an internal header file, included by other STL headers.
williamr@4:  *   You should not attempt to use it directly.
williamr@4:  */
williamr@4: 
williamr@4: #ifndef _STLP_INTERNAL_VECTOR_H
williamr@4: #define _STLP_INTERNAL_VECTOR_H
williamr@4: 
williamr@4: #ifndef _STLP_INTERNAL_ALGOBASE_H
williamr@4: #  include <stl/_algobase.h>
williamr@4: #endif
williamr@4: 
williamr@4: #ifndef _STLP_INTERNAL_ALLOC_H
williamr@4: #  include <stl/_alloc.h>
williamr@4: #endif
williamr@4: 
williamr@4: #ifndef _STLP_INTERNAL_ITERATOR_H
williamr@4: #  include <stl/_iterator.h>
williamr@4: #endif
williamr@4: 
williamr@4: #ifndef _STLP_INTERNAL_UNINITIALIZED_H
williamr@4: #  include <stl/_uninitialized.h>
williamr@4: #endif
williamr@4: 
williamr@4: _STLP_BEGIN_NAMESPACE
williamr@4: 
williamr@4: // The vector base class serves one purpose, its constructor and
williamr@4: // destructor allocate (but don't initialize) storage.  This makes
williamr@4: // exception safety easier.
williamr@4: 
williamr@4: _STLP_MOVE_TO_PRIV_NAMESPACE
williamr@4: 
williamr@4: template <class _Tp, class _Alloc>
williamr@4: class _Vector_base {
williamr@4: public:
williamr@4:   typedef _Vector_base<_Tp, _Alloc> _Self;
williamr@4:   _STLP_FORCE_ALLOCATORS(_Tp, _Alloc)
williamr@4:   typedef typename _Alloc_traits<_Tp, _Alloc>::allocator_type allocator_type;
williamr@4:   typedef _Tp* pointer;
williamr@4:   typedef _STLP_alloc_proxy<pointer, _Tp, allocator_type> _AllocProxy;
williamr@4: 
williamr@4:   _Vector_base(const _Alloc& __a)
williamr@4:     : _M_start(0), _M_finish(0), _M_end_of_storage(__a, 0) {}
williamr@4: 
williamr@4:   _Vector_base(size_t __n, const _Alloc& __a)
williamr@4:     : _M_start(0), _M_finish(0), _M_end_of_storage(__a, 0) {
williamr@4:     _M_start = _M_end_of_storage.allocate(__n, __n);
williamr@4:     _M_finish = _M_start;
williamr@4:     _M_end_of_storage._M_data = _M_start + __n;
williamr@4:     _STLP_MPWFIX_TRY _STLP_MPWFIX_CATCH
williamr@4:   }
williamr@4: 
williamr@4:   _Vector_base(__move_source<_Self> src)
williamr@4:     : _M_start(src.get()._M_start), _M_finish(src.get()._M_finish),
williamr@4:       _M_end_of_storage(__move_source<_AllocProxy>(src.get()._M_end_of_storage)) {
williamr@4:     //Set the source as empty:
williamr@4:     src.get()._M_finish = src.get()._M_end_of_storage._M_data = src.get()._M_start = 0;
williamr@4:   }
williamr@4: 
williamr@4:   ~_Vector_base() {
williamr@4:     if (_M_start != _STLP_DEFAULT_CONSTRUCTED(pointer))
williamr@4:       _M_end_of_storage.deallocate(_M_start, _M_end_of_storage._M_data - _M_start);
williamr@4:   }
williamr@4: 
williamr@4: protected:
williamr@4:   void _STLP_FUNCTION_THROWS _M_throw_length_error() const;
williamr@4:   void _STLP_FUNCTION_THROWS _M_throw_out_of_range() const;
williamr@4: 
williamr@4:   pointer _M_start;
williamr@4:   pointer _M_finish;
williamr@4:   _AllocProxy _M_end_of_storage;
williamr@4: };
williamr@4: 
williamr@4: #if defined (_STLP_USE_PTR_SPECIALIZATIONS)
williamr@4: #  define vector _STLP_PTR_IMPL_NAME(vector)
williamr@4: #elif defined (_STLP_DEBUG)
williamr@4: #  define vector _STLP_NON_DBG_NAME(vector)
williamr@4: #else
williamr@4: _STLP_MOVE_TO_STD_NAMESPACE
williamr@4: #endif
williamr@4: 
williamr@4: template <class _Tp, _STLP_DEFAULT_ALLOCATOR_SELECT(_Tp) >
williamr@4: class vector : protected _STLP_PRIV _Vector_base<_Tp, _Alloc>
williamr@4: #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (vector)
williamr@4:              , public __stlport_class<vector<_Tp, _Alloc> >
williamr@4: #endif
williamr@4: {
williamr@4: private:
williamr@4:   typedef _STLP_PRIV _Vector_base<_Tp, _Alloc> _Base;
williamr@4:   typedef vector<_Tp, _Alloc> _Self;
williamr@4: public:
williamr@4:   _STLP_FORCE_ALLOCATORS(_Tp, _Alloc)
williamr@4:   typedef typename _Base::allocator_type allocator_type;
williamr@4: 
williamr@4:   typedef _Tp value_type;
williamr@4:   typedef value_type* pointer;
williamr@4:   typedef const value_type* const_pointer;
williamr@4:   typedef value_type* iterator;
williamr@4:   typedef const value_type* const_iterator;
williamr@4: 
williamr@4:   typedef value_type& reference;
williamr@4:   typedef const value_type& const_reference;
williamr@4:   typedef size_t size_type;
williamr@4:   typedef ptrdiff_t difference_type;
williamr@4:   typedef random_access_iterator_tag _Iterator_category;
williamr@4: 
williamr@4:   _STLP_DECLARE_RANDOM_ACCESS_REVERSE_ITERATORS;
williamr@4: 
williamr@4:   allocator_type get_allocator() const
williamr@4:   { return _STLP_CONVERT_ALLOCATOR((const allocator_type&)this->_M_end_of_storage, _Tp); }
williamr@4: 
williamr@4: private:
williamr@4:   typedef typename __type_traits<_Tp>::has_trivial_assignment_operator _TrivialCopy;
williamr@4:   typedef typename __type_traits<_Tp>::has_trivial_copy_constructor _TrivialUCopy;
williamr@4: #if !defined (_STLP_NO_MOVE_SEMANTIC)
williamr@4:   typedef typename __move_traits<_Tp>::implemented _Movable;
williamr@4: #else
williamr@4:   typedef __false_type _Movable;
williamr@4: #endif
williamr@4: 
williamr@4:   // handles insertions on overflow
williamr@4:   void _M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __false_type& /*_Movable*/,
williamr@4:                               size_type __fill_len, bool __atend);
williamr@4:   void _M_insert_overflow_aux(pointer __pos, const _Tp& __x, const __true_type& /*_Movable*/,
williamr@4:                               size_type __fill_len, bool __atend) {
williamr@4:     //We need to take care of self referencing here:
williamr@4:     if (_M_is_inside(__x)) {
williamr@4:       value_type __x_copy = __x;
williamr@4:       _M_insert_overflow_aux(__pos, __x_copy, __false_type(), __fill_len, __atend);
williamr@4:       return;
williamr@4:     }
williamr@4:     _M_insert_overflow_aux(__pos, __x, __false_type(), __fill_len, __atend);
williamr@4:   }
williamr@4: 
williamr@4:   void _M_insert_overflow(pointer __pos, const _Tp& __x, const __false_type& /*_TrivialCopy*/,
williamr@4:                           size_type __fill_len, bool __atend = false)
williamr@4:   { _M_insert_overflow_aux(__pos, __x, _Movable(), __fill_len, __atend); }
williamr@4:   void _M_insert_overflow(pointer __pos, const _Tp& __x, const __true_type& /*_TrivialCopy*/,
williamr@4:                           size_type __fill_len, bool __atend = false);
williamr@4:   void _M_range_check(size_type __n) const {
williamr@4:     if (__n >= size_type(this->_M_finish - this->_M_start))
williamr@4:       this->_M_throw_out_of_range();
williamr@4:   }
williamr@4: 
williamr@4: public:
williamr@4:   iterator begin()             { return this->_M_start; }
williamr@4:   const_iterator begin() const { return this->_M_start; }
williamr@4:   iterator end()               { return this->_M_finish; }
williamr@4:   const_iterator end() const   { return this->_M_finish; }
williamr@4: 
williamr@4:   reverse_iterator rbegin()              { return reverse_iterator(end()); }
williamr@4:   const_reverse_iterator rbegin() const  { return const_reverse_iterator(end()); }
williamr@4:   reverse_iterator rend()                { return reverse_iterator(begin()); }
williamr@4:   const_reverse_iterator rend() const    { return const_reverse_iterator(begin()); }
williamr@4: 
williamr@4:   size_type size() const        { return size_type(this->_M_finish - this->_M_start); }
williamr@4:   size_type max_size() const {
williamr@4:     size_type __vector_max_size = size_type(-1) / sizeof(_Tp);
williamr@4:     typename allocator_type::size_type __alloc_max_size = this->_M_end_of_storage.max_size();
williamr@4:     return (__alloc_max_size < __vector_max_size)?__alloc_max_size:__vector_max_size;
williamr@4:   }
williamr@4: 
williamr@4:   size_type capacity() const    { return size_type(this->_M_end_of_storage._M_data - this->_M_start); }
williamr@4:   bool empty() const            { return this->_M_start == this->_M_finish; }
williamr@4: 
williamr@4:   reference operator[](size_type __n) { return *(begin() + __n); }
williamr@4:   const_reference operator[](size_type __n) const { return *(begin() + __n); }
williamr@4: 
williamr@4:   reference front()             { return *begin(); }
williamr@4:   const_reference front() const { return *begin(); }
williamr@4:   reference back()              { return *(end() - 1); }
williamr@4:   const_reference back() const  { return *(end() - 1); }
williamr@4: 
williamr@4:   reference at(size_type __n) { _M_range_check(__n); return (*this)[__n]; }
williamr@4:   const_reference at(size_type __n) const { _M_range_check(__n); return (*this)[__n]; }
williamr@4: 
williamr@4: #if !defined (_STLP_DONT_SUP_DFLT_PARAM)
williamr@4:   explicit vector(const allocator_type& __a = allocator_type())
williamr@4: #else
williamr@4:   vector()
williamr@4:     : _STLP_PRIV _Vector_base<_Tp, _Alloc>(allocator_type()) {}
williamr@4:   vector(const allocator_type& __a)
williamr@4: #endif
williamr@4:     : _STLP_PRIV _Vector_base<_Tp, _Alloc>(__a) {}
williamr@4: 
williamr@4: #if !defined (_STLP_DONT_SUP_DFLT_PARAM)
williamr@4: private:
williamr@4:   //We always call _M_initialize with only 1 parameter. Default parameter
williamr@4:   //is used to allow explicit instanciation of vector with types with no
williamr@4:   //default constructor.
williamr@4:   void _M_initialize(size_type __n, const _Tp& __val = _STLP_DEFAULT_CONSTRUCTED(_Tp))
williamr@4:   { this->_M_finish = _STLP_PRIV __uninitialized_init(this->_M_start, __n, __val); }
williamr@4: public:
williamr@4:   explicit vector(size_type __n)
williamr@4:     : _STLP_PRIV _Vector_base<_Tp, _Alloc>(__n, allocator_type())
williamr@4:   { _M_initialize(__n); }
williamr@4:   vector(size_type __n, const _Tp& __val, const allocator_type& __a = allocator_type())
williamr@4: #else
williamr@4:   explicit vector(size_type __n)
williamr@4:     : _STLP_PRIV _Vector_base<_Tp, _Alloc>(__n, allocator_type())
williamr@4:   { this->_M_finish = _STLP_PRIV __uninitialized_init(this->_M_start, __n, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
williamr@4:   vector(size_type __n, const _Tp& __val)
williamr@4:     : _STLP_PRIV _Vector_base<_Tp, _Alloc>(__n, allocator_type())
williamr@4:   { this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_start, __n, __val); }
williamr@4:   vector(size_type __n, const _Tp& __val, const allocator_type& __a)
williamr@4: #endif
williamr@4:     : _STLP_PRIV _Vector_base<_Tp, _Alloc>(__n, __a)
williamr@4:   { this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_start, __n, __val); }
williamr@4: 
williamr@4:   vector(const _Self& __x)
williamr@4:     : _STLP_PRIV _Vector_base<_Tp, _Alloc>(__x.size(), __x.get_allocator())
williamr@4:   { this->_M_finish = _STLP_PRIV __ucopy_ptrs(__x.begin(), __x.end(), this->_M_start, _TrivialUCopy()); }
williamr@4: 
williamr@4:   vector(__move_source<_Self> src)
williamr@4:     : _STLP_PRIV _Vector_base<_Tp, _Alloc>(__move_source<_Base>(src.get()))
williamr@4:   {}
williamr@4: 
williamr@4: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@4: private:
williamr@4:   template <class _Integer>
williamr@4:   void _M_initialize_aux(_Integer __n, _Integer __val,
williamr@4:                          const __true_type& /*_IsIntegral*/) {
williamr@4:     size_type __real_n;
williamr@4:     this->_M_start = this->_M_end_of_storage.allocate(__n, __real_n);
williamr@4:     this->_M_end_of_storage._M_data = this->_M_start + __real_n;
williamr@4:     this->_M_finish = _STLP_PRIV __uninitialized_fill_n(this->_M_start, __n, __val);
williamr@4:   }
williamr@4: 
williamr@4:   template <class _InputIterator>
williamr@4:   void _M_initialize_aux(_InputIterator __first, _InputIterator __last,
williamr@4:                          const __false_type& /*_IsIntegral*/)
williamr@4:   { _M_range_initialize(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator)); }
williamr@4: 
williamr@4: public:
williamr@4:   // Check whether it's an integral type.  If so, it's not an iterator.
williamr@4:   template <class _InputIterator>
williamr@4:   vector(_InputIterator __first, _InputIterator __last,
williamr@4:                const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL )
williamr@4:     : _STLP_PRIV _Vector_base<_Tp, _Alloc>(__a) {
williamr@4:     typedef typename _IsIntegral<_InputIterator>::_Ret _Integral;
williamr@4:     _M_initialize_aux(__first, __last, _Integral());
williamr@4:   }
williamr@4: 
williamr@4: #  if defined (_STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS)
williamr@4:   template <class _InputIterator>
williamr@4:   vector(_InputIterator __first, _InputIterator __last)
williamr@4:     : _STLP_PRIV _Vector_base<_Tp, _Alloc>(allocator_type()) {
williamr@4:     typedef typename _IsIntegral<_InputIterator>::_Ret _Integral;
williamr@4:     _M_initialize_aux(__first, __last, _Integral());
williamr@4:   }
williamr@4: #  endif /* _STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS */
williamr@4: 
williamr@4: #else /* _STLP_MEMBER_TEMPLATES */
williamr@4:   vector(const _Tp* __first, const _Tp* __last,
williamr@4:          const allocator_type& __a = allocator_type())
williamr@4:     : _STLP_PRIV _Vector_base<_Tp, _Alloc>(__last - __first, __a)
williamr@4:   { this->_M_finish = _STLP_PRIV __ucopy_ptrs(__first, __last, this->_M_start, _TrivialUCopy()); }
williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@4: 
williamr@4:   //As the vector container is a back insert oriented container it
williamr@4:   //seems rather logical to destroy elements in reverse order.
williamr@4:   ~vector() { _STLP_STD::_Destroy_Range(rbegin(), rend()); }
williamr@4: 
williamr@4:   _Self& operator=(const _Self& __x);
williamr@4: 
williamr@4:   void reserve(size_type __n);
williamr@4: 
williamr@4:   // assign(), a generalized assignment member function.  Two
williamr@4:   // versions: one that takes a count, and one that takes a range.
williamr@4:   // The range version is a member template, so we dispatch on whether
williamr@4:   // or not the type is an integer.
williamr@4: 
williamr@4:   void assign(size_type __n, const _Tp& __val) { _M_fill_assign(__n, __val); }
williamr@4:   void _M_fill_assign(size_type __n, const _Tp& __val);
williamr@4: 
williamr@4: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@4:   template <class _ForwardIter>
williamr@4:   void _M_assign_aux(_ForwardIter __first, _ForwardIter __last, const forward_iterator_tag &) {
williamr@4: #else
williamr@4:   void assign(const_iterator __first, const_iterator __last) {
williamr@4:     typedef const_iterator _ForwardIter;
williamr@4: #endif
williamr@4:     const size_type __len = distance(__first, __last);
williamr@4:     if (__len > capacity()) {
williamr@4:       size_type __n = __len;
williamr@4:       iterator __tmp = _M_allocate_and_copy(__n, __first, __last);
williamr@4:       _M_clear();
williamr@4:       _M_set(__tmp, __tmp + __len, __tmp + __n);
williamr@4:     }
williamr@4:     else if (size() >= __len) {
williamr@4:       iterator __new_finish = copy(__first, __last, this->_M_start);
williamr@4:       _STLP_STD::_Destroy_Range(__new_finish, this->_M_finish);
williamr@4:       this->_M_finish = __new_finish;
williamr@4:     }
williamr@4:     else {
williamr@4:       _ForwardIter __mid = __first;
williamr@4:       advance(__mid, size());
williamr@4:       copy(__first, __mid, this->_M_start);
williamr@4:       this->_M_finish = uninitialized_copy(__mid, __last, this->_M_finish);
williamr@4:     }
williamr@4:   }
williamr@4: 
williamr@4: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@4:   template <class _InputIter>
williamr@4:   void _M_assign_aux(_InputIter __first, _InputIter __last,
williamr@4:                      const input_iterator_tag &) {
williamr@4:     iterator __cur = begin();
williamr@4:     for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
williamr@4:       *__cur = *__first;
williamr@4:     if (__first == __last)
williamr@4:       erase(__cur, end());
williamr@4:     else
williamr@4:       insert(end(), __first, __last);
williamr@4:   }
williamr@4: 
williamr@4:   template <class _Integer>
williamr@4:   void _M_assign_dispatch(_Integer __n, _Integer __val,
williamr@4:                           const __true_type& /*_IsIntegral*/)
williamr@4:   { _M_fill_assign(__n, __val); }
williamr@4: 
williamr@4:   template <class _InputIter>
williamr@4:   void _M_assign_dispatch(_InputIter __first, _InputIter __last,
williamr@4:                           const __false_type& /*_IsIntegral*/)
williamr@4:   { _M_assign_aux(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIter)); }
williamr@4: 
williamr@4:   template <class _InputIterator>
williamr@4:   void assign(_InputIterator __first, _InputIterator __last) {
williamr@4:     typedef typename _IsIntegral<_InputIterator>::_Ret _Integral;
williamr@4:     _M_assign_dispatch(__first, __last, _Integral());
williamr@4:   }
williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@4: 
williamr@4: #if !defined (_STLP_DONT_SUP_DFLT_PARAM) && !defined (_STLP_NO_ANACHRONISMS)
williamr@4:   void push_back(const _Tp& __x = _STLP_DEFAULT_CONSTRUCTED(_Tp)) {
williamr@4: #else
williamr@4:   void push_back(const _Tp& __x) {
williamr@4: #endif /*!_STLP_DONT_SUP_DFLT_PARAM && !_STLP_NO_ANACHRONISMS*/
williamr@4:     if (this->_M_finish != this->_M_end_of_storage._M_data) {
williamr@4:       _Copy_Construct(this->_M_finish, __x);
williamr@4:       ++this->_M_finish;
williamr@4:     }
williamr@4:     else
williamr@4:       _M_insert_overflow(this->_M_finish, __x, _TrivialCopy(), 1UL, true);
williamr@4:   }
williamr@4: 
williamr@4: #if !defined(_STLP_DONT_SUP_DFLT_PARAM) && !defined(_STLP_NO_ANACHRONISMS)
williamr@4:   iterator insert(iterator __pos, const _Tp& __x = _STLP_DEFAULT_CONSTRUCTED(_Tp));
williamr@4: #else
williamr@4:   iterator insert(iterator __pos, const _Tp& __x);
williamr@4: #endif /*!_STLP_DONT_SUP_DFLT_PARAM && !_STLP_NO_ANACHRONISMS*/
williamr@4: 
williamr@4: #if defined(_STLP_DONT_SUP_DFLT_PARAM) && !defined(_STLP_NO_ANACHRONISMS)
williamr@4:   void push_back() { push_back(_STLP_DEFAULT_CONSTRUCTED(_Tp)); }
williamr@4:   iterator insert(iterator __pos) { return insert(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
williamr@4: #endif /*_STLP_DONT_SUP_DFLT_PARAM && !_STLP_NO_ANACHRONISMS*/
williamr@4: 
williamr@4:   void swap(_Self& __x) {
williamr@4:     _STLP_STD::swap(this->_M_start, __x._M_start);
williamr@4:     _STLP_STD::swap(this->_M_finish, __x._M_finish);
williamr@4:     this->_M_end_of_storage.swap(__x._M_end_of_storage);
williamr@4:   }
williamr@4: 
williamr@4: private:
williamr@4:   void _M_fill_insert_aux (iterator __pos, size_type __n, const _Tp& __x, const __true_type& /*_Movable*/);
williamr@4:   void _M_fill_insert_aux (iterator __pos, size_type __n, const _Tp& __x, const __false_type& /*_Movable*/);
williamr@4:   void _M_fill_insert (iterator __pos, size_type __n, const _Tp& __x);
williamr@4: 
williamr@4:   bool _M_is_inside(const value_type& __x) const {
williamr@4:     return (&__x >= this->_M_start && &__x < this->_M_finish);
williamr@4:   }
williamr@4: 
williamr@4: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@4:   template <class _ForwardIterator>
williamr@4:   void _M_range_insert_realloc(iterator __pos,
williamr@4:                                _ForwardIterator __first, _ForwardIterator __last,
williamr@4: #else
williamr@4:   void _M_range_insert_realloc(iterator __pos,
williamr@4:                                const_iterator __first, const_iterator __last,
williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@4:                                size_type __n) {
williamr@4:     const size_type __old_size = size();
williamr@4:     size_type __len = __old_size + (max)(__old_size, __n);
williamr@4:     pointer __new_start = this->_M_end_of_storage.allocate(__len, __len);
williamr@4:     pointer __new_finish = __new_start;
williamr@4:     _STLP_TRY {
williamr@4:       __new_finish = _STLP_PRIV __uninitialized_move(this->_M_start, __pos, __new_start, _TrivialUCopy(), _Movable());
williamr@4:       __new_finish = uninitialized_copy(__first, __last, __new_finish);
williamr@4:       __new_finish = _STLP_PRIV __uninitialized_move(__pos, this->_M_finish, __new_finish, _TrivialUCopy(), _Movable());
williamr@4:     }
williamr@4:     _STLP_UNWIND((_STLP_STD::_Destroy_Range(__new_start,__new_finish),
williamr@4:                   this->_M_end_of_storage.deallocate(__new_start,__len)))
williamr@4:     _M_clear_after_move();
williamr@4:     _M_set(__new_start, __new_finish, __new_start + __len);
williamr@4:   }
williamr@4: 
williamr@4: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@4:   template <class _ForwardIterator>
williamr@4:   void _M_range_insert_aux(iterator __pos,
williamr@4:                            _ForwardIterator __first, _ForwardIterator __last,
williamr@4: #else
williamr@4:   void _M_range_insert_aux(iterator __pos,
williamr@4:                            const_iterator __first, const_iterator __last,
williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@4:                            size_type __n, const __true_type& /*_Movable*/) {
williamr@4:     iterator __src = this->_M_finish - 1;
williamr@4:     iterator __dst = __src + __n;
williamr@4:     for (; __src >= __pos; --__dst, --__src) {
williamr@4:       _STLP_STD::_Move_Construct(__dst, *__src);
williamr@4:       _STLP_STD::_Destroy_Moved(__src);
williamr@4:     }
williamr@4:     uninitialized_copy(__first, __last, __pos);
williamr@4:     this->_M_finish += __n;
williamr@4:   }
williamr@4: 
williamr@4: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@4:   template <class _ForwardIterator>
williamr@4:   void _M_range_insert_aux(iterator __pos,
williamr@4:                            _ForwardIterator __first, _ForwardIterator __last,
williamr@4: #else
williamr@4:   void _M_range_insert_aux(iterator __pos,
williamr@4:                            const_iterator __first, const_iterator __last,
williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@4:                            size_type __n, const __false_type& /*_Movable*/) {
williamr@4:     const size_type __elems_after = this->_M_finish - __pos;
williamr@4:     pointer __old_finish = this->_M_finish;
williamr@4:     if (__elems_after > __n) {
williamr@4:       _STLP_PRIV __ucopy_ptrs(this->_M_finish - __n, this->_M_finish, this->_M_finish, _TrivialUCopy());
williamr@4:       this->_M_finish += __n;
williamr@4:       _STLP_PRIV __copy_backward_ptrs(__pos, __old_finish - __n, __old_finish, _TrivialCopy());
williamr@4:       copy(__first, __last, __pos);
williamr@4:     }
williamr@4:     else {
williamr@4: #if defined ( _STLP_MEMBER_TEMPLATES )
williamr@4:       _ForwardIterator __mid = __first;
williamr@4:       advance(__mid, __elems_after);
williamr@4: #else
williamr@4:       const_pointer __mid = __first + __elems_after;
williamr@4: #endif
williamr@4:       uninitialized_copy(__mid, __last, this->_M_finish);
williamr@4:       this->_M_finish += __n - __elems_after;
williamr@4:       _STLP_PRIV __ucopy_ptrs(__pos, __old_finish, this->_M_finish, _TrivialUCopy());
williamr@4:       this->_M_finish += __elems_after;
williamr@4:       copy(__first, __mid, __pos);
williamr@4:     } /* elems_after */
williamr@4:   }
williamr@4: 
williamr@4: 
williamr@4: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@4:   template <class _Integer>
williamr@4:   void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,
williamr@4:                           const __true_type&)
williamr@4:   { _M_fill_insert(__pos, (size_type) __n, (_Tp) __val); }
williamr@4: 
williamr@4:   template <class _InputIterator>
williamr@4:   void _M_insert_dispatch(iterator __pos,
williamr@4:                           _InputIterator __first, _InputIterator __last,
williamr@4:                           const __false_type&)
williamr@4:   { _M_range_insert(__pos, __first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator)); }
williamr@4: 
williamr@4: public:
williamr@4:   // Check whether it's an integral type.  If so, it's not an iterator.
williamr@4:   template <class _InputIterator>
williamr@4:   void insert(iterator __pos, _InputIterator __first, _InputIterator __last) {
williamr@4:     typedef typename _IsIntegral<_InputIterator>::_Ret _Integral;
williamr@4:     _M_insert_dispatch(__pos, __first, __last, _Integral());
williamr@4:   }
williamr@4: 
williamr@4: private:
williamr@4:   template <class _InputIterator>
williamr@4:   void _M_range_insert(iterator __pos,
williamr@4:                        _InputIterator __first, _InputIterator __last,
williamr@4:                        const input_iterator_tag &) {
williamr@4:     for ( ; __first != __last; ++__first) {
williamr@4:       __pos = insert(__pos, *__first);
williamr@4:       ++__pos;
williamr@4:     }
williamr@4:   }
williamr@4: 
williamr@4:   template <class _ForwardIterator>
williamr@4:   void _M_range_insert(iterator __pos,
williamr@4:                        _ForwardIterator __first, _ForwardIterator __last,
williamr@4:                        const forward_iterator_tag &) {
williamr@4: #else /* _STLP_MEMBER_TEMPLATES */
williamr@4: public:
williamr@4:   void insert(iterator __pos,
williamr@4:               const_iterator __first, const_iterator __last) {
williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@4:     /* This method do not check self referencing.
williamr@4:      * Standard forbids it, checked by the debug mode.
williamr@4:      */
williamr@4:     if (__first != __last) {
williamr@4:       size_type __n = distance(__first, __last);
williamr@4: 
williamr@4:       if (size_type(this->_M_end_of_storage._M_data - this->_M_finish) >= __n) {
williamr@4:         _M_range_insert_aux(__pos, __first, __last, __n, _Movable());
williamr@4:       }
williamr@4:       else {
williamr@4:         _M_range_insert_realloc(__pos, __first, __last, __n);
williamr@4:       }
williamr@4:     }
williamr@4:   }
williamr@4: 
williamr@4: public:
williamr@4:   void insert (iterator __pos, size_type __n, const _Tp& __x)
williamr@4:   { _M_fill_insert(__pos, __n, __x); }
williamr@4: 
williamr@4:   void pop_back() {
williamr@4:     --this->_M_finish;
williamr@4:     _STLP_STD::_Destroy(this->_M_finish);
williamr@4:   }
williamr@4: 
williamr@4: private:
williamr@4:   iterator _M_erase(iterator __pos, const __true_type& /*_Movable*/) {
williamr@4:     _STLP_STD::_Destroy(__pos);
williamr@4:     iterator __dst = __pos, __src = __dst + 1;
williamr@4:     iterator __end = end();
williamr@4:     for (; __src != __end; ++__dst, ++__src) {
williamr@4:       _STLP_STD::_Move_Construct(__dst, *__src);
williamr@4:       _STLP_STD::_Destroy_Moved(__src);
williamr@4:     }
williamr@4:     this->_M_finish = __dst;
williamr@4:     return __pos;
williamr@4:   }
williamr@4:   iterator _M_erase(iterator __pos, const __false_type& /*_Movable*/) {
williamr@4:     if (__pos + 1 != end())
williamr@4:       _STLP_PRIV __copy_ptrs(__pos + 1, this->_M_finish, __pos, _TrivialCopy());
williamr@4:     --this->_M_finish;
williamr@4:     _STLP_STD::_Destroy(this->_M_finish);
williamr@4:     return __pos;
williamr@4:   }
williamr@4:   iterator _M_erase(iterator __first, iterator __last, const __true_type& /*_Movable*/) {
williamr@4:     iterator __dst = __first, __src = __last;
williamr@4:     iterator __end = end();
williamr@4:     for (; __dst != __last && __src != __end; ++__dst, ++__src) {
williamr@4:       _STLP_STD::_Destroy(__dst);
williamr@4:       _STLP_STD::_Move_Construct(__dst, *__src);
williamr@4:     }
williamr@4:     if (__dst != __last) {
williamr@4:       //There is more elements to erase than element to move:
williamr@4:       _STLP_STD::_Destroy_Range(__dst, __last);
williamr@4:       _STLP_STD::_Destroy_Moved_Range(__last, __end);
williamr@4:     }
williamr@4:     else {
williamr@4:       //There is more element to move than element to erase:
williamr@4:       for (; __src != __end; ++__dst, ++__src) {
williamr@4:         _STLP_STD::_Destroy_Moved(__dst);
williamr@4:         _STLP_STD::_Move_Construct(__dst, *__src);
williamr@4:       }
williamr@4:       _STLP_STD::_Destroy_Moved_Range(__dst, __end);
williamr@4:     }
williamr@4:     this->_M_finish = __dst;
williamr@4:     return __first;
williamr@4:   }
williamr@4:   iterator _M_erase(iterator __first, iterator __last, const __false_type& /*_Movable*/) {
williamr@4:     pointer __i = _STLP_PRIV __copy_ptrs(__last, this->_M_finish, __first, _TrivialCopy());
williamr@4:     _STLP_STD::_Destroy_Range(__i, this->_M_finish);
williamr@4:     this->_M_finish = __i;
williamr@4:     return __first;
williamr@4:   }
williamr@4: 
williamr@4: public:
williamr@4:   iterator erase(iterator __pos) {
williamr@4:     return _M_erase(__pos, _Movable());
williamr@4:   }
williamr@4:   iterator erase(iterator __first, iterator __last) {
williamr@4:     if (__first == __last)
williamr@4:       return __first;
williamr@4:     return _M_erase(__first, __last, _Movable());
williamr@4:   }
williamr@4: 
williamr@4: #if !defined (_STLP_DONT_SUP_DFLT_PARAM)
williamr@4:   void resize(size_type __new_size, const _Tp& __x = _STLP_DEFAULT_CONSTRUCTED(_Tp)) {
williamr@4: #else
williamr@4:   void resize(size_type __new_size, const _Tp& __x) {
williamr@4: #endif /*_STLP_DONT_SUP_DFLT_PARAM*/
williamr@4:     if (__new_size < size())
williamr@4:       erase(begin() + __new_size, end());
williamr@4:     else
williamr@4:       insert(end(), __new_size - size(), __x);
williamr@4:   }
williamr@4: 
williamr@4: #if defined (_STLP_DONT_SUP_DFLT_PARAM)
williamr@4:   void resize(size_type __new_size) { resize(__new_size, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }
williamr@4: #endif /*_STLP_DONT_SUP_DFLT_PARAM*/
williamr@4: 
williamr@4:   void clear() {
williamr@4:     erase(begin(), end());
williamr@4:   }
williamr@4: 
williamr@4: private:
williamr@4:   void _M_clear() {
williamr@4:     _STLP_STD::_Destroy_Range(rbegin(), rend());
williamr@4:     this->_M_end_of_storage.deallocate(this->_M_start, this->_M_end_of_storage._M_data - this->_M_start);
williamr@4:   }
williamr@4: 
williamr@4:   void _M_clear_after_move() {
williamr@4:     _STLP_STD::_Destroy_Moved_Range(rbegin(), rend());
williamr@4:     this->_M_end_of_storage.deallocate(this->_M_start, this->_M_end_of_storage._M_data - this->_M_start);
williamr@4:   }
williamr@4: 
williamr@4:   void _M_set(pointer __s, pointer __f, pointer __e) {
williamr@4:     this->_M_start = __s;
williamr@4:     this->_M_finish = __f;
williamr@4:     this->_M_end_of_storage._M_data = __e;
williamr@4:   }
williamr@4: 
williamr@4: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@4:   template <class _ForwardIterator>
williamr@4:   pointer _M_allocate_and_copy(size_type& __n,
williamr@4:                                _ForwardIterator __first, _ForwardIterator __last)
williamr@4: #else /* _STLP_MEMBER_TEMPLATES */
williamr@4:   pointer _M_allocate_and_copy(size_type& __n,
williamr@4:                                const_pointer __first, const_pointer __last)
williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@4:   {
williamr@4:     pointer __result = this->_M_end_of_storage.allocate(__n, __n);
williamr@4:     _STLP_TRY {
williamr@4:       uninitialized_copy(__first, __last, __result);
williamr@4:       return __result;
williamr@4:     }
williamr@4:     _STLP_UNWIND(this->_M_end_of_storage.deallocate(__result, __n))
williamr@4:     _STLP_RET_AFTER_THROW(__result)
williamr@4:   }
williamr@4: 
williamr@4: 
williamr@4: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@4:   template <class _InputIterator>
williamr@4:   void _M_range_initialize(_InputIterator __first, _InputIterator __last,
williamr@4:                            const input_iterator_tag &) {
williamr@4:     for ( ; __first != __last; ++__first)
williamr@4:       push_back(*__first);
williamr@4:   }
williamr@4:   // This function is only called by the constructor.
williamr@4:   template <class _ForwardIterator>
williamr@4:   void _M_range_initialize(_ForwardIterator __first, _ForwardIterator __last,
williamr@4:                            const forward_iterator_tag &) {
williamr@4:     size_type __n = distance(__first, __last);
williamr@4:     this->_M_start = this->_M_end_of_storage.allocate(__n, __n);
williamr@4:     this->_M_end_of_storage._M_data = this->_M_start + __n;
williamr@4:     this->_M_finish = uninitialized_copy(__first, __last, this->_M_start);
williamr@4:   }
williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@4: };
williamr@4: 
williamr@4: #if defined (vector)
williamr@4: #  undef vector
williamr@4: _STLP_MOVE_TO_STD_NAMESPACE
williamr@4: #endif
williamr@4: 
williamr@4: _STLP_END_NAMESPACE
williamr@4: 
williamr@4: #if !defined (_STLP_LINK_TIME_INSTANTIATION)
williamr@4: #  include <stl/_vector.c>
williamr@4: #endif
williamr@4: 
williamr@4: #if defined (_STLP_USE_PTR_SPECIALIZATIONS)
williamr@4: #  include <stl/pointers/_vector.h>
williamr@4: #endif
williamr@4: 
williamr@4: //We define the bool specialization before the debug interfave
williamr@4: //to benefit of the debug version of vector even for the bool
williamr@4: //specialization.
williamr@4: #if !defined (_STLP_NO_BOOL) || !defined (_STLP_NO_EXTENSIONS)
williamr@4: #  if !defined (_STLP_INTERNAL_BVECTOR_H)
williamr@4: #    include <stl/_bvector.h>
williamr@4: #  endif
williamr@4: #endif
williamr@4: 
williamr@4: #if defined (_STLP_DEBUG)
williamr@4: #  include <stl/debug/_vector.h>
williamr@4: #endif
williamr@4: 
williamr@4: _STLP_BEGIN_NAMESPACE
williamr@4: 
williamr@4: #if !defined (_STLP_NO_BOOL) && !defined (_STLP_NO_EXTENSIONS)
williamr@4: // This typedef is non-standard.  It is provided for backward compatibility.
williamr@4: typedef vector<bool, allocator<bool> > bit_vector;
williamr@4: #endif
williamr@4: 
williamr@4: #define _STLP_TEMPLATE_HEADER template <class _Tp, class _Alloc>
williamr@4: #define _STLP_TEMPLATE_CONTAINER vector<_Tp, _Alloc>
williamr@4: #include <stl/_relops_cont.h>
williamr@4: #undef _STLP_TEMPLATE_CONTAINER
williamr@4: #undef _STLP_TEMPLATE_HEADER
williamr@4: 
williamr@4: #if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION)
williamr@4: template <class _Tp, class _Alloc>
williamr@4: struct __move_traits<vector<_Tp, _Alloc> > {
williamr@4:   typedef __stlp_movable implemented;
williamr@4:   typedef typename __move_traits<_Alloc>::complete complete;
williamr@4: #if defined (__BORLANDC__) && (__BORLANDC__ < 0x560)
williamr@4:   // disable incorrect "dependent type qualifier" error
williamr@4:   typedef __false_type _Ret;
williamr@4: #endif
williamr@4: };
williamr@4: 
williamr@4: #  if !defined (_STLP_DEBUG)
williamr@4: template <class _Tp, class _Alloc>
williamr@4: struct _DefaultZeroValue<vector<_Tp, _Alloc> >
williamr@4: { typedef typename __type_traits<_Alloc>::has_trivial_default_constructor _Ret; };
williamr@4: #  endif
williamr@4: 
williamr@4: #endif /* _STLP_CLASS_PARTIAL_SPECIALIZATION */
williamr@4: 
williamr@4: _STLP_END_NAMESPACE
williamr@4: 
williamr@4: #endif /* _STLP_VECTOR_H */
williamr@4: 
williamr@4: // Local Variables:
williamr@4: // mode:C++
williamr@4: // End: