/*

 *

 * Copyright (c) 1994

 * Hewlett-Packard Company

 *

 * Copyright (c) 1996,1997

 * Silicon Graphics Computer Systems, Inc.

 *

 * Copyright (c) 1997

 * Moscow Center for SPARC Technology

 *

 * Copyright (c) 1999 

 * Boris Fomitchev

 *

 * This material is provided "as is", with absolutely no warranty expressed

 * or implied. Any use is at your own risk.

 *

 * Permission to use or copy this software for any purpose is hereby granted 

 * without fee, provided the above notices are retained on all copies.

 * Permission to modify the code and to distribute modified code is granted,

 * provided the above notices are retained, and a notice that the code was

 * modified is included with the above copyright notice.

 *

 */

/* NOTE: This is an internal header file, included by other STL headers.

 *   You should not attempt to use it directly.

 */

#ifndef _STLP_INTERNAL_VECTOR_H

#define _STLP_INTERNAL_VECTOR_H

# ifndef _STLP_INTERNAL_ALGOBASE_H

#  include <stl/_algobase.h>

# endif

# ifndef _STLP_INTERNAL_ALLOC_H

#  include <stl/_alloc.h>

# endif

# ifndef _STLP_INTERNAL_ITERATOR_H

#  include <stl/_iterator.h>

# endif

# ifndef _STLP_INTERNAL_UNINITIALIZED_H

#  include <stl/_uninitialized.h>

# endif

# ifndef _STLP_RANGE_ERRORS_H

#  include <stl/_range_errors.h>

# endif

#  undef  vector

#  define vector __WORKAROUND_DBG_RENAME(vector)

_STLP_BEGIN_NAMESPACE 

// The vector base class serves two purposes.  First, its constructor

// and destructor allocate (but don't initialize) storage.  This makes

// exception safety easier.

template <class _Tp, class _Alloc> 

class _Vector_base {

public:

  typedef _Vector_base<_Tp, _Alloc> _Base;

  _STLP_FORCE_ALLOCATORS(_Tp, _Alloc)

  typedef typename _Alloc_traits<_Tp, _Alloc>::allocator_type allocator_type;

  _Vector_base(const _Alloc& __a)

    : _M_start(0), _M_finish(0), _M_end_of_storage(__a, 0) {

    // no push here as not needed

  }

  _Vector_base(size_t __n, const _Alloc& __a)

    : _M_start(0), _M_finish(0), _M_end_of_storage(__a, 0)

  {

    _STLP_PUSH_CLEANUP_ITEM(_Base, this)

    _M_start = _M_end_of_storage.allocate(__n);

    _M_finish = _M_start;

    _M_end_of_storage._M_data = _M_start + __n;

    _STLP_MPWFIX_TRY _STLP_MPWFIX_CATCH

  }

  ~_Vector_base() { 

    if (_M_start !=0) 

    _M_end_of_storage.deallocate(_M_start, _M_end_of_storage._M_data - _M_start); 

  }

protected:

  _Tp* _M_start;

  _Tp* _M_finish;

  _STLP_alloc_proxy<_Tp*, _Tp, allocator_type> _M_end_of_storage;

};

template <class _Tp, _STLP_DEFAULT_ALLOCATOR_SELECT(_Tp) >

class vector : public _Vector_base<_Tp, _Alloc> 

{

private:

  typedef _Vector_base<_Tp, _Alloc> _Base;

public:

  typedef _Tp value_type;

  typedef value_type* pointer;

  typedef const value_type* const_pointer;

  typedef value_type* iterator;

  typedef const value_type* const_iterator;

public:

  typedef value_type& reference;

  typedef const value_type& const_reference;

  typedef size_t size_type;

  typedef ptrdiff_t difference_type;

  typedef random_access_iterator_tag _Iterator_category;

  _STLP_DECLARE_RANDOM_ACCESS_REVERSE_ITERATORS;

  _STLP_FORCE_ALLOCATORS(_Tp, _Alloc)

  typedef typename _Vector_base<_Tp, _Alloc>::allocator_type allocator_type;

  allocator_type get_allocator() const {

    return _STLP_CONVERT_ALLOCATOR((const allocator_type&)this->_M_end_of_storage, _Tp);

  }

#ifdef _STLP_USE_TRAP_LEAVE

public:

  static void* operator new (size_t __n, TLeave) { return _STLP_StackHelper<bool>::_NewLC(__n); }

  static void* operator new (size_t __n) { return _STLP_StackHelper<bool>::_NewLC(__n); }

#endif

protected:

  typedef typename  __type_traits<_Tp>::has_trivial_assignment_operator _TrivialAss;

  typedef typename  __type_traits<_Tp>::has_trivial_assignment_operator _IsPODType;

  // handles insertions on overflow

  void _M_insert_overflow(pointer __position, const _Tp& __x, const __false_type&, 

			  size_type __fill_len, bool __atend = false) {

    const size_type __old_size = size();

    const size_type __len = __old_size + (max)(__old_size, __fill_len);

    _STLP_LEAVE_VOLATILE pointer __new_start = this->_M_end_of_storage.allocate(__len);

    _STLP_LEAVE_VOLATILE pointer __new_finish = __new_start;

    _STLP_TRY {

      __new_finish = __uninitialized_copy(this->_M_start, __position, __new_start, __false_type());

      // handle insertion

      if (__fill_len == 1) {

        _Construct(__new_finish, __x);

        ++__new_finish;

      } else

        __new_finish = __uninitialized_fill_n(__new_finish, __fill_len, __x, __false_type());

      if (!__atend)

        // copy remainder

        __new_finish = __uninitialized_copy(__position, this->_M_finish, __new_finish, __false_type());

    }

    _STLP_UNWIND((_Destroy(__new_start,__new_finish), 

                  this->_M_end_of_storage.deallocate(__new_start,__len)));

    _M_clear();

    _M_set(__new_start, __new_finish, __new_start + __len);

  }

  void _M_insert_overflow(pointer __position, const _Tp& __x, const __true_type&, 

			  size_type __fill_len, bool __atend = false) {

    const size_type __old_size = size();

    const size_type __len = __old_size + (max)(__old_size, __fill_len);

    pointer __new_start = this->_M_end_of_storage.allocate(__len);

    pointer __new_finish = (pointer)__copy_trivial(this->_M_start, __position, __new_start);

      // handle insertion

    __new_finish = fill_n(__new_finish, __fill_len, __x);

    if (!__atend)

      // copy remainder

      __new_finish = (pointer)__copy_trivial(__position, this->_M_finish, __new_finish);

    _M_clear();

    _M_set(__new_start, __new_finish, __new_start + __len);

  }

  void _M_range_check(size_type __n) const {

    if (__n >= size_type(this->_M_finish-this->_M_start))

      __stl_throw_out_of_range("vector");

  }

public:

  iterator begin()             { return this->_M_start; }

  const_iterator begin() const { return this->_M_start; }

  iterator end()               { return this->_M_finish; }

  const_iterator end() const   { return this->_M_finish; }

  reverse_iterator rbegin()              { return reverse_iterator(end()); }

  const_reverse_iterator rbegin() const  { return const_reverse_iterator(end()); }

  reverse_iterator rend()                { return reverse_iterator(begin()); }

  const_reverse_iterator rend() const    { return const_reverse_iterator(begin()); }

  size_type size() const        { return size_type(this->_M_finish - this->_M_start); }

  size_type max_size() const    { return size_type(-1) / sizeof(_Tp); }

  size_type capacity() const    { return size_type(this->_M_end_of_storage._M_data - this->_M_start); }

  bool empty() const            { return this->_M_start == this->_M_finish; }

  reference operator[](size_type __n) { return *(begin() + __n); }

  const_reference operator[](size_type __n) const { return *(begin() + __n); }

  reference front()             { return *begin(); }

  const_reference front() const { return *begin(); }

  reference back()              { return *(end() - 1); }

  const_reference back() const  { return *(end() - 1); }

  reference at(size_type __n) { _M_range_check(__n); return (*this)[__n]; }

  const_reference at(size_type __n) const { _M_range_check(__n); return (*this)[__n]; }

  //explicit vector(const allocator_type& __a = allocator_type()) : 

  vector(const allocator_type& __a = allocator_type()) : //to useimplicitly  constructor taking allocator

    _Vector_base<_Tp, _Alloc>(__a) {

    // needed for new() to work correctly

    _STLP_POP_IF_CHECK

  }

  vector(size_type __n, const _Tp& __val,

         const allocator_type& __a = allocator_type()) 

    : _Vector_base<_Tp, _Alloc>(__n, __a) { 

    this->_M_finish = uninitialized_fill_n(this->_M_start, __n, __val); 

    _STLP_POP_CLEANUP_ITEM

  }

  explicit vector(size_type __n)

    : _Vector_base<_Tp, _Alloc>(__n, allocator_type() ) {

# ifdef _STLP_USE_TRAP_LEAVE

      _Tp __p;

      _STLP_PUSH_CLEANUP_ITEM(_Tp, &__p) 

      this->_M_finish = uninitialized_fill_n(this->_M_start, __n, __p); 

      // unconditional for __p

      CleanupStack::Pop();

      _STLP_POP_CLEANUP_ITEM

# else

    this->_M_finish = uninitialized_fill_n(this->_M_start, __n, _Tp()); 

# endif

  }

  vector(const vector<_Tp, _Alloc>& __x) 

    : _Vector_base<_Tp, _Alloc>(__x.size(), __x.get_allocator()) {

    this->_M_finish = __uninitialized_copy((const_pointer)__x._M_start, 

                                           (const_pointer)__x._M_finish, this->_M_start, _IsPODType());

    _STLP_POP_CLEANUP_ITEM 

  }

#if defined (_STLP_MEMBER_TEMPLATES)

  template <class _Integer>

  void _M_initialize_aux(_Integer __n, _Integer __val, const __true_type&) {

    this->_M_start = this->_M_end_of_storage.allocate(__n);

    this->_M_end_of_storage._M_data = this->_M_start + __n; 

    this->_M_finish = uninitialized_fill_n(this->_M_start, __n, __val);

  }

  template <class _InputIterator>

  void _M_initialize_aux(_InputIterator __first, _InputIterator __last,

                         const __false_type&) {

    _M_range_initialize(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator));

  }

  // Check whether it's an integral type.  If so, it's not an iterator.

 # ifdef _STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS

  template <class _InputIterator>

  vector(_InputIterator __first, _InputIterator __last) :

    _Vector_base<_Tp, _Alloc>(allocator_type()) {

    typedef typename _Is_integer<_InputIterator>::_Integral _Integral;

    _STLP_PUSH_CLEANUP_ITEM(_Base, this) 

    _M_initialize_aux(__first, __last, _Integral());

    _STLP_POP_CLEANUP_ITEM

  }

 # endif

  template <class _InputIterator>

  vector(_InputIterator __first, _InputIterator __last,

         const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL ) :

    _Vector_base<_Tp, _Alloc>(__a) {

    typedef typename _Is_integer<_InputIterator>::_Integral _Integral;

    _STLP_PUSH_CLEANUP_ITEM(_Base, this) 

    _M_initialize_aux(__first, __last, _Integral());

    _STLP_POP_CLEANUP_ITEM

  }

#else

  vector(const _Tp* __first, const _Tp* __last,

         const allocator_type& __a = allocator_type())

    : _Vector_base<_Tp, _Alloc>(__last - __first, __a) { 

      this->_M_finish = __uninitialized_copy(__first, __last, this->_M_start, _IsPODType()); 

    _STLP_POP_CLEANUP_ITEM

  }

#endif /* _STLP_MEMBER_TEMPLATES */

  ~vector() { _Destroy(this->_M_start, this->_M_finish); }

  vector<_Tp, _Alloc>& operator=(const vector<_Tp, _Alloc>& __x);

  void reserve(size_type __n);

  // assign(), a generalized assignment member function.  Two

  // versions: one that takes a count, and one that takes a range.

  // The range version is a member template, so we dispatch on whether

  // or not the type is an integer.

  void assign(size_type __n, const _Tp& __val) { _M_fill_assign(__n, __val); }

  void _M_fill_assign(size_type __n, const _Tp& __val);

#ifdef _STLP_MEMBER_TEMPLATES

  template <class _ForwardIter>

  void _M_assign_aux(_ForwardIter __first, _ForwardIter __last, const forward_iterator_tag &)

#else

  void assign(const_iterator __first, const_iterator __last)

#endif

  {

    size_type __len = distance(__first, __last);

    if (__len > capacity()) {

      iterator __tmp = _M_allocate_and_copy(__len, __first, __last);

    _M_clear();

    _M_set(__tmp, __tmp + __len, __tmp + __len);

    }

    else if (size() >= __len) {

      iterator __new_finish = copy(__first, __last, this->_M_start);

      _Destroy(__new_finish, this->_M_finish);

      this->_M_finish = __new_finish;

    }

    else {

# if defined ( _STLP_MEMBER_TEMPLATES )

          _ForwardIter __mid = __first;

          advance(__mid, size());

# else

          const_iterator __mid = __first + size() ;

# endif

    copy(__first, __mid, this->_M_start);

    this->_M_finish = __uninitialized_copy(__mid, __last, this->_M_finish, _IsPODType());

    }

  }

#ifdef _STLP_MEMBER_TEMPLATES

  template <class _InputIter>

  void _M_assign_aux(_InputIter __first, _InputIter __last,

		     const input_iterator_tag &) {

    iterator __cur = begin();

    for ( ; __first != __last && __cur != end(); ++__cur, ++__first)

      *__cur = *__first;

    if (__first == __last)

      erase(__cur, end());

    else

      insert(end(), __first, __last);

  }

  template <class _Integer>

  void _M_assign_dispatch(_Integer __n, _Integer __val, const __true_type&)

    { assign((size_type) __n, (_Tp) __val); }

  template <class _InputIter>

  void _M_assign_dispatch(_InputIter __first, _InputIter __last, const __false_type&)

    { _M_assign_aux(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIter)); }

  template <class _InputIterator>

  void assign(_InputIterator __first, _InputIterator __last) {

    typedef typename _Is_integer<_InputIterator>::_Integral _Integral;

    _M_assign_dispatch(__first, __last, _Integral());

  }

#endif /* _STLP_MEMBER_TEMPLATES */

  void push_back(const _Tp& __x) {

    if (this->_M_finish != this->_M_end_of_storage._M_data) {

      _Construct(this->_M_finish, __x);

      ++this->_M_finish;

    }

    else

      _M_insert_overflow(this->_M_finish, __x, _IsPODType(), 1UL, true);

  }

  void swap(vector<_Tp, _Alloc>& __x) {

    _STLP_STD::swap(this->_M_start, __x._M_start);

    _STLP_STD::swap(this->_M_finish, __x._M_finish);

    _STLP_STD::swap(this->_M_end_of_storage, __x._M_end_of_storage);

  }

  iterator insert(iterator __position, const _Tp& __x) {

    size_type __n = __position - begin();

    if (this->_M_finish != this->_M_end_of_storage._M_data) {

      if (__position == end()) {

        _Construct(this->_M_finish, __x);

        ++this->_M_finish;

      } else {

        _Construct(this->_M_finish, *(this->_M_finish - 1));

        ++this->_M_finish;

        _Tp __x_copy = __x;

        __copy_backward_ptrs(__position, this->_M_finish - 2, this->_M_finish - 1, _TrivialAss());

        *__position = __x_copy;

      }

    }

    else

      _M_insert_overflow(__position, __x, _IsPODType(), 1UL);

    return begin() + __n;

  }

# ifndef _STLP_NO_ANACHRONISMS

  void push_back() { push_back(_Tp()); }

  iterator insert(iterator __position) { return insert(__position, _Tp()); }

# endif

  void _M_fill_insert (iterator __pos, size_type __n, const _Tp& __x);

#if defined ( _STLP_MEMBER_TEMPLATES)

  template <class _Integer>

  void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __val,

                          const __true_type&) {

    _M_fill_insert(__pos, (size_type) __n, (_Tp) __val);

  }

  template <class _InputIterator>

  void _M_insert_dispatch(iterator __pos,

                          _InputIterator __first, _InputIterator __last,

                          const __false_type&) {

    _M_range_insert(__pos, __first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator));

  }

  // Check whether it's an integral type.  If so, it's not an iterator.

  template <class _InputIterator>

  void insert(iterator __pos, _InputIterator __first, _InputIterator __last) {

    typedef typename _Is_integer<_InputIterator>::_Integral _Integral;

    _M_insert_dispatch(__pos, __first, __last, _Integral());

  }

  template <class _InputIterator>

  void _M_range_insert(iterator __pos, 

		       _InputIterator __first, 

		       _InputIterator __last,

		       const input_iterator_tag &) {

    for ( ; __first != __last; ++__first) {

      __pos = insert(__pos, *__first);

      ++__pos;

    }

  }

  template <class _ForwardIterator>

  void _M_range_insert(iterator __position,

                       _ForwardIterator __first,

                       _ForwardIterator __last,

                       const forward_iterator_tag &) 

#else /* _STLP_MEMBER_TEMPLATES */

  void insert(iterator __position,

              const_iterator __first, const_iterator __last)

#endif /* _STLP_MEMBER_TEMPLATES */

  {

    if (__first != __last) {

      size_type __n = distance(__first, __last);

      if (size_type(this->_M_end_of_storage._M_data - this->_M_finish) >= __n) {

        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());

          copy(__first, __last, __position);

        }

        else {

# if defined ( _STLP_MEMBER_TEMPLATES )

          _ForwardIterator __mid = __first;

          advance(__mid, __elems_after);

# else

          const_pointer __mid = __first + __elems_after;

# endif

          __uninitialized_copy(__mid, __last, this->_M_finish, _IsPODType());

          this->_M_finish += __n - __elems_after;

          __uninitialized_copy(__position, __old_finish, this->_M_finish, _IsPODType());

          this->_M_finish += __elems_after;

          copy(__first, __mid, __position);

        } /* elems_after */

      }

      else {

        const size_type __old_size = size();

        const size_type __len = __old_size + (max)(__old_size, __n);

        _STLP_LEAVE_VOLATILE pointer __new_start = this->_M_end_of_storage.allocate(__len);

        _STLP_LEAVE_VOLATILE pointer __new_finish = __new_start;

        _STLP_TRY {

          __new_finish = __uninitialized_copy(this->_M_start, __position, __new_start, _IsPODType());

          __new_finish = __uninitialized_copy(__first, __last, __new_finish, _IsPODType());

          __new_finish = __uninitialized_copy(__position, this->_M_finish, __new_finish, _IsPODType());

        }

        _STLP_UNWIND((_Destroy(__new_start,__new_finish), 

                      this->_M_end_of_storage.deallocate(__new_start,__len)));

        _M_clear();

        _M_set(__new_start, __new_finish, __new_start + __len);

      }

    }

  }

  void insert (iterator __pos, size_type __n, const _Tp& __x)

  { _M_fill_insert(__pos, __n, __x); }

  void pop_back() {

    --this->_M_finish;

    _Destroy(this->_M_finish);

  }

  iterator erase(iterator __position) {

    if (__position + 1 != end())