[thirdparty/gcc.git] / libstdc++-v3 / include / debug / vector

// Debugging vector implementation -*- C++ -*-

// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009
// Free Software Foundation, Inc.
//
// 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
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.

// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU General Public License for more details.

// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.

// 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;
// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
// <http://www.gnu.org/licenses/>.

/** @file debug/vector
 *  This file is a GNU debug extension to the Standard C++ Library.
 */

#ifndef _GLIBCXX_DEBUG_VECTOR
#define _GLIBCXX_DEBUG_VECTOR 1

#include <vector>
#include <utility>
#include <debug/safe_sequence.h>
#include <debug/safe_iterator.h>

namespace std
{
namespace __debug
{
  template<typename _Tp,
	   typename _Allocator = std::allocator<_Tp> >
    class vector
    : public _GLIBCXX_STD_D::vector<_Tp, _Allocator>,
      public __gnu_debug::_Safe_sequence<vector<_Tp, _Allocator> >
    {
      typedef _GLIBCXX_STD_D::vector<_Tp, _Allocator> _Base;
      typedef __gnu_debug::_Safe_sequence<vector>              _Safe_base;

      typedef typename _Base::const_iterator _Base_const_iterator;
      typedef __gnu_debug::_After_nth_from<_Base_const_iterator> _After_nth;

    public:
      typedef typename _Base::reference             reference;
      typedef typename _Base::const_reference       const_reference;

      typedef __gnu_debug::_Safe_iterator<typename _Base::iterator,vector>
      iterator;
      typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator,vector>
      const_iterator;

      typedef typename _Base::size_type             size_type;
      typedef typename _Base::difference_type       difference_type;

      typedef _Tp				    value_type;
      typedef _Allocator			    allocator_type;
      typedef typename _Base::pointer               pointer;
      typedef typename _Base::const_pointer         const_pointer;
      typedef std::reverse_iterator<iterator>       reverse_iterator;
      typedef std::reverse_iterator<const_iterator> const_reverse_iterator;

      // 23.2.4.1 construct/copy/destroy:
      explicit vector(const _Allocator& __a = _Allocator())
      : _Base(__a), _M_guaranteed_capacity(0) { }

      explicit vector(size_type __n, const _Tp& __value = _Tp(),
		      const _Allocator& __a = _Allocator())
      : _Base(__n, __value, __a), _M_guaranteed_capacity(__n) { }

      template<class _InputIterator>
        vector(_InputIterator __first, _InputIterator __last,
	       const _Allocator& __a = _Allocator())
	: _Base(__gnu_debug::__check_valid_range(__first, __last),
		__last, __a),
	  _M_guaranteed_capacity(0)
        { _M_update_guaranteed_capacity(); }

      vector(const vector& __x)
      : _Base(__x), _Safe_base(), _M_guaranteed_capacity(__x.size()) { }

      /// Construction from a release-mode vector
      vector(const _Base& __x)
      : _Base(__x), _Safe_base(), _M_guaranteed_capacity(__x.size()) { }

#ifdef __GXX_EXPERIMENTAL_CXX0X__
      vector(vector&& __x)
      : _Base(std::forward<vector>(__x)), _Safe_base(),
	_M_guaranteed_capacity(this->size())
      {
	this->_M_swap(__x);
	__x._M_guaranteed_capacity = 0;
      }

      vector(initializer_list<value_type> __l,
	     const allocator_type& __a = allocator_type())
      : _Base(__l, __a), _Safe_base(),
	_M_guaranteed_capacity(__l.size()) { }
#endif

      ~vector() { }

      vector&
      operator=(const vector& __x)
      {
	static_cast<_Base&>(*this) = __x;
	this->_M_invalidate_all();
	_M_update_guaranteed_capacity();
	return *this;
      }

#ifdef __GXX_EXPERIMENTAL_CXX0X__
      vector&
      operator=(vector&& __x)
      {
        // NB: DR 675.
	clear();
	swap(__x);
	return *this;
      }

      vector&
      operator=(initializer_list<value_type> __l)
      {
	static_cast<_Base&>(*this) = __l;
	this->_M_invalidate_all();
	_M_update_guaranteed_capacity();
	return *this;
      }
#endif

      template<typename _InputIterator>
        void
        assign(_InputIterator __first, _InputIterator __last)
        {
	  __glibcxx_check_valid_range(__first, __last);
	  _Base::assign(__first, __last);
	  this->_M_invalidate_all();
	  _M_update_guaranteed_capacity();
	}

      void
      assign(size_type __n, const _Tp& __u)
      {
	_Base::assign(__n, __u);
	this->_M_invalidate_all();
	_M_update_guaranteed_capacity();
      }

#ifdef __GXX_EXPERIMENTAL_CXX0X__
      void
      assign(initializer_list<value_type> __l)
      {
	_Base::assign(__l);
	this->_M_invalidate_all();
	_M_update_guaranteed_capacity();
      }
#endif

      using _Base::get_allocator;

      // iterators:
      iterator
      begin()
      { return iterator(_Base::begin(), this); }

      const_iterator
      begin() const
      { return const_iterator(_Base::begin(), this); }

      iterator
      end()
      { return iterator(_Base::end(), this); }

      const_iterator
      end() const
      { return const_iterator(_Base::end(), this); }

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

#ifdef __GXX_EXPERIMENTAL_CXX0X__
      const_iterator
      cbegin() const
      { return const_iterator(_Base::begin(), this); }

      const_iterator
      cend() const
      { return const_iterator(_Base::end(), this); }

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

      const_reverse_iterator
      crend() const
      { return const_reverse_iterator(begin()); }
#endif

      // 23.2.4.2 capacity:
      using _Base::size;
      using _Base::max_size;

      void
      resize(size_type __sz, _Tp __c = _Tp())
      {
	bool __realloc = _M_requires_reallocation(__sz);
	if (__sz < this->size())
	  this->_M_invalidate_if(_After_nth(__sz, _M_base().begin()));
	_Base::resize(__sz, __c);
	if (__realloc)
	  this->_M_invalidate_all();
      }

      size_type
      capacity() const
      {
#ifdef _GLIBCXX_DEBUG_PEDANTIC
	return _M_guaranteed_capacity;
#else
	return _Base::capacity();
#endif
      }

      using _Base::empty;

      void
      reserve(size_type __n)
      {
	bool __realloc = _M_requires_reallocation(__n);
	_Base::reserve(__n);
	if (__n > _M_guaranteed_capacity)
	  _M_guaranteed_capacity = __n;
	if (__realloc)
	  this->_M_invalidate_all();
      }

      // element access:
      reference
      operator[](size_type __n)
      {
	__glibcxx_check_subscript(__n);
	return _M_base()[__n];
      }

      const_reference
      operator[](size_type __n) const
      {
	__glibcxx_check_subscript(__n);
	return _M_base()[__n];
      }

      using _Base::at;

      reference
      front()
      {
	__glibcxx_check_nonempty();
	return _Base::front();
      }

      const_reference
      front() const
      {
	__glibcxx_check_nonempty();
	return _Base::front();
      }

      reference
      back()
      {
	__glibcxx_check_nonempty();
	return _Base::back();
      }

      const_reference
      back() const
      {
	__glibcxx_check_nonempty();
	return _Base::back();
      }

      // _GLIBCXX_RESOLVE_LIB_DEFECTS
      // DR 464. Suggestion for new member functions in standard containers.
      using _Base::data;

      // 23.2.4.3 modifiers:
      void
      push_back(const _Tp& __x)
      {
	bool __realloc = _M_requires_reallocation(this->size() + 1);
	_Base::push_back(__x);
	if (__realloc)
	  this->_M_invalidate_all();
	_M_update_guaranteed_capacity();
      }

#ifdef __GXX_EXPERIMENTAL_CXX0X__
      template<typename _Up = _Tp>
        typename __gnu_cxx::__enable_if<!std::__are_same<_Up, bool>::__value,
					void>::__type
        push_back(_Tp&& __x)
	{ emplace_back(std::move(__x)); }

      template<typename... _Args>
        void
        emplace_back(_Args&&... __args)
	{
	  bool __realloc = _M_requires_reallocation(this->size() + 1);
	  _Base::emplace_back(std::forward<_Args>(__args)...);
	  if (__realloc)
	    this->_M_invalidate_all();
	  _M_update_guaranteed_capacity();
	}
#endif

      void
      pop_back()
      {
	__glibcxx_check_nonempty();
	iterator __victim = end() - 1;
	__victim._M_invalidate();
	_Base::pop_back();
      }

#ifdef __GXX_EXPERIMENTAL_CXX0X__
      template<typename... _Args>
        iterator
        emplace(iterator __position, _Args&&... __args)
	{
	  __glibcxx_check_insert(__position);
	  bool __realloc = _M_requires_reallocation(this->size() + 1);
	  difference_type __offset = __position - begin();
	  typename _Base::iterator __res = _Base::emplace(__position.base(),
					    std::forward<_Args>(__args)...);
	  if (__realloc)
	    this->_M_invalidate_all();
	  else
	    this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
	  _M_update_guaranteed_capacity();
	  return iterator(__res, this);
	}
#endif

      iterator
      insert(iterator __position, const _Tp& __x)
      {
	__glibcxx_check_insert(__position);
	bool __realloc = _M_requires_reallocation(this->size() + 1);
	difference_type __offset = __position - begin();
	typename _Base::iterator __res = _Base::insert(__position.base(),__x);
	if (__realloc)
	  this->_M_invalidate_all();
	else
	  this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
	_M_update_guaranteed_capacity();
	return iterator(__res, this);
      }

#ifdef __GXX_EXPERIMENTAL_CXX0X__
      template<typename _Up = _Tp>
        typename __gnu_cxx::__enable_if<!std::__are_same<_Up, bool>::__value,
					iterator>::__type
        insert(iterator __position, _Tp&& __x)
        { return emplace(__position, std::move(__x)); }

      void
      insert(iterator __position, initializer_list<value_type> __l)
      { this->insert(__position, __l.begin(), __l.end()); }
#endif

      void
      insert(iterator __position, size_type __n, const _Tp& __x)
      {
	__glibcxx_check_insert(__position);
	bool __realloc = _M_requires_reallocation(this->size() + __n);
	difference_type __offset = __position - begin();
	_Base::insert(__position.base(), __n, __x);
	if (__realloc)
	  this->_M_invalidate_all();
	else
	  this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
	_M_update_guaranteed_capacity();
      }

      template<class _InputIterator>
        void
        insert(iterator __position,
	       _InputIterator __first, _InputIterator __last)
        {
	  __glibcxx_check_insert_range(__position, __first, __last);

	  /* Hard to guess if invalidation will occur, because __last
	     - __first can't be calculated in all cases, so we just
	     punt here by checking if it did occur. */
	  typename _Base::iterator __old_begin = _M_base().begin();
	  difference_type __offset = __position - begin();
	  _Base::insert(__position.base(), __first, __last);

	  if (_M_base().begin() != __old_begin)
	    this->_M_invalidate_all();
	  else
	    this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
	  _M_update_guaranteed_capacity();
	}

      iterator
      erase(iterator __position)
      {
	__glibcxx_check_erase(__position);
	difference_type __offset = __position - begin();
	typename _Base::iterator __res = _Base::erase(__position.base());
	this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
	return iterator(__res, this);
      }

      iterator
      erase(iterator __first, iterator __last)
      {
	// _GLIBCXX_RESOLVE_LIB_DEFECTS
	// 151. can't currently clear() empty container
	__glibcxx_check_erase_range(__first, __last);

	difference_type __offset = __first - begin();
	typename _Base::iterator __res = _Base::erase(__first.base(),
							 __last.base());
	this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
	return iterator(__res, this);
      }

      void
#ifdef __GXX_EXPERIMENTAL_CXX0X__
      swap(vector&& __x)
#else
      swap(vector& __x)
#endif
      {
	_Base::swap(__x);
	this->_M_swap(__x);
        std::swap(_M_guaranteed_capacity, __x._M_guaranteed_capacity);
      }

      void
      clear()
      {
	_Base::clear();
	this->_M_invalidate_all();
        _M_guaranteed_capacity = 0;
      }

      _Base&
      _M_base() { return *this; }

      const _Base&
      _M_base() const { return *this; }

    private:
      size_type _M_guaranteed_capacity;

      bool
      _M_requires_reallocation(size_type __elements)
      { return __elements > this->capacity(); }

      void
      _M_update_guaranteed_capacity()
      {
	if (this->size() > _M_guaranteed_capacity)
	  _M_guaranteed_capacity = this->size();
      }
    };

  template<typename _Tp, typename _Alloc>
    inline bool
    operator==(const vector<_Tp, _Alloc>& __lhs,
	       const vector<_Tp, _Alloc>& __rhs)
    { return __lhs._M_base() == __rhs._M_base(); }

  template<typename _Tp, typename _Alloc>
    inline bool
    operator!=(const vector<_Tp, _Alloc>& __lhs,
	       const vector<_Tp, _Alloc>& __rhs)
    { return __lhs._M_base() != __rhs._M_base(); }

  template<typename _Tp, typename _Alloc>
    inline bool
    operator<(const vector<_Tp, _Alloc>& __lhs,
	      const vector<_Tp, _Alloc>& __rhs)
    { return __lhs._M_base() < __rhs._M_base(); }

  template<typename _Tp, typename _Alloc>
    inline bool
    operator<=(const vector<_Tp, _Alloc>& __lhs,
	       const vector<_Tp, _Alloc>& __rhs)
    { return __lhs._M_base() <= __rhs._M_base(); }

  template<typename _Tp, typename _Alloc>
    inline bool
    operator>=(const vector<_Tp, _Alloc>& __lhs,
	       const vector<_Tp, _Alloc>& __rhs)
    { return __lhs._M_base() >= __rhs._M_base(); }

  template<typename _Tp, typename _Alloc>
    inline bool
    operator>(const vector<_Tp, _Alloc>& __lhs,
	      const vector<_Tp, _Alloc>& __rhs)
    { return __lhs._M_base() > __rhs._M_base(); }

  template<typename _Tp, typename _Alloc>
    inline void
    swap(vector<_Tp, _Alloc>& __lhs, vector<_Tp, _Alloc>& __rhs)
    { __lhs.swap(__rhs); }

#ifdef __GXX_EXPERIMENTAL_CXX0X__
  template<typename _Tp, typename _Alloc>
    inline void
    swap(vector<_Tp, _Alloc>&& __lhs, vector<_Tp, _Alloc>& __rhs)
    { __lhs.swap(__rhs); }

  template<typename _Tp, typename _Alloc>
    inline void
    swap(vector<_Tp, _Alloc>& __lhs, vector<_Tp, _Alloc>&& __rhs)
    { __lhs.swap(__rhs); }
#endif

} // namespace __debug
} // namespace std

#endif
Commit	Line	Data
285b36d6 BK	1	// Debugging vector implementation -- C++ --
285b36d6 BK	2
748086b7	3	// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009
285b36d6 BK	4	// Free Software Foundation, Inc.
	5	//
	6	// This file is part of the GNU ISO C++ Library. This library is free
	7	// software; you can redistribute it and/or modify it under the
	8	// terms of the GNU General Public License as published by the
748086b7	9	// Free Software Foundation; either version 3, or (at your option)
285b36d6 BK	10	// any later version.
	11
	12	// This library is distributed in the hope that it will be useful,
	13	// but WITHOUT ANY WARRANTY; without even the implied warranty of
	14	// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
	15	// GNU General Public License for more details.
	16
748086b7 JJ	17	// Under Section 7 of GPL version 3, you are granted additional
	18	// permissions described in the GCC Runtime Library Exception, version
	19	// 3.1, as published by the Free Software Foundation.
	20
	21	// You should have received a copy of the GNU General Public License and
	22	// a copy of the GCC Runtime Library Exception along with this program;
	23	// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
	24	// <http://www.gnu.org/licenses/>.
285b36d6	25
78a53887 BK	26	/** @file debug/vector
	27	* This file is a GNU debug extension to the Standard C++ Library.
	28	*/
	29
285b36d6 BK	30	#ifndef _GLIBCXX_DEBUG_VECTOR
	31	#define _GLIBCXX_DEBUG_VECTOR 1
	32
	33	#include <vector>
d2763ab5	34	#include <utility>
285b36d6 BK	35	#include <debug/safe_sequence.h>
	36	#include <debug/safe_iterator.h>
	37
3cbc7af0 BK	38	namespace std
3cbc7af0 BK	39	{
45f388bb	40	namespace __debug
285b36d6	41	{
526da49c	42	template<typename _Tp,
285b36d6 BK	43	typename _Allocator = std::allocator<_Tp> >
285b36d6 BK	44	class vector
c2ba9709	45	: public _GLIBCXX_STD_D::vector<_Tp, _Allocator>,
285b36d6 BK	46	public __gnu_debug::_Safe_sequence<vector<_Tp, _Allocator> >
285b36d6 BK	47	{
c2ba9709	48	typedef _GLIBCXX_STD_D::vector<_Tp, _Allocator> _Base;
285b36d6 BK	49	typedef __gnu_debug::_Safe_sequence<vector> _Safe_base;
	50
	51	typedef typename _Base::const_iterator _Base_const_iterator;
	52	typedef __gnu_debug::_After_nth_from<_Base_const_iterator> _After_nth;
	53
	54	public:
	55	typedef typename _Base::reference reference;
	56	typedef typename _Base::const_reference const_reference;
	57
526da49c	58	typedef __gnu_debug::_Safe_iterator<typename _Base::iterator,vector>
285b36d6 BK	59	iterator;
	60	typedef __gnu_debug::_Safe_iterator<typename _Base::const_iterator,vector>
	61	const_iterator;
	62
	63	typedef typename _Base::size_type size_type;
	64	typedef typename _Base::difference_type difference_type;
	65
526da49c BI	66	typedef _Tp value_type;
526da49c BI	67	typedef _Allocator allocator_type;
09952acc PC	68	typedef typename _Base::pointer pointer;
09952acc PC	69	typedef typename _Base::const_pointer const_pointer;
285b36d6 BK	70	typedef std::reverse_iterator<iterator> reverse_iterator;
	71	typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
	72
	73	// 23.2.4.1 construct/copy/destroy:
	74	explicit vector(const _Allocator& __a = _Allocator())
	75	: _Base(__a), _M_guaranteed_capacity(0) { }
	76
	77	explicit vector(size_type __n, const _Tp& __value = _Tp(),
	78	const _Allocator& __a = _Allocator())
	79	: _Base(__n, __value, __a), _M_guaranteed_capacity(__n) { }
	80
	81	template<class _InputIterator>
	82	vector(_InputIterator __first, _InputIterator __last,
	83	const _Allocator& __a = _Allocator())
526da49c	84	: _Base(__gnu_debug::__check_valid_range(__first, __last),
285b36d6 BK	85	__last, __a),
	86	_M_guaranteed_capacity(0)
	87	{ _M_update_guaranteed_capacity(); }
	88
ed540c0a	89	vector(const vector& __x)
285b36d6 BK	90	: _Base(__x), _Safe_base(), _M_guaranteed_capacity(__x.size()) { }
	91
	92	/// Construction from a release-mode vector
526da49c	93	vector(const _Base& __x)
285b36d6 BK	94	: _Base(__x), _Safe_base(), _M_guaranteed_capacity(__x.size()) { }
285b36d6 BK	95
ed540c0a CJ	96	#ifdef __GXX_EXPERIMENTAL_CXX0X__
ed540c0a CJ	97	vector(vector&& __x)
cc8c030d PC	98	: _Base(std::forward<vector>(__x)), _Safe_base(),
	99	_M_guaranteed_capacity(this->size())
	100	{
ed540c0a CJ	101	this->_M_swap(__x);
	102	__x._M_guaranteed_capacity = 0;
	103	}
988499f4 JM	104
	105	vector(initializer_list<value_type> __l,
	106	const allocator_type& __a = allocator_type())
b798df05 PC	107	: _Base(__l, __a), _Safe_base(),
b798df05 PC	108	_M_guaranteed_capacity(__l.size()) { }
ed540c0a CJ	109	#endif
ed540c0a CJ	110
285b36d6 BK	111	~vector() { }
285b36d6 BK	112
ed540c0a CJ	113	vector&
ed540c0a CJ	114	operator=(const vector& __x)
285b36d6 BK	115	{
	116	static_cast<_Base&>(*this) = __x;
	117	this->_M_invalidate_all();
	118	_M_update_guaranteed_capacity();
	119	return *this;
	120	}
	121
ed540c0a CJ	122	#ifdef __GXX_EXPERIMENTAL_CXX0X__
	123	vector&
	124	operator=(vector&& __x)
	125	{
cbc6c888 PC	126	// NB: DR 675.
cbc6c888 PC	127	clear();
ed540c0a CJ	128	swap(__x);
	129	return *this;
	130	}
988499f4 JM	131
	132	vector&
	133	operator=(initializer_list<value_type> __l)
	134	{
	135	static_cast<_Base&>(*this) = __l;
	136	this->_M_invalidate_all();
	137	_M_update_guaranteed_capacity();
	138	return *this;
	139	}
ed540c0a CJ	140	#endif
ed540c0a CJ	141
285b36d6	142	template<typename _InputIterator>
526da49c	143	void
285b36d6 BK	144	assign(_InputIterator __first, _InputIterator __last)
	145	{
	146	__glibcxx_check_valid_range(__first, __last);
	147	_Base::assign(__first, __last);
	148	this->_M_invalidate_all();
	149	_M_update_guaranteed_capacity();
	150	}
	151
526da49c	152	void
285b36d6 BK	153	assign(size_type __n, const _Tp& __u)
	154	{
	155	_Base::assign(__n, __u);
	156	this->_M_invalidate_all();
	157	_M_update_guaranteed_capacity();
	158	}
	159
988499f4 JM	160	#ifdef __GXX_EXPERIMENTAL_CXX0X__
	161	void
	162	assign(initializer_list<value_type> __l)
	163	{
	164	_Base::assign(__l);
	165	this->_M_invalidate_all();
	166	_M_update_guaranteed_capacity();
	167	}
	168	#endif
	169
285b36d6 BK	170	using _Base::get_allocator;
	171
	172	// iterators:
526da49c BI	173	iterator
526da49c BI	174	begin()
285b36d6 BK	175	{ return iterator(_Base::begin(), this); }
285b36d6 BK	176
526da49c BI	177	const_iterator
526da49c BI	178	begin() const
285b36d6 BK	179	{ return const_iterator(_Base::begin(), this); }
285b36d6 BK	180
526da49c	181	iterator
285b36d6 BK	182	end()
	183	{ return iterator(_Base::end(), this); }
	184
526da49c	185	const_iterator
285b36d6 BK	186	end() const
	187	{ return const_iterator(_Base::end(), this); }
	188
526da49c BI	189	reverse_iterator
526da49c BI	190	rbegin()
285b36d6 BK	191	{ return reverse_iterator(end()); }
285b36d6 BK	192
526da49c	193	const_reverse_iterator
285b36d6 BK	194	rbegin() const
	195	{ return const_reverse_iterator(end()); }
	196
526da49c BI	197	reverse_iterator
526da49c BI	198	rend()
285b36d6 BK	199	{ return reverse_iterator(begin()); }
285b36d6 BK	200
526da49c BI	201	const_reverse_iterator
526da49c BI	202	rend() const
285b36d6 BK	203	{ return const_reverse_iterator(begin()); }
285b36d6 BK	204
0cd50f89 PC	205	#ifdef __GXX_EXPERIMENTAL_CXX0X__
	206	const_iterator
	207	cbegin() const
	208	{ return const_iterator(_Base::begin(), this); }
	209
	210	const_iterator
	211	cend() const
	212	{ return const_iterator(_Base::end(), this); }
	213
	214	const_reverse_iterator
	215	crbegin() const
	216	{ return const_reverse_iterator(end()); }
	217
	218	const_reverse_iterator
	219	crend() const
	220	{ return const_reverse_iterator(begin()); }
	221	#endif
	222
285b36d6 BK	223	// 23.2.4.2 capacity:
	224	using _Base::size;
	225	using _Base::max_size;
	226
526da49c	227	void
285b36d6 BK	228	resize(size_type __sz, _Tp __c = _Tp())
	229	{
	230	bool __realloc = _M_requires_reallocation(__sz);
	231	if (__sz < this->size())
	232	this->_M_invalidate_if(_After_nth(__sz, _M_base().begin()));
	233	_Base::resize(__sz, __c);
	234	if (__realloc)
	235	this->_M_invalidate_all();
	236	}
	237
2028b66d SS	238	size_type
	239	capacity() const
	240	{
	241	#ifdef _GLIBCXX_DEBUG_PEDANTIC
	242	return _M_guaranteed_capacity;
	243	#else
	244	return _Base::capacity();
	245	#endif
	246	}
	247
285b36d6 BK	248	using _Base::empty;
285b36d6 BK	249
526da49c	250	void
285b36d6 BK	251	reserve(size_type __n)
	252	{
	253	bool __realloc = _M_requires_reallocation(__n);
	254	_Base::reserve(__n);
	255	if (__n > _M_guaranteed_capacity)
	256	_M_guaranteed_capacity = __n;
	257	if (__realloc)
	258	this->_M_invalidate_all();
	259	}
	260
	261	// element access:
526da49c	262	reference
285b36d6 BK	263	operator[](size_type __n)
	264	{
	265	__glibcxx_check_subscript(__n);
	266	return _M_base()[__n];
	267	}
	268
526da49c	269	const_reference
285b36d6 BK	270	operator[](size_type __n) const
	271	{
	272	__glibcxx_check_subscript(__n);
	273	return _M_base()[__n];
	274	}
	275
	276	using _Base::at;
	277
526da49c	278	reference
285b36d6 BK	279	front()
	280	{
	281	__glibcxx_check_nonempty();
	282	return _Base::front();
	283	}
	284
526da49c	285	const_reference
285b36d6 BK	286	front() const
	287	{
	288	__glibcxx_check_nonempty();
	289	return _Base::front();
	290	}
	291
526da49c	292	reference
285b36d6 BK	293	back()
	294	{
	295	__glibcxx_check_nonempty();
	296	return _Base::back();
	297	}
	298
526da49c	299	const_reference
285b36d6 BK	300	back() const
	301	{
	302	__glibcxx_check_nonempty();
	303	return _Base::back();
	304	}
	305
8b5f07a2 PC	306	// _GLIBCXX_RESOLVE_LIB_DEFECTS
	307	// DR 464. Suggestion for new member functions in standard containers.
	308	using _Base::data;
	309
285b36d6	310	// 23.2.4.3 modifiers:
526da49c	311	void
285b36d6 BK	312	push_back(const _Tp& __x)
	313	{
	314	bool __realloc = _M_requires_reallocation(this->size() + 1);
	315	_Base::push_back(__x);
	316	if (__realloc)
	317	this->_M_invalidate_all();
	318	_M_update_guaranteed_capacity();
	319	}
4dc3e453 PC	320
4dc3e453 PC	321	#ifdef __GXX_EXPERIMENTAL_CXX0X__
77f376d9 PC	322	template<typename _Up = _Tp>
	323	typename __gnu_cxx::__enable_if<!std::__are_same<_Up, bool>::__value,
	324	void>::__type
	325	push_back(_Tp&& __x)
	326	{ emplace_back(std::move(__x)); }
4dc3e453	327
6eef7402 CJ	328	template<typename... _Args>
6eef7402 CJ	329	void
4dc3e453	330	emplace_back(_Args&&... __args)
6eef7402 CJ	331	{
6eef7402 CJ	332	bool __realloc = _M_requires_reallocation(this->size() + 1);
4dc3e453	333	_Base::emplace_back(std::forward<_Args>(__args)...);
6eef7402 CJ	334	if (__realloc)
	335	this->_M_invalidate_all();
	336	_M_update_guaranteed_capacity();
	337	}
	338	#endif
285b36d6	339
526da49c	340	void
285b36d6 BK	341	pop_back()
	342	{
	343	__glibcxx_check_nonempty();
	344	iterator __victim = end() - 1;
	345	__victim._M_invalidate();
	346	_Base::pop_back();
	347	}
	348
6eef7402 CJ	349	#ifdef __GXX_EXPERIMENTAL_CXX0X__
	350	template<typename... _Args>
	351	iterator
0a485bae	352	emplace(iterator __position, _Args&&... __args)
6eef7402 CJ	353	{
	354	__glibcxx_check_insert(__position);
	355	bool __realloc = _M_requires_reallocation(this->size() + 1);
	356	difference_type __offset = __position - begin();
	357	typename _Base::iterator __res = _Base::emplace(__position.base(),
	358	std::forward<_Args>(__args)...);
	359	if (__realloc)
	360	this->_M_invalidate_all();
	361	else
	362	this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
	363	_M_update_guaranteed_capacity();
	364	return iterator(__res, this);
	365	}
	366	#endif
	367
526da49c	368	iterator
285b36d6 BK	369	insert(iterator __position, const _Tp& __x)
	370	{
	371	__glibcxx_check_insert(__position);
	372	bool __realloc = _M_requires_reallocation(this->size() + 1);
	373	difference_type __offset = __position - begin();
	374	typename _Base::iterator __res = _Base::insert(__position.base(),__x);
	375	if (__realloc)
	376	this->_M_invalidate_all();
	377	else
	378	this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
	379	_M_update_guaranteed_capacity();
	380	return iterator(__res, this);
	381	}
	382
6eef7402	383	#ifdef __GXX_EXPERIMENTAL_CXX0X__
77f376d9 PC	384	template<typename _Up = _Tp>
	385	typename __gnu_cxx::__enable_if<!std::__are_same<_Up, bool>::__value,
	386	iterator>::__type
	387	insert(iterator __position, _Tp&& __x)
	388	{ return emplace(__position, std::move(__x)); }
988499f4 JM	389
	390	void
	391	insert(iterator __position, initializer_list<value_type> __l)
	392	{ this->insert(__position, __l.begin(), __l.end()); }
6eef7402 CJ	393	#endif
6eef7402 CJ	394
526da49c	395	void
285b36d6 BK	396	insert(iterator __position, size_type __n, const _Tp& __x)
	397	{
	398	__glibcxx_check_insert(__position);
	399	bool __realloc = _M_requires_reallocation(this->size() + __n);
	400	difference_type __offset = __position - begin();
	401	_Base::insert(__position.base(), __n, __x);
	402	if (__realloc)
	403	this->_M_invalidate_all();
	404	else
	405	this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
	406	_M_update_guaranteed_capacity();
	407	}
	408
	409	template<class _InputIterator>
526da49c BI	410	void
526da49c BI	411	insert(iterator __position,
285b36d6 BK	412	_InputIterator __first, _InputIterator __last)
	413	{
	414	__glibcxx_check_insert_range(__position, __first, __last);
526da49c	415
285b36d6 BK	416	/* Hard to guess if invalidation will occur, because __last
	417	- __first can't be calculated in all cases, so we just
	418	punt here by checking if it did occur. */
	419	typename _Base::iterator __old_begin = _M_base().begin();
	420	difference_type __offset = __position - begin();
	421	_Base::insert(__position.base(), __first, __last);
526da49c	422
285b36d6 BK	423	if (_M_base().begin() != __old_begin)
	424	this->_M_invalidate_all();
	425	else
	426	this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
	427	_M_update_guaranteed_capacity();
	428	}
526da49c BI	429
526da49c BI	430	iterator
285b36d6 BK	431	erase(iterator __position)
	432	{
	433	__glibcxx_check_erase(__position);
	434	difference_type __offset = __position - begin();
	435	typename _Base::iterator __res = _Base::erase(__position.base());
	436	this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
	437	return iterator(__res, this);
	438	}
	439
526da49c	440	iterator
285b36d6 BK	441	erase(iterator __first, iterator __last)
	442	{
	443	// _GLIBCXX_RESOLVE_LIB_DEFECTS
	444	// 151. can't currently clear() empty container
	445	__glibcxx_check_erase_range(__first, __last);
526da49c	446
285b36d6	447	difference_type __offset = __first - begin();
526da49c	448	typename _Base::iterator __res = _Base::erase(__first.base(),
285b36d6 BK	449	__last.base());
	450	this->_M_invalidate_if(_After_nth(__offset, _M_base().begin()));
	451	return iterator(__res, this);
	452	}
	453
526da49c	454	void
ed540c0a CJ	455	#ifdef __GXX_EXPERIMENTAL_CXX0X__
	456	swap(vector&& __x)
	457	#else
	458	swap(vector& __x)
	459	#endif
285b36d6 BK	460	{
	461	_Base::swap(__x);
	462	this->_M_swap(__x);
1b80d64a	463	std::swap(_M_guaranteed_capacity, __x._M_guaranteed_capacity);
285b36d6 BK	464	}
285b36d6 BK	465
526da49c	466	void
285b36d6 BK	467	clear()
	468	{
	469	_Base::clear();
	470	this->_M_invalidate_all();
1b80d64a	471	_M_guaranteed_capacity = 0;
285b36d6 BK	472	}
285b36d6 BK	473
526da49c	474	_Base&
285b36d6 BK	475	_M_base() { return *this; }
285b36d6 BK	476
526da49c	477	const _Base&
285b36d6 BK	478	_M_base() const { return *this; }
	479
	480	private:
	481	size_type _M_guaranteed_capacity;
	482
526da49c	483	bool
285b36d6	484	_M_requires_reallocation(size_type __elements)
2028b66d	485	{ return __elements > this->capacity(); }
526da49c BI	486
526da49c BI	487	void
285b36d6 BK	488	_M_update_guaranteed_capacity()
	489	{
	490	if (this->size() > _M_guaranteed_capacity)
	491	_M_guaranteed_capacity = this->size();
	492	}
	493	};
	494
	495	template<typename _Tp, typename _Alloc>
	496	inline bool
	497	operator==(const vector<_Tp, _Alloc>& __lhs,
	498	const vector<_Tp, _Alloc>& __rhs)
	499	{ return __lhs._M_base() == __rhs._M_base(); }
	500
	501	template<typename _Tp, typename _Alloc>
	502	inline bool
526da49c	503	operator!=(const vector<_Tp, _Alloc>& __lhs,
285b36d6 BK	504	const vector<_Tp, _Alloc>& __rhs)
	505	{ return __lhs._M_base() != __rhs._M_base(); }
	506
	507	template<typename _Tp, typename _Alloc>
	508	inline bool
526da49c	509	operator<(const vector<_Tp, _Alloc>& __lhs,
285b36d6 BK	510	const vector<_Tp, _Alloc>& __rhs)
	511	{ return __lhs._M_base() < __rhs._M_base(); }
	512
	513	template<typename _Tp, typename _Alloc>
	514	inline bool
526da49c	515	operator<=(const vector<_Tp, _Alloc>& __lhs,
285b36d6 BK	516	const vector<_Tp, _Alloc>& __rhs)
	517	{ return __lhs._M_base() <= __rhs._M_base(); }
	518
	519	template<typename _Tp, typename _Alloc>
	520	inline bool
526da49c	521	operator>=(const vector<_Tp, _Alloc>& __lhs,
285b36d6 BK	522	const vector<_Tp, _Alloc>& __rhs)
	523	{ return __lhs._M_base() >= __rhs._M_base(); }
	524
	525	template<typename _Tp, typename _Alloc>
	526	inline bool
526da49c	527	operator>(const vector<_Tp, _Alloc>& __lhs,
285b36d6 BK	528	const vector<_Tp, _Alloc>& __rhs)
	529	{ return __lhs._M_base() > __rhs._M_base(); }
	530
	531	template<typename _Tp, typename _Alloc>
	532	inline void
	533	swap(vector<_Tp, _Alloc>& __lhs, vector<_Tp, _Alloc>& __rhs)
	534	{ __lhs.swap(__rhs); }
ed540c0a CJ	535
	536	#ifdef __GXX_EXPERIMENTAL_CXX0X__
	537	template<typename _Tp, typename _Alloc>
	538	inline void
	539	swap(vector<_Tp, _Alloc>&& __lhs, vector<_Tp, _Alloc>& __rhs)
	540	{ __lhs.swap(__rhs); }
	541
	542	template<typename _Tp, typename _Alloc>
	543	inline void
	544	swap(vector<_Tp, _Alloc>& __lhs, vector<_Tp, _Alloc>&& __rhs)
	545	{ __lhs.swap(__rhs); }
	546	#endif
	547
45f388bb	548	} // namespace __debug
3cbc7af0	549	} // namespace std
285b36d6	550
526da49c	551	#endif