Subversion Repositories openrisc

// Vector implementation -*- C++ -*-

// Vector implementation -*- C++ -*-

// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010

// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010

// Free Software Foundation, Inc.

// Free Software Foundation, Inc.

//

//

// This file is part of the GNU ISO C++ Library.  This library is free

// This file is part of the GNU ISO C++ Library.  This library is free

// software; you can redistribute it and/or modify it under the

// software; you can redistribute it and/or modify it under the

// terms of the GNU General Public License as published by the

// terms of the GNU General Public License as published by the

// Free Software Foundation; either version 3, or (at your option)

// Free Software Foundation; either version 3, or (at your option)

// any later version.

// any later version.

// This library is distributed in the hope that it will be useful,

// This library is distributed in the hope that it will be useful,

// but WITHOUT ANY WARRANTY; without even the implied warranty of

// but WITHOUT ANY WARRANTY; without even the implied warranty of

// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

// GNU General Public License for more details.

// GNU General Public License for more details.

// Under Section 7 of GPL version 3, you are granted additional

// Under Section 7 of GPL version 3, you are granted additional

// permissions described in the GCC Runtime Library Exception, version

// permissions described in the GCC Runtime Library Exception, version

// 3.1, as published by the Free Software Foundation.

// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and

// You should have received a copy of the GNU General Public License and

// a copy of the GCC Runtime Library Exception along with this program;

// a copy of the GCC Runtime Library Exception along with this program;

// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see

// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see

// <http://www.gnu.org/licenses/>.

// <http://www.gnu.org/licenses/>.

/*

/*

 *

 *

 * Copyright (c) 1994

 * Copyright (c) 1994

 * Hewlett-Packard Company

 * Hewlett-Packard Company

 *

 *

 * Permission to use, copy, modify, distribute and sell this software

 * Permission to use, copy, modify, distribute and sell this software

 * and its documentation for any purpose is hereby granted without fee,

 * and its documentation for any purpose is hereby granted without fee,

 * provided that the above copyright notice appear in all copies and

 * provided that the above copyright notice appear in all copies and

 * that both that copyright notice and this permission notice appear

 * that both that copyright notice and this permission notice appear

 * in supporting documentation.  Hewlett-Packard Company makes no

 * in supporting documentation.  Hewlett-Packard Company makes no

 * representations about the suitability of this software for any

 * representations about the suitability of this software for any

 * purpose.  It is provided "as is" without express or implied warranty.

 * purpose.  It is provided "as is" without express or implied warranty.

 *

 *

 *

 *

 * Copyright (c) 1996

 * Copyright (c) 1996

 * Silicon Graphics Computer Systems, Inc.

 * Silicon Graphics Computer Systems, Inc.

 *

 *

 * Permission to use, copy, modify, distribute and sell this software

 * Permission to use, copy, modify, distribute and sell this software

 * and its documentation for any purpose is hereby granted without fee,

 * and its documentation for any purpose is hereby granted without fee,

 * provided that the above copyright notice appear in all copies and

 * provided that the above copyright notice appear in all copies and

 * that both that copyright notice and this permission notice appear

 * that both that copyright notice and this permission notice appear

 * in supporting documentation.  Silicon Graphics makes no

 * in supporting documentation.  Silicon Graphics makes no

 * representations about the suitability of this  software for any

 * representations about the suitability of this  software for any

 * purpose.  It is provided "as is" without express or implied warranty.

 * purpose.  It is provided "as is" without express or implied warranty.

 */

 */

/** @file stl_vector.h

/** @file stl_vector.h

 *  This is an internal header file, included by other library headers.

 *  This is an internal header file, included by other library headers.

 *  You should not attempt to use it directly.

 *  You should not attempt to use it directly.

 */

 */

#ifndef _STL_VECTOR_H

#ifndef _STL_VECTOR_H

#define _STL_VECTOR_H 1

#define _STL_VECTOR_H 1

#include <bits/stl_iterator_base_funcs.h>

#include <bits/stl_iterator_base_funcs.h>

#include <bits/functexcept.h>

#include <bits/functexcept.h>

#include <bits/concept_check.h>

#include <bits/concept_check.h>

#include <initializer_list>

#include <initializer_list>

_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)

_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)

  /// See bits/stl_deque.h's _Deque_base for an explanation.

  /// See bits/stl_deque.h's _Deque_base for an explanation.

  template<typename _Tp, typename _Alloc>

  template<typename _Tp, typename _Alloc>

    struct _Vector_base

    struct _Vector_base

    {

    {

      typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type;

      typedef typename _Alloc::template rebind<_Tp>::other _Tp_alloc_type;

      struct _Vector_impl

      struct _Vector_impl

      : public _Tp_alloc_type

      : public _Tp_alloc_type

      {

      {

        typename _Tp_alloc_type::pointer _M_start;

        typename _Tp_alloc_type::pointer _M_start;

        typename _Tp_alloc_type::pointer _M_finish;

        typename _Tp_alloc_type::pointer _M_finish;

        typename _Tp_alloc_type::pointer _M_end_of_storage;

        typename _Tp_alloc_type::pointer _M_end_of_storage;

        _Vector_impl()

        _Vector_impl()

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

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

        { }

        { }

        _Vector_impl(_Tp_alloc_type const& __a)

        _Vector_impl(_Tp_alloc_type const& __a)

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

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

        { }

        { }

      };

      };

    public:

    public:

      typedef _Alloc allocator_type;

      typedef _Alloc allocator_type;

      _Tp_alloc_type&

      _Tp_alloc_type&

      _M_get_Tp_allocator()

      _M_get_Tp_allocator()

      { return *static_cast<_Tp_alloc_type*>(&this->_M_impl); }

      { return *static_cast<_Tp_alloc_type*>(&this->_M_impl); }

      const _Tp_alloc_type&

      const _Tp_alloc_type&

      _M_get_Tp_allocator() const

      _M_get_Tp_allocator() const

      { return *static_cast<const _Tp_alloc_type*>(&this->_M_impl); }

      { return *static_cast<const _Tp_alloc_type*>(&this->_M_impl); }

      allocator_type

      allocator_type

      get_allocator() const

      get_allocator() const

      { return allocator_type(_M_get_Tp_allocator()); }

      { return allocator_type(_M_get_Tp_allocator()); }

      _Vector_base()

      _Vector_base()

      : _M_impl() { }

      : _M_impl() { }

      _Vector_base(const allocator_type& __a)

      _Vector_base(const allocator_type& __a)

      : _M_impl(__a) { }

      : _M_impl(__a) { }

      _Vector_base(size_t __n, const allocator_type& __a)

      _Vector_base(size_t __n, const allocator_type& __a)

      : _M_impl(__a)

      : _M_impl(__a)

      {

      {

        this->_M_impl._M_start = this->_M_allocate(__n);

        this->_M_impl._M_start = this->_M_allocate(__n);

        this->_M_impl._M_finish = this->_M_impl._M_start;

        this->_M_impl._M_finish = this->_M_impl._M_start;

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

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

      }

      }

#ifdef __GXX_EXPERIMENTAL_CXX0X__

#ifdef __GXX_EXPERIMENTAL_CXX0X__

      _Vector_base(_Vector_base&& __x)

      _Vector_base(_Vector_base&& __x)

      : _M_impl(__x._M_get_Tp_allocator())

      : _M_impl(__x._M_get_Tp_allocator())

      {

      {

        this->_M_impl._M_start = __x._M_impl._M_start;

        this->_M_impl._M_start = __x._M_impl._M_start;

        this->_M_impl._M_finish = __x._M_impl._M_finish;

        this->_M_impl._M_finish = __x._M_impl._M_finish;

        this->_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage;

        this->_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage;

        __x._M_impl._M_start = 0;

        __x._M_impl._M_start = 0;

        __x._M_impl._M_finish = 0;

        __x._M_impl._M_finish = 0;

        __x._M_impl._M_end_of_storage = 0;

        __x._M_impl._M_end_of_storage = 0;

      }

      }

#endif

#endif

      ~_Vector_base()

      ~_Vector_base()

      { _M_deallocate(this->_M_impl._M_start, this->_M_impl._M_end_of_storage

      { _M_deallocate(this->_M_impl._M_start, this->_M_impl._M_end_of_storage

                      - this->_M_impl._M_start); }

                      - this->_M_impl._M_start); }

    public:

    public:

      _Vector_impl _M_impl;

      _Vector_impl _M_impl;

      typename _Tp_alloc_type::pointer

      typename _Tp_alloc_type::pointer

      _M_allocate(size_t __n)

      _M_allocate(size_t __n)

      { return __n != 0 ? _M_impl.allocate(__n) : 0; }

      { return __n != 0 ? _M_impl.allocate(__n) : 0; }

      void

      void

      _M_deallocate(typename _Tp_alloc_type::pointer __p, size_t __n)

      _M_deallocate(typename _Tp_alloc_type::pointer __p, size_t __n)

      {

      {

        if (__p)

        if (__p)

          _M_impl.deallocate(__p, __n);

          _M_impl.deallocate(__p, __n);

      }

      }

    };

    };

  /**

  /**

   *  @brief A standard container which offers fixed time access to

   *  @brief A standard container which offers fixed time access to

   *  individual elements in any order.

   *  individual elements in any order.

   *

   *

   *  @ingroup sequences

   *  @ingroup sequences

   *

   *

   *  Meets the requirements of a <a href="tables.html#65">container</a>, a

   *  Meets the requirements of a <a href="tables.html#65">container</a>, a

   *  <a href="tables.html#66">reversible container</a>, and a

   *  <a href="tables.html#66">reversible container</a>, and a

   *  <a href="tables.html#67">sequence</a>, including the

   *  <a href="tables.html#67">sequence</a>, including the

   *  <a href="tables.html#68">optional sequence requirements</a> with the

   *  <a href="tables.html#68">optional sequence requirements</a> with the

   *  %exception of @c push_front and @c pop_front.

   *  %exception of @c push_front and @c pop_front.

   *

   *

   *  In some terminology a %vector can be described as a dynamic

   *  In some terminology a %vector can be described as a dynamic

   *  C-style array, it offers fast and efficient access to individual

   *  C-style array, it offers fast and efficient access to individual

   *  elements in any order and saves the user from worrying about

   *  elements in any order and saves the user from worrying about

   *  memory and size allocation.  Subscripting ( @c [] ) access is

   *  memory and size allocation.  Subscripting ( @c [] ) access is

   *  also provided as with C-style arrays.

   *  also provided as with C-style arrays.

  */

  */

  template<typename _Tp, typename _Alloc = std::allocator<_Tp> >

  template<typename _Tp, typename _Alloc = std::allocator<_Tp> >

    class vector : protected _Vector_base<_Tp, _Alloc>

    class vector : protected _Vector_base<_Tp, _Alloc>

    {

    {

      // Concept requirements.

      // Concept requirements.

      typedef typename _Alloc::value_type                _Alloc_value_type;

      typedef typename _Alloc::value_type                _Alloc_value_type;

      __glibcxx_class_requires(_Tp, _SGIAssignableConcept)

      __glibcxx_class_requires(_Tp, _SGIAssignableConcept)

      __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept)

      __glibcxx_class_requires2(_Tp, _Alloc_value_type, _SameTypeConcept)

      typedef _Vector_base<_Tp, _Alloc>                  _Base;

      typedef _Vector_base<_Tp, _Alloc>                  _Base;

      typedef typename _Base::_Tp_alloc_type             _Tp_alloc_type;

      typedef typename _Base::_Tp_alloc_type             _Tp_alloc_type;

    public:

    public:

      typedef _Tp                                        value_type;

      typedef _Tp                                        value_type;

      typedef typename _Tp_alloc_type::pointer           pointer;

      typedef typename _Tp_alloc_type::pointer           pointer;

      typedef typename _Tp_alloc_type::const_pointer     const_pointer;

      typedef typename _Tp_alloc_type::const_pointer     const_pointer;

      typedef typename _Tp_alloc_type::reference         reference;

      typedef typename _Tp_alloc_type::reference         reference;

      typedef typename _Tp_alloc_type::const_reference   const_reference;

      typedef typename _Tp_alloc_type::const_reference   const_reference;

      typedef __gnu_cxx::__normal_iterator<pointer, vector> iterator;

      typedef __gnu_cxx::__normal_iterator<pointer, vector> iterator;

      typedef __gnu_cxx::__normal_iterator<const_pointer, vector>

      typedef __gnu_cxx::__normal_iterator<const_pointer, vector>

      const_iterator;

      const_iterator;

      typedef std::reverse_iterator<const_iterator>  const_reverse_iterator;

      typedef std::reverse_iterator<const_iterator>  const_reverse_iterator;

      typedef std::reverse_iterator<iterator>            reverse_iterator;

      typedef std::reverse_iterator<iterator>            reverse_iterator;

      typedef size_t                                     size_type;

      typedef size_t                                     size_type;

      typedef ptrdiff_t                                  difference_type;

      typedef ptrdiff_t                                  difference_type;

      typedef _Alloc                                     allocator_type;

      typedef _Alloc                                     allocator_type;

    protected:

    protected:

      using _Base::_M_allocate;

      using _Base::_M_allocate;

      using _Base::_M_deallocate;

      using _Base::_M_deallocate;

      using _Base::_M_impl;

      using _Base::_M_impl;

      using _Base::_M_get_Tp_allocator;

      using _Base::_M_get_Tp_allocator;

    public:

    public:

      // [23.2.4.1] construct/copy/destroy

      // [23.2.4.1] construct/copy/destroy

      // (assign() and get_allocator() are also listed in this section)

      // (assign() and get_allocator() are also listed in this section)

      /**

      /**

       *  @brief  Default constructor creates no elements.

       *  @brief  Default constructor creates no elements.

       */

       */

      vector()

      vector()

      : _Base() { }

      : _Base() { }

      /**

      /**

       *  @brief  Creates a %vector with no elements.

       *  @brief  Creates a %vector with no elements.

       *  @param  a  An allocator object.

       *  @param  a  An allocator object.

       */

       */

      explicit

      explicit

      vector(const allocator_type& __a)

      vector(const allocator_type& __a)

      : _Base(__a) { }

      : _Base(__a) { }

      /**

      /**

       *  @brief  Creates a %vector with copies of an exemplar element.

       *  @brief  Creates a %vector with copies of an exemplar element.

       *  @param  n  The number of elements to initially create.

       *  @param  n  The number of elements to initially create.

       *  @param  value  An element to copy.

       *  @param  value  An element to copy.

       *  @param  a  An allocator.

       *  @param  a  An allocator.

       *

       *

       *  This constructor fills the %vector with @a n copies of @a value.

       *  This constructor fills the %vector with @a n copies of @a value.

       */

       */

      explicit

      explicit

      vector(size_type __n, const value_type& __value = value_type(),

      vector(size_type __n, const value_type& __value = value_type(),

             const allocator_type& __a = allocator_type())

             const allocator_type& __a = allocator_type())

      : _Base(__n, __a)

      : _Base(__n, __a)

      { _M_fill_initialize(__n, __value); }

      { _M_fill_initialize(__n, __value); }

      /**

      /**

       *  @brief  %Vector copy constructor.

       *  @brief  %Vector copy constructor.

       *  @param  x  A %vector of identical element and allocator types.

       *  @param  x  A %vector of identical element and allocator types.

       *

       *

       *  The newly-created %vector uses a copy of the allocation

       *  The newly-created %vector uses a copy of the allocation

       *  object used by @a x.  All the elements of @a x are copied,

       *  object used by @a x.  All the elements of @a x are copied,

       *  but any extra memory in

       *  but any extra memory in

       *  @a x (for fast expansion) will not be copied.

       *  @a x (for fast expansion) will not be copied.

       */

       */

      vector(const vector& __x)

      vector(const vector& __x)

      : _Base(__x.size(), __x._M_get_Tp_allocator())

      : _Base(__x.size(), __x._M_get_Tp_allocator())

      { this->_M_impl._M_finish =

      { this->_M_impl._M_finish =

          std::__uninitialized_copy_a(__x.begin(), __x.end(),

          std::__uninitialized_copy_a(__x.begin(), __x.end(),

                                      this->_M_impl._M_start,

                                      this->_M_impl._M_start,

                                      _M_get_Tp_allocator());

                                      _M_get_Tp_allocator());

      }

      }

#ifdef __GXX_EXPERIMENTAL_CXX0X__

#ifdef __GXX_EXPERIMENTAL_CXX0X__

      /**

      /**

       *  @brief  %Vector move constructor.

       *  @brief  %Vector move constructor.

       *  @param  x  A %vector of identical element and allocator types.

       *  @param  x  A %vector of identical element and allocator types.

       *

       *

       *  The newly-created %vector contains the exact contents of @a x.

       *  The newly-created %vector contains the exact contents of @a x.

       *  The contents of @a x are a valid, but unspecified %vector.

       *  The contents of @a x are a valid, but unspecified %vector.

       */

       */

      vector(vector&& __x)

      vector(vector&& __x)

      : _Base(std::forward<_Base>(__x)) { }

      : _Base(std::forward<_Base>(__x)) { }

      /**

      /**

       *  @brief  Builds a %vector from an initializer list.

       *  @brief  Builds a %vector from an initializer list.

       *  @param  l  An initializer_list.

       *  @param  l  An initializer_list.

       *  @param  a  An allocator.

       *  @param  a  An allocator.

       *

       *

       *  Create a %vector consisting of copies of the elements in the

       *  Create a %vector consisting of copies of the elements in the

       *  initializer_list @a l.

       *  initializer_list @a l.

       *

       *

       *  This will call the element type's copy constructor N times

       *  This will call the element type's copy constructor N times

       *  (where N is @a l.size()) and do no memory reallocation.

       *  (where N is @a l.size()) and do no memory reallocation.

       */

       */

      vector(initializer_list<value_type> __l,

      vector(initializer_list<value_type> __l,

             const allocator_type& __a = allocator_type())

             const allocator_type& __a = allocator_type())

      : _Base(__a)

      : _Base(__a)

      {

      {

        _M_range_initialize(__l.begin(), __l.end(),

        _M_range_initialize(__l.begin(), __l.end(),

                            random_access_iterator_tag());

                            random_access_iterator_tag());

      }

      }

#endif

#endif

      /**

      /**

       *  @brief  Builds a %vector from a range.

       *  @brief  Builds a %vector from a range.

       *  @param  first  An input iterator.

       *  @param  first  An input iterator.

       *  @param  last  An input iterator.

       *  @param  last  An input iterator.

       *  @param  a  An allocator.

       *  @param  a  An allocator.

       *

       *

       *  Create a %vector consisting of copies of the elements from

       *  Create a %vector consisting of copies of the elements from

       *  [first,last).

       *  [first,last).

       *

       *

       *  If the iterators are forward, bidirectional, or

       *  If the iterators are forward, bidirectional, or

       *  random-access, then this will call the elements' copy

       *  random-access, then this will call the elements' copy

       *  constructor N times (where N is distance(first,last)) and do

       *  constructor N times (where N is distance(first,last)) and do

       *  no memory reallocation.  But if only input iterators are

       *  no memory reallocation.  But if only input iterators are

       *  used, then this will do at most 2N calls to the copy

       *  used, then this will do at most 2N calls to the copy

       *  constructor, and logN memory reallocations.

       *  constructor, and logN memory reallocations.

       */

       */

      template<typename _InputIterator>

      template<typename _InputIterator>

        vector(_InputIterator __first, _InputIterator __last,

        vector(_InputIterator __first, _InputIterator __last,

               const allocator_type& __a = allocator_type())

               const allocator_type& __a = allocator_type())

        : _Base(__a)

        : _Base(__a)

        {

        {

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

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

          typedef typename std::__is_integer<_InputIterator>::__type _Integral;

          typedef typename std::__is_integer<_InputIterator>::__type _Integral;

          _M_initialize_dispatch(__first, __last, _Integral());

          _M_initialize_dispatch(__first, __last, _Integral());

        }

        }

      /**

      /**

       *  The dtor only erases the elements, and note that if the

       *  The dtor only erases the elements, and note that if the

       *  elements themselves are pointers, the pointed-to memory is

       *  elements themselves are pointers, the pointed-to memory is

       *  not touched in any way.  Managing the pointer is the user's

       *  not touched in any way.  Managing the pointer is the user's

       *  responsibility.

       *  responsibility.

       */

       */

      ~vector()

      ~vector()

      { std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,

      { std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,

                      _M_get_Tp_allocator()); }

                      _M_get_Tp_allocator()); }

      /**

      /**

       *  @brief  %Vector assignment operator.

       *  @brief  %Vector assignment operator.

       *  @param  x  A %vector of identical element and allocator types.

       *  @param  x  A %vector of identical element and allocator types.

       *

       *

       *  All the elements of @a x are copied, but any extra memory in

       *  All the elements of @a x are copied, but any extra memory in

       *  @a x (for fast expansion) will not be copied.  Unlike the

       *  @a x (for fast expansion) will not be copied.  Unlike the

       *  copy constructor, the allocator object is not copied.

       *  copy constructor, the allocator object is not copied.

       */

       */

      vector&

      vector&

      operator=(const vector& __x);

      operator=(const vector& __x);

#ifdef __GXX_EXPERIMENTAL_CXX0X__

#ifdef __GXX_EXPERIMENTAL_CXX0X__

      /**

      /**

       *  @brief  %Vector move assignment operator.

       *  @brief  %Vector move assignment operator.

       *  @param  x  A %vector of identical element and allocator types.

       *  @param  x  A %vector of identical element and allocator types.

       *

       *

       *  The contents of @a x are moved into this %vector (without copying).

       *  The contents of @a x are moved into this %vector (without copying).

       *  @a x is a valid, but unspecified %vector.

       *  @a x is a valid, but unspecified %vector.

       */

       */

      vector&

      vector&

      operator=(vector&& __x)

      operator=(vector&& __x)

      {

      {

        // NB: DR 1204.

        // NB: DR 1204.

        // NB: DR 675.

        // NB: DR 675.

        this->clear();

        this->clear();

        this->swap(__x);

        this->swap(__x);

        return *this;

        return *this;

      }

      }

      /**

      /**

       *  @brief  %Vector list assignment operator.

       *  @brief  %Vector list assignment operator.

       *  @param  l  An initializer_list.

       *  @param  l  An initializer_list.

       *

       *

       *  This function fills a %vector with copies of the elements in the

       *  This function fills a %vector with copies of the elements in the

       *  initializer list @a l.

       *  initializer list @a l.

       *

       *

       *  Note that the assignment completely changes the %vector and

       *  Note that the assignment completely changes the %vector and

       *  that the resulting %vector's size is the same as the number

       *  that the resulting %vector's size is the same as the number

       *  of elements assigned.  Old data may be lost.

       *  of elements assigned.  Old data may be lost.

       */

       */

      vector&

      vector&

      operator=(initializer_list<value_type> __l)

      operator=(initializer_list<value_type> __l)

      {

      {

        this->assign(__l.begin(), __l.end());

        this->assign(__l.begin(), __l.end());

        return *this;

        return *this;

      }

      }

#endif

#endif

      /**

      /**

       *  @brief  Assigns a given value to a %vector.

       *  @brief  Assigns a given value to a %vector.

       *  @param  n  Number of elements to be assigned.

       *  @param  n  Number of elements to be assigned.

       *  @param  val  Value to be assigned.

       *  @param  val  Value to be assigned.

       *

       *

       *  This function fills a %vector with @a n copies of the given

       *  This function fills a %vector with @a n copies of the given

       *  value.  Note that the assignment completely changes the

       *  value.  Note that the assignment completely changes the

       *  %vector and that the resulting %vector's size is the same as

       *  %vector and that the resulting %vector's size is the same as

       *  the number of elements assigned.  Old data may be lost.

       *  the number of elements assigned.  Old data may be lost.

       */

       */

      void

      void

      assign(size_type __n, const value_type& __val)

      assign(size_type __n, const value_type& __val)

      { _M_fill_assign(__n, __val); }

      { _M_fill_assign(__n, __val); }

      /**

      /**

       *  @brief  Assigns a range to a %vector.

       *  @brief  Assigns a range to a %vector.

       *  @param  first  An input iterator.

       *  @param  first  An input iterator.

       *  @param  last   An input iterator.

       *  @param  last   An input iterator.

       *

       *

       *  This function fills a %vector with copies of the elements in the

       *  This function fills a %vector with copies of the elements in the

       *  range [first,last).

       *  range [first,last).

       *

       *

       *  Note that the assignment completely changes the %vector and

       *  Note that the assignment completely changes the %vector and

       *  that the resulting %vector's size is the same as the number

       *  that the resulting %vector's size is the same as the number

       *  of elements assigned.  Old data may be lost.

       *  of elements assigned.  Old data may be lost.

       */

       */

      template<typename _InputIterator>

      template<typename _InputIterator>

        void

        void

        assign(_InputIterator __first, _InputIterator __last)

        assign(_InputIterator __first, _InputIterator __last)

        {

        {

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

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

          typedef typename std::__is_integer<_InputIterator>::__type _Integral;

          typedef typename std::__is_integer<_InputIterator>::__type _Integral;

          _M_assign_dispatch(__first, __last, _Integral());

          _M_assign_dispatch(__first, __last, _Integral());

        }

        }

#ifdef __GXX_EXPERIMENTAL_CXX0X__

#ifdef __GXX_EXPERIMENTAL_CXX0X__

      /**

      /**

       *  @brief  Assigns an initializer list to a %vector.

       *  @brief  Assigns an initializer list to a %vector.

       *  @param  l  An initializer_list.

       *  @param  l  An initializer_list.

       *

       *

       *  This function fills a %vector with copies of the elements in the

       *  This function fills a %vector with copies of the elements in the

       *  initializer list @a l.

       *  initializer list @a l.

       *

       *

       *  Note that the assignment completely changes the %vector and

       *  Note that the assignment completely changes the %vector and

       *  that the resulting %vector's size is the same as the number

       *  that the resulting %vector's size is the same as the number

       *  of elements assigned.  Old data may be lost.

       *  of elements assigned.  Old data may be lost.

       */

       */

      void

      void

      assign(initializer_list<value_type> __l)

      assign(initializer_list<value_type> __l)

      { this->assign(__l.begin(), __l.end()); }

      { this->assign(__l.begin(), __l.end()); }

#endif

#endif

      /// Get a copy of the memory allocation object.

      /// Get a copy of the memory allocation object.

      using _Base::get_allocator;

      using _Base::get_allocator;

      // iterators

      // iterators

      /**

      /**

       *  Returns a read/write iterator that points to the first

       *  Returns a read/write iterator that points to the first

       *  element in the %vector.  Iteration is done in ordinary

       *  element in the %vector.  Iteration is done in ordinary

       *  element order.

       *  element order.

       */

       */

      iterator

      iterator

      begin()

      begin()

      { return iterator(this->_M_impl._M_start); }

      { return iterator(this->_M_impl._M_start); }

      /**

      /**

       *  Returns a read-only (constant) iterator that points to the

       *  Returns a read-only (constant) iterator that points to the

       *  first element in the %vector.  Iteration is done in ordinary

       *  first element in the %vector.  Iteration is done in ordinary

       *  element order.

       *  element order.

       */

       */

      const_iterator

      const_iterator

      begin() const

      begin() const

      { return const_iterator(this->_M_impl._M_start); }

      { return const_iterator(this->_M_impl._M_start); }

      /**

      /**

       *  Returns a read/write iterator that points one past the last

       *  Returns a read/write iterator that points one past the last

       *  element in the %vector.  Iteration is done in ordinary

       *  element in the %vector.  Iteration is done in ordinary

       *  element order.

       *  element order.

       */

       */

      iterator

      iterator

      end()

      end()

      { return iterator(this->_M_impl._M_finish); }

      { return iterator(this->_M_impl._M_finish); }

      /**

      /**

       *  Returns a read-only (constant) iterator that points one past

       *  Returns a read-only (constant) iterator that points one past

       *  the last element in the %vector.  Iteration is done in

       *  the last element in the %vector.  Iteration is done in

       *  ordinary element order.

       *  ordinary element order.

       */

       */

      const_iterator

      const_iterator

      end() const

      end() const

      { return const_iterator(this->_M_impl._M_finish); }

      { return const_iterator(this->_M_impl._M_finish); }

      /**

      /**

       *  Returns a read/write reverse iterator that points to the

       *  Returns a read/write reverse iterator that points to the

       *  last element in the %vector.  Iteration is done in reverse

       *  last element in the %vector.  Iteration is done in reverse

       *  element order.

       *  element order.

       */

       */

      reverse_iterator

      reverse_iterator

      rbegin()

      rbegin()

      { return reverse_iterator(end()); }

      { return reverse_iterator(end()); }

      /**

      /**

       *  Returns a read-only (constant) reverse iterator that points

       *  Returns a read-only (constant) reverse iterator that points

       *  to the last element in the %vector.  Iteration is done in

       *  to the last element in the %vector.  Iteration is done in

       *  reverse element order.

       *  reverse element order.

       */

       */

      const_reverse_iterator

      const_reverse_iterator

      rbegin() const

      rbegin() const

      { return const_reverse_iterator(end()); }

      { return const_reverse_iterator(end()); }

      /**

      /**

       *  Returns a read/write reverse iterator that points to one

       *  Returns a read/write reverse iterator that points to one

       *  before the first element in the %vector.  Iteration is done

       *  before the first element in the %vector.  Iteration is done

       *  in reverse element order.

       *  in reverse element order.

       */

       */

      reverse_iterator

      reverse_iterator

      rend()

      rend()

      { return reverse_iterator(begin()); }

      { return reverse_iterator(begin()); }

      /**

      /**

       *  Returns a read-only (constant) reverse iterator that points

       *  Returns a read-only (constant) reverse iterator that points

       *  to one before the first element in the %vector.  Iteration

       *  to one before the first element in the %vector.  Iteration

       *  is done in reverse element order.

       *  is done in reverse element order.

       */

       */

      const_reverse_iterator

      const_reverse_iterator

      rend() const

      rend() const

      { return const_reverse_iterator(begin()); }

      { return const_reverse_iterator(begin()); }

#ifdef __GXX_EXPERIMENTAL_CXX0X__

#ifdef __GXX_EXPERIMENTAL_CXX0X__

      /**

      /**

       *  Returns a read-only (constant) iterator that points to the

       *  Returns a read-only (constant) iterator that points to the

       *  first element in the %vector.  Iteration is done in ordinary

       *  first element in the %vector.  Iteration is done in ordinary

       *  element order.

       *  element order.

       */

       */

      const_iterator

      const_iterator

      cbegin() const

      cbegin() const

      { return const_iterator(this->_M_impl._M_start); }

      { return const_iterator(this->_M_impl._M_start); }

      /**

      /**

       *  Returns a read-only (constant) iterator that points one past

       *  Returns a read-only (constant) iterator that points one past

       *  the last element in the %vector.  Iteration is done in

       *  the last element in the %vector.  Iteration is done in

       *  ordinary element order.

       *  ordinary element order.

       */

       */

      const_iterator

      const_iterator

      cend() const

      cend() const

      { return const_iterator(this->_M_impl._M_finish); }

      { return const_iterator(this->_M_impl._M_finish); }

      /**

      /**

       *  Returns a read-only (constant) reverse iterator that points

       *  Returns a read-only (constant) reverse iterator that points

       *  to the last element in the %vector.  Iteration is done in

       *  to the last element in the %vector.  Iteration is done in

       *  reverse element order.

       *  reverse element order.

       */

       */

      const_reverse_iterator

      const_reverse_iterator

      crbegin() const

      crbegin() const

      { return const_reverse_iterator(end()); }

      { return const_reverse_iterator(end()); }

      /**

      /**

       *  Returns a read-only (constant) reverse iterator that points

       *  Returns a read-only (constant) reverse iterator that points

       *  to one before the first element in the %vector.  Iteration

       *  to one before the first element in the %vector.  Iteration

       *  is done in reverse element order.

       *  is done in reverse element order.

       */

       */

      const_reverse_iterator

      const_reverse_iterator

      crend() const

      crend() const

      { return const_reverse_iterator(begin()); }

      { return const_reverse_iterator(begin()); }

#endif

#endif

      // [23.2.4.2] capacity

      // [23.2.4.2] capacity

      /**  Returns the number of elements in the %vector.  */

      /**  Returns the number of elements in the %vector.  */

      size_type

      size_type

      size() const

      size() const

      { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); }

      { return size_type(this->_M_impl._M_finish - this->_M_impl._M_start); }

      /**  Returns the size() of the largest possible %vector.  */

      /**  Returns the size() of the largest possible %vector.  */

      size_type

      size_type

      max_size() const

      max_size() const

      { return _M_get_Tp_allocator().max_size(); }

      { return _M_get_Tp_allocator().max_size(); }

      /**

      /**

       *  @brief  Resizes the %vector to the specified number of elements.

       *  @brief  Resizes the %vector to the specified number of elements.

       *  @param  new_size  Number of elements the %vector should contain.

       *  @param  new_size  Number of elements the %vector should contain.

       *  @param  x  Data with which new elements should be populated.

       *  @param  x  Data with which new elements should be populated.

       *

       *

       *  This function will %resize the %vector to the specified

       *  This function will %resize the %vector to the specified

       *  number of elements.  If the number is smaller than the

       *  number of elements.  If the number is smaller than the

       *  %vector's current size the %vector is truncated, otherwise

       *  %vector's current size the %vector is truncated, otherwise

       *  the %vector is extended and new elements are populated with

       *  the %vector is extended and new elements are populated with

       *  given data.

       *  given data.

       */

       */

      void

      void

      resize(size_type __new_size, value_type __x = value_type())

      resize(size_type __new_size, value_type __x = value_type())

      {

      {

        if (__new_size < size())

        if (__new_size < size())

          _M_erase_at_end(this->_M_impl._M_start + __new_size);

          _M_erase_at_end(this->_M_impl._M_start + __new_size);

        else

        else

          insert(end(), __new_size - size(), __x);

          insert(end(), __new_size - size(), __x);

      }

      }

#ifdef __GXX_EXPERIMENTAL_CXX0X__

#ifdef __GXX_EXPERIMENTAL_CXX0X__

      /**  A non-binding request to reduce capacity() to size().  */

      /**  A non-binding request to reduce capacity() to size().  */

      void

      void

      shrink_to_fit()

      shrink_to_fit()

      { std::__shrink_to_fit<vector>::_S_do_it(*this); }

      { std::__shrink_to_fit<vector>::_S_do_it(*this); }

#endif

#endif

      /**

      /**

       *  Returns the total number of elements that the %vector can

       *  Returns the total number of elements that the %vector can

       *  hold before needing to allocate more memory.

       *  hold before needing to allocate more memory.

       */

       */

      size_type

      size_type

      capacity() const

      capacity() const

      { return size_type(this->_M_impl._M_end_of_storage

      { return size_type(this->_M_impl._M_end_of_storage

                         - this->_M_impl._M_start); }

                         - this->_M_impl._M_start); }

      /**

      /**

       *  Returns true if the %vector is empty.  (Thus begin() would

       *  Returns true if the %vector is empty.  (Thus begin() would

       *  equal end().)

       *  equal end().)

       */

       */

      bool

      bool

      empty() const

      empty() const

      { return begin() == end(); }

      { return begin() == end(); }

      /**

      /**

       *  @brief  Attempt to preallocate enough memory for specified number of

       *  @brief  Attempt to preallocate enough memory for specified number of

       *          elements.

       *          elements.

       *  @param  n  Number of elements required.

       *  @param  n  Number of elements required.

       *  @throw  std::length_error  If @a n exceeds @c max_size().

       *  @throw  std::length_error  If @a n exceeds @c max_size().

       *

       *

       *  This function attempts to reserve enough memory for the

       *  This function attempts to reserve enough memory for the

       *  %vector to hold the specified number of elements.  If the

       *  %vector to hold the specified number of elements.  If the

       *  number requested is more than max_size(), length_error is

       *  number requested is more than max_size(), length_error is

       *  thrown.

       *  thrown.

       *

       *

       *  The advantage of this function is that if optimal code is a

       *  The advantage of this function is that if optimal code is a

       *  necessity and the user can determine the number of elements

       *  necessity and the user can determine the number of elements

       *  that will be required, the user can reserve the memory in

       *  that will be required, the user can reserve the memory in

       *  %advance, and thus prevent a possible reallocation of memory

       *  %advance, and thus prevent a possible reallocation of memory

       *  and copying of %vector data.

       *  and copying of %vector data.

       */

       */

      void

      void

      reserve(size_type __n);

      reserve(size_type __n);

      // element access

      // element access

      /**

      /**

       *  @brief  Subscript access to the data contained in the %vector.

       *  @brief  Subscript access to the data contained in the %vector.

       *  @param n The index of the element for which data should be

       *  @param n The index of the element for which data should be

       *  accessed.

       *  accessed.

       *  @return  Read/write reference to data.

       *  @return  Read/write reference to data.

       *

       *

       *  This operator allows for easy, array-style, data access.

       *  This operator allows for easy, array-style, data access.

       *  Note that data access with this operator is unchecked and

       *  Note that data access with this operator is unchecked and

       *  out_of_range lookups are not defined. (For checked lookups

       *  out_of_range lookups are not defined. (For checked lookups

       *  see at().)

       *  see at().)

       */

       */

      reference

      reference

      operator[](size_type __n)

      operator[](size_type __n)

      { return *(this->_M_impl._M_start + __n); }

      { return *(this->_M_impl._M_start + __n); }

      /**

      /**

       *  @brief  Subscript access to the data contained in the %vector.

       *  @brief  Subscript access to the data contained in the %vector.

       *  @param n The index of the element for which data should be

       *  @param n The index of the element for which data should be

       *  accessed.

       *  accessed.

       *  @return  Read-only (constant) reference to data.

       *  @return  Read-only (constant) reference to data.

       *

       *

       *  This operator allows for easy, array-style, data access.

       *  This operator allows for easy, array-style, data access.

       *  Note that data access with this operator is unchecked and

       *  Note that data access with this operator is unchecked and

       *  out_of_range lookups are not defined. (For checked lookups

       *  out_of_range lookups are not defined. (For checked lookups

       *  see at().)

       *  see at().)

       */

       */

      const_reference

      const_reference

      operator[](size_type __n) const

      operator[](size_type __n) const

      { return *(this->_M_impl._M_start + __n); }

      { return *(this->_M_impl._M_start + __n); }

    protected:

    protected:

      /// Safety check used only from at().

      /// Safety check used only from at().

      void

      void

      _M_range_check(size_type __n) const

      _M_range_check(size_type __n) const

      {

      {

        if (__n >= this->size())

        if (__n >= this->size())

          __throw_out_of_range(__N("vector::_M_range_check"));

          __throw_out_of_range(__N("vector::_M_range_check"));

      }

      }

    public:

    public:

      /**

      /**

       *  @brief  Provides access to the data contained in the %vector.

       *  @brief  Provides access to the data contained in the %vector.

       *  @param n The index of the element for which data should be

       *  @param n The index of the element for which data should be

       *  accessed.

       *  accessed.

       *  @return  Read/write reference to data.

       *  @return  Read/write reference to data.

       *  @throw  std::out_of_range  If @a n is an invalid index.

       *  @throw  std::out_of_range  If @a n is an invalid index.

       *

       *

       *  This function provides for safer data access.  The parameter

       *  This function provides for safer data access.  The parameter

       *  is first checked that it is in the range of the vector.  The

       *  is first checked that it is in the range of the vector.  The

       *  function throws out_of_range if the check fails.

       *  function throws out_of_range if the check fails.

       */

       */

      reference

      reference

      at(size_type __n)

      at(size_type __n)

      {

      {

        _M_range_check(__n);

        _M_range_check(__n);

        return (*this)[__n];

        return (*this)[__n];

      }

      }

      /**

      /**

       *  @brief  Provides access to the data contained in the %vector.

       *  @brief  Provides access to the data contained in the %vector.

       *  @param n The index of the element for which data should be

       *  @param n The index of the element for which data should be

       *  accessed.

       *  accessed.

       *  @return  Read-only (constant) reference to data.

       *  @return  Read-only (constant) reference to data.

       *  @throw  std::out_of_range  If @a n is an invalid index.

       *  @throw  std::out_of_range  If @a n is an invalid index.