williamr@2: /* williamr@2: * © Portions copyright (c) 2006-2007 Nokia Corporation. All rights reserved. williamr@2: * williamr@2: * Copyright (c) 1994 williamr@2: * Hewlett-Packard Company williamr@2: * williamr@2: * Copyright (c) 1996,1997 williamr@2: * Silicon Graphics Computer Systems, Inc. williamr@2: * williamr@2: * Copyright (c) 1997 williamr@2: * Moscow Center for SPARC Technology williamr@2: * williamr@2: * Copyright (c) 1999 williamr@2: * Boris Fomitchev williamr@2: * williamr@2: * This material is provided "as is", with absolutely no warranty expressed williamr@2: * or implied. Any use is at your own risk. williamr@2: * williamr@2: * Permission to use or copy this software for any purpose is hereby granted williamr@2: * without fee, provided the above notices are retained on all copies. williamr@2: * Permission to modify the code and to distribute modified code is granted, williamr@2: * provided the above notices are retained, and a notice that the code was williamr@2: * modified is included with the above copyright notice. williamr@2: * williamr@2: */ williamr@2: williamr@2: /* NOTE: This is an internal header file, included by other STL headers. williamr@2: * You should not attempt to use it directly. williamr@2: */ williamr@2: williamr@2: #ifndef _STLP_INTERNAL_DEQUE_H williamr@2: #define _STLP_INTERNAL_DEQUE_H williamr@2: williamr@2: # ifndef _STLP_INTERNAL_ALGOBASE_H williamr@2: # include williamr@2: # endif williamr@2: williamr@2: # ifndef _STLP_INTERNAL_ALLOC_H williamr@2: # include williamr@2: # endif williamr@2: williamr@2: # ifndef _STLP_INTERNAL_ITERATOR_H williamr@2: # include williamr@2: # endif williamr@2: williamr@2: # ifndef _STLP_INTERNAL_UNINITIALIZED_H williamr@2: # include williamr@2: # endif williamr@2: williamr@2: # ifndef _STLP_RANGE_ERRORS_H williamr@2: # include williamr@2: # endif williamr@2: williamr@2: /* Class invariants: williamr@2: * For any nonsingular iterator i: williamr@2: * i.node is the address of an element in the map array. The williamr@2: * contents of i.node is a pointer to the beginning of a node. williamr@2: * i.first == *(i.node) williamr@2: * i.last == i.first + node_size williamr@2: * i.cur is a pointer in the range [i.first, i.last). NOTE: williamr@2: * the implication of this is that i.cur is always a dereferenceable williamr@2: * pointer, even if i is a past-the-end iterator. williamr@2: * Start and Finish are always nonsingular iterators. NOTE: this means williamr@2: * that an empty deque must have one node, and that a deque williamr@2: * with N elements, where N is the buffer size, must have two nodes. williamr@2: * For every node other than start.node and finish.node, every element williamr@2: * in the node is an initialized object. If start.node == finish.node, williamr@2: * then [start.cur, finish.cur) are initialized objects, and williamr@2: * the elements outside that range are uninitialized storage. Otherwise, williamr@2: * [start.cur, start.last) and [finish.first, finish.cur) are initialized williamr@2: * objects, and [start.first, start.cur) and [finish.cur, finish.last) williamr@2: * are uninitialized storage. williamr@2: * [map, map + map_size) is a valid, non-empty range. williamr@2: * [start.node, finish.node] is a valid range contained within williamr@2: * [map, map + map_size). williamr@2: * A pointer in the range [map, map + map_size) points to an allocated node williamr@2: * if and only if the pointer is in the range [start.node, finish.node]. williamr@2: */ williamr@2: williamr@2: # undef deque williamr@2: # define deque __WORKAROUND_DBG_RENAME(deque) williamr@2: williamr@2: _STLP_BEGIN_NAMESPACE williamr@2: williamr@2: template williamr@2: struct _Deque_iterator_base { williamr@2: williamr@2: enum _Constants { williamr@2: _blocksize = _MAX_BYTES, williamr@2: __buffer_size = (sizeof(_Tp) < (size_t)_blocksize ? williamr@2: ( (size_t)_blocksize / sizeof(_Tp)) : size_t(1)) williamr@2: }; williamr@2: williamr@2: typedef random_access_iterator_tag iterator_category; williamr@2: williamr@2: typedef _Tp value_type; williamr@2: typedef size_t size_type; williamr@2: typedef ptrdiff_t difference_type; williamr@2: williamr@2: typedef value_type** _Map_pointer; williamr@2: williamr@2: typedef _Deque_iterator_base< _Tp > _Self; williamr@2: williamr@2: value_type* _M_cur; williamr@2: value_type* _M_first; williamr@2: value_type* _M_last; williamr@2: _Map_pointer _M_node; williamr@2: williamr@2: _Deque_iterator_base(value_type* __x, _Map_pointer __y) williamr@2: : _M_cur(__x), _M_first(*__y), williamr@2: _M_last(*__y + __buffer_size), _M_node(__y) {} williamr@2: _Deque_iterator_base() : _M_cur(0), _M_first(0), _M_last(0), _M_node(0) {} williamr@2: williamr@2: difference_type _M_subtract(const _Self& __x) const { williamr@2: return difference_type(__buffer_size) * (_M_node - __x._M_node - 1) + williamr@2: (_M_cur - _M_first) + (__x._M_last - __x._M_cur); williamr@2: } williamr@2: williamr@2: void _M_increment() { williamr@2: if (++_M_cur == _M_last) { williamr@2: _M_set_node(_M_node + 1); williamr@2: _M_cur = _M_first; williamr@2: } williamr@2: } williamr@2: williamr@2: void _M_decrement() { williamr@2: if (_M_cur == _M_first) { williamr@2: _M_set_node(_M_node - 1); williamr@2: _M_cur = _M_last; williamr@2: } williamr@2: --_M_cur; williamr@2: } williamr@2: williamr@2: void _M_advance(difference_type __n) williamr@2: { williamr@2: difference_type __offset = __n + (_M_cur - _M_first); williamr@2: if (__offset >= 0 && __offset < difference_type(__buffer_size)) williamr@2: _M_cur += __n; williamr@2: else { williamr@2: difference_type __node_offset = williamr@2: __offset > 0 ? __offset / __buffer_size williamr@2: : -difference_type((-__offset - 1) / __buffer_size) - 1; williamr@2: _M_set_node(_M_node + __node_offset); williamr@2: _M_cur = _M_first + williamr@2: (__offset - __node_offset * difference_type(__buffer_size)); williamr@2: } williamr@2: } williamr@2: williamr@2: void _M_set_node(_Map_pointer __new_node) { williamr@2: _M_last = (_M_first = *(_M_node = __new_node)) + difference_type(__buffer_size); williamr@2: } williamr@2: }; williamr@2: williamr@2: williamr@2: williamr@2: template williamr@2: struct _Deque_iterator : public _Deque_iterator_base< _Tp> { williamr@2: williamr@2: typedef random_access_iterator_tag iterator_category; williamr@2: typedef _Tp value_type; williamr@2: typedef typename _Traits::reference reference; williamr@2: typedef typename _Traits::pointer pointer; williamr@2: typedef size_t size_type; williamr@2: typedef ptrdiff_t difference_type; williamr@2: typedef value_type** _Map_pointer; williamr@2: williamr@2: typedef _Deque_iterator_base< _Tp > _Base; williamr@2: typedef _Deque_iterator<_Tp, _Traits> _Self; williamr@2: typedef _Deque_iterator<_Tp, _Nonconst_traits<_Tp> > _Nonconst_self; williamr@2: typedef _Deque_iterator<_Tp, _Const_traits<_Tp> > _Const_self; williamr@2: williamr@2: _Deque_iterator(value_type* __x, _Map_pointer __y) : williamr@2: _Deque_iterator_base(__x,__y) {} williamr@2: williamr@2: _Deque_iterator() {} williamr@2: _Deque_iterator(const _Nonconst_self& __x) : williamr@2: _Deque_iterator_base(__x) {} williamr@2: williamr@2: reference operator*() const { williamr@2: return *this->_M_cur; williamr@2: } williamr@2: williamr@2: _STLP_DEFINE_ARROW_OPERATOR williamr@2: williamr@2: difference_type operator-(const _Self& __x) const { return this->_M_subtract(__x); } williamr@2: williamr@2: _Self& operator++() { this->_M_increment(); return *this; } williamr@2: _Self operator++(int) { williamr@2: _Self __tmp = *this; williamr@2: ++*this; williamr@2: return __tmp; williamr@2: } williamr@2: williamr@2: _Self& operator--() { this->_M_decrement(); return *this; } williamr@2: _Self operator--(int) { williamr@2: _Self __tmp = *this; williamr@2: --*this; williamr@2: return __tmp; williamr@2: } williamr@2: williamr@2: _Self& operator+=(difference_type __n) { this->_M_advance(__n); return *this; } williamr@2: _Self operator+(difference_type __n) const williamr@2: { williamr@2: _Self __tmp = *this; williamr@2: return __tmp += __n; williamr@2: } williamr@2: williamr@2: _Self& operator-=(difference_type __n) { return *this += -__n; } williamr@2: _Self operator-(difference_type __n) const { williamr@2: _Self __tmp = *this; williamr@2: return __tmp -= __n; williamr@2: } williamr@2: williamr@2: reference operator[](difference_type __n) const { return *(*this + __n); } williamr@2: }; williamr@2: williamr@2: template williamr@2: inline _Deque_iterator<_Tp, _Traits> _STLP_CALL williamr@2: operator+(ptrdiff_t __n, const _Deque_iterator<_Tp, _Traits>& __x) williamr@2: { williamr@2: return __x + __n; williamr@2: } williamr@2: williamr@2: williamr@2: #ifdef _STLP_USE_SEPARATE_RELOPS_NAMESPACE williamr@2: williamr@2: template williamr@2: inline bool _STLP_CALL williamr@2: operator==(const _Deque_iterator_base<_Tp >& __x, williamr@2: const _Deque_iterator_base<_Tp >& __y) { williamr@2: return __x._M_cur == __y._M_cur; williamr@2: } williamr@2: williamr@2: template williamr@2: inline bool _STLP_CALL williamr@2: operator < (const _Deque_iterator_base<_Tp >& __x, williamr@2: const _Deque_iterator_base<_Tp >& __y) { williamr@2: return (__x._M_node == __y._M_node) ? williamr@2: (__x._M_cur < __y._M_cur) : (__x._M_node < __y._M_node); williamr@2: } williamr@2: williamr@2: template williamr@2: inline bool _STLP_CALL williamr@2: operator!=(const _Deque_iterator_base<_Tp >& __x, williamr@2: const _Deque_iterator_base<_Tp >& __y) { williamr@2: return __x._M_cur != __y._M_cur; williamr@2: } williamr@2: template williamr@2: inline bool _STLP_CALL williamr@2: operator>(const _Deque_iterator_base<_Tp >& __x, williamr@2: const _Deque_iterator_base<_Tp >& __y) { williamr@2: return __y < __x; williamr@2: } williamr@2: template williamr@2: inline bool _STLP_CALL operator>=(const _Deque_iterator_base<_Tp >& __x, williamr@2: const _Deque_iterator_base<_Tp >& __y) { williamr@2: return !(__x < __y); williamr@2: } williamr@2: template williamr@2: inline bool _STLP_CALL operator<=(const _Deque_iterator_base<_Tp >& __x, williamr@2: const _Deque_iterator_base<_Tp >& __y) { williamr@2: return !(__y < __x); williamr@2: } williamr@2: williamr@2: # else williamr@2: williamr@2: template williamr@2: inline bool _STLP_CALL williamr@2: operator==(const _Deque_iterator<_Tp, _Traits1 >& __x, williamr@2: const _Deque_iterator<_Tp, _Traits2 >& __y) { williamr@2: return __x._M_cur == __y._M_cur; williamr@2: } williamr@2: williamr@2: template williamr@2: inline bool _STLP_CALL williamr@2: operator < (const _Deque_iterator<_Tp, _Traits1 >& __x, williamr@2: const _Deque_iterator<_Tp, _Traits2 >& __y) { williamr@2: return (__x._M_node == __y._M_node) ? williamr@2: (__x._M_cur < __y._M_cur) : (__x._M_node < __y._M_node); williamr@2: } williamr@2: williamr@2: template williamr@2: inline bool _STLP_CALL williamr@2: operator!=(const _Deque_iterator<_Tp, _Nonconst_traits<_Tp> >& __x, williamr@2: const _Deque_iterator<_Tp, _Const_traits<_Tp> >& __y) { williamr@2: return __x._M_cur != __y._M_cur; williamr@2: } williamr@2: template williamr@2: inline bool _STLP_CALL williamr@2: operator>(const _Deque_iterator<_Tp, _Nonconst_traits<_Tp> >& __x, williamr@2: const _Deque_iterator<_Tp, _Const_traits<_Tp> >& __y) { williamr@2: return __y < __x; williamr@2: } williamr@2: template williamr@2: inline bool _STLP_CALL williamr@2: operator>=(const _Deque_iterator<_Tp, _Nonconst_traits<_Tp> >& __x, williamr@2: const _Deque_iterator<_Tp, _Const_traits<_Tp> >& __y) { williamr@2: return !(__x < __y); williamr@2: } williamr@2: template williamr@2: inline bool _STLP_CALL williamr@2: operator<=(const _Deque_iterator<_Tp, _Nonconst_traits<_Tp> >& __x, williamr@2: const _Deque_iterator<_Tp, _Const_traits<_Tp> >& __y) { williamr@2: return !(__y < __x); williamr@2: } williamr@2: # endif williamr@2: williamr@2: # ifdef _STLP_USE_OLD_HP_ITERATOR_QUERIES williamr@2: template inline _Tp* _STLP_CALL value_type(const _Deque_iterator<_Tp, _Traits >&) { return (_Tp*)0; } williamr@2: template inline random_access_iterator_tag _STLP_CALL williamr@2: iterator_category(const _Deque_iterator<_Tp, _Traits >&) { return random_access_iterator_tag(); } williamr@2: template inline ptrdiff_t* _STLP_CALL williamr@2: distance_type(const _Deque_iterator<_Tp, _Traits >&) { return 0; } williamr@2: #endif williamr@2: williamr@2: // Deque base class. It has two purposes. First, its constructor williamr@2: // and destructor allocate (but don't initialize) storage. This makes williamr@2: // exception safety easier. Second, the base class encapsulates all of williamr@2: // the differences between SGI-style allocators and standard-conforming williamr@2: // allocators. williamr@2: williamr@2: template williamr@2: class _Deque_base williamr@2: { williamr@2: public: williamr@2: typedef _Tp value_type; williamr@2: _STLP_FORCE_ALLOCATORS(_Tp, _Alloc) williamr@2: typedef typename _Alloc_traits<_Tp,_Alloc>::allocator_type allocator_type; williamr@2: typedef typename _Alloc_traits<_Tp*, _Alloc>::allocator_type _Map_alloc_type; williamr@2: williamr@2: typedef _Deque_iterator<_Tp, _Nonconst_traits<_Tp> > iterator; williamr@2: typedef _Deque_iterator<_Tp, _Const_traits<_Tp> > const_iterator; williamr@2: williamr@2: typedef _Deque_base<_Tp, _Alloc> _Base; williamr@2: williamr@2: static size_t _STLP_CALL buffer_size() { return (size_t)_Deque_iterator_base<_Tp>::__buffer_size; } williamr@2: williamr@2: _Deque_base(const allocator_type& __a, size_t __num_elements) williamr@2: : _M_start(), _M_finish(), _M_map(_STLP_CONVERT_ALLOCATOR(__a, _Tp*), 0), williamr@2: _M_map_size(__a, (size_t)0) { williamr@2: _STLP_PUSH_CLEANUP_ITEM(_Base, this) williamr@2: _M_initialize_map(__num_elements); williamr@2: } williamr@2: _Deque_base(const allocator_type& __a) williamr@2: : _M_start(), _M_finish(), _M_map(_STLP_CONVERT_ALLOCATOR(__a, _Tp*), 0), williamr@2: _M_map_size(__a, (size_t)0) { williamr@2: _STLP_PUSH_CLEANUP_ITEM(_Base, this) williamr@2: } williamr@2: ~_Deque_base(); williamr@2: williamr@2: protected: williamr@2: void _M_initialize_map(size_t); williamr@2: void _M_create_nodes(_Tp** __nstart, _Tp** __nfinish); williamr@2: void _M_destroy_nodes(_Tp** __nstart, _Tp** __nfinish); williamr@2: enum { _S_initial_map_size = 8 }; williamr@2: williamr@2: protected: williamr@2: iterator _M_start; williamr@2: iterator _M_finish; williamr@2: _STLP_alloc_proxy _M_map; williamr@2: _STLP_alloc_proxy _M_map_size; williamr@2: }; williamr@2: williamr@2: williamr@2: template williamr@2: class deque : public _Deque_base<_Tp, _Alloc> { williamr@2: typedef _Deque_base<_Tp, _Alloc> _Base; williamr@2: typedef deque<_Tp, _Alloc> _Self; williamr@2: public: // Basic types williamr@2: typedef _Tp value_type; williamr@2: typedef value_type* pointer; williamr@2: typedef const value_type* const_pointer; williamr@2: typedef value_type& reference; williamr@2: typedef const value_type& const_reference; williamr@2: typedef size_t size_type; williamr@2: typedef ptrdiff_t difference_type; williamr@2: typedef random_access_iterator_tag _Iterator_category; williamr@2: _STLP_FORCE_ALLOCATORS(_Tp, _Alloc) williamr@2: typedef typename _Base::allocator_type allocator_type; williamr@2: williamr@2: public: // Iterators williamr@2: typedef typename _Base::iterator iterator; williamr@2: typedef typename _Base::const_iterator const_iterator; williamr@2: williamr@2: _STLP_DECLARE_RANDOM_ACCESS_REVERSE_ITERATORS; williamr@2: williamr@2: protected: // Internal typedefs williamr@2: typedef pointer* _Map_pointer; williamr@2: typedef typename __type_traits<_Tp>::has_trivial_assignment_operator _TrivialAss; williamr@2: typedef typename __type_traits<_Tp>::has_trivial_assignment_operator _IsPODType; williamr@2: williamr@2: public: // Basic accessors williamr@2: iterator begin() { return this->_M_start; } williamr@2: iterator end() { return this->_M_finish; } williamr@2: const_iterator begin() const { return const_iterator(this->_M_start); } williamr@2: const_iterator end() const { return const_iterator(this->_M_finish); } williamr@2: williamr@2: reverse_iterator rbegin() { return reverse_iterator(this->_M_finish); } williamr@2: reverse_iterator rend() { return reverse_iterator(this->_M_start); } williamr@2: const_reverse_iterator rbegin() const williamr@2: { return const_reverse_iterator(this->_M_finish); } williamr@2: const_reverse_iterator rend() const williamr@2: { return const_reverse_iterator(this->_M_start); } williamr@2: williamr@2: reference operator[](size_type __n) williamr@2: { return this->_M_start[difference_type(__n)]; } williamr@2: const_reference operator[](size_type __n) const williamr@2: { return this->_M_start[difference_type(__n)]; } williamr@2: williamr@2: void _M_range_check(size_type __n) const { williamr@2: if (__n >= this->size()) williamr@2: __stl_throw_out_of_range("deque"); williamr@2: } williamr@2: reference at(size_type __n) williamr@2: { _M_range_check(__n); return (*this)[__n]; } williamr@2: const_reference at(size_type __n) const williamr@2: { _M_range_check(__n); return (*this)[__n]; } williamr@2: williamr@2: reference front() { return *this->_M_start; } williamr@2: reference back() { williamr@2: iterator __tmp = this->_M_finish; williamr@2: --__tmp; williamr@2: return *__tmp; williamr@2: } williamr@2: const_reference front() const { return *this->_M_start; } williamr@2: const_reference back() const { williamr@2: const_iterator __tmp = this->_M_finish; williamr@2: --__tmp; williamr@2: return *__tmp; williamr@2: } williamr@2: williamr@2: size_type size() const { return this->_M_finish - this->_M_start; } williamr@2: size_type max_size() const { return size_type(-1); } williamr@2: bool empty() const { return this->_M_finish == this->_M_start; } williamr@2: allocator_type get_allocator() const { return this->_M_map_size; } williamr@2: williamr@2: public: // Constructor, destructor. williamr@2: explicit deque(const allocator_type& __a = allocator_type()) williamr@2: : _Deque_base<_Tp, _Alloc>(__a, 0) { williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: williamr@2: deque(const _Self& __x) : williamr@2: _Deque_base<_Tp, _Alloc>(__x.get_allocator(), __x.size()) { williamr@2: uninitialized_copy(__x.begin(), __x.end(), this->_M_start); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: williamr@2: deque(size_type __n, const value_type& __val, williamr@2: const allocator_type& __a = allocator_type()) : williamr@2: _Deque_base<_Tp, _Alloc>(__a, __n) williamr@2: { williamr@2: _M_fill_initialize(__val); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: // int,long variants may be needed williamr@2: explicit deque(size_type __n) : _Deque_base<_Tp, _Alloc>(allocator_type(), __n) williamr@2: { williamr@2: #ifdef __SYMBIAN32__ williamr@2: // Though the below code is for Symbian williamr@2: // we are not using cleanup stack with this version. williamr@2: _M_fill_initialize(value_type()); williamr@2: #else williamr@2: value_type __p; williamr@2: _STLP_PUSH_CLEANUP_ITEM(_Tp, &__p) williamr@2: _M_fill_initialize(__p); williamr@2: // unconditional for __p williamr@2: // CleanupStack::Pop(); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: #endif // __SYMBIAN32__ williamr@2: } williamr@2: williamr@2: #ifdef _STLP_MEMBER_TEMPLATES williamr@2: williamr@2: template williamr@2: void _M_initialize_dispatch(_Integer __n, _Integer __x, const __true_type&) { williamr@2: this->_M_initialize_map(__n); williamr@2: _M_fill_initialize(__x); williamr@2: } williamr@2: williamr@2: template williamr@2: void _M_initialize_dispatch(_InputIter __first, _InputIter __last, williamr@2: const __false_type&) { williamr@2: _M_range_initialize(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIter)); williamr@2: } williamr@2: williamr@2: # ifdef _STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS williamr@2: // VC++ needs this williamr@2: template williamr@2: deque(_InputIterator __first, _InputIterator __last) : williamr@2: _Deque_base<_Tp, _Alloc>(allocator_type()) { williamr@2: typedef typename _Is_integer<_InputIterator>::_Integral _Integral; williamr@2: _M_initialize_dispatch(__first, __last, _Integral()); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: # endif williamr@2: williamr@2: // Check whether it's an integral type. If so, it's not an iterator. williamr@2: template williamr@2: deque(_InputIterator __first, _InputIterator __last, williamr@2: const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL) : williamr@2: _Deque_base<_Tp, _Alloc>(__a) { williamr@2: typedef typename _Is_integer<_InputIterator>::_Integral _Integral; williamr@2: _M_initialize_dispatch(__first, __last, _Integral()); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: williamr@2: # else williamr@2: deque(const value_type* __first, const value_type* __last, williamr@2: const allocator_type& __a = allocator_type() ) williamr@2: : _Deque_base<_Tp, _Alloc>(__a, __last - __first) { williamr@2: __uninitialized_copy(__first, __last, this->_M_start, _IsPODType()); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: williamr@2: deque(const_iterator __first, const_iterator __last, williamr@2: const allocator_type& __a = allocator_type() ) williamr@2: : _Deque_base<_Tp, _Alloc>(__a, __last - __first) { williamr@2: __uninitialized_copy(__first, __last, this->_M_start, _IsPODType()); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: ~deque() { williamr@2: _STLP_STD::_Destroy(this->_M_start, this->_M_finish); williamr@2: } williamr@2: williamr@2: _Self& operator= (const _Self& __x); williamr@2: williamr@2: void swap(_Self& __x) { williamr@2: _STLP_STD::swap(this->_M_start, __x._M_start); williamr@2: _STLP_STD::swap(this->_M_finish, __x._M_finish); williamr@2: _STLP_STD::swap(this->_M_map, __x._M_map); williamr@2: _STLP_STD::swap(this->_M_map_size, __x._M_map_size); williamr@2: } williamr@2: williamr@2: #ifdef _STLP_USE_TRAP_LEAVE williamr@2: public: williamr@2: static void* operator new (size_t __n, TLeave) { return _STLP_StackHelper::_NewLC(__n); } williamr@2: static void* operator new (size_t __n) { return _STLP_StackHelper::_NewLC(__n); } williamr@2: #endif williamr@2: williamr@2: public: williamr@2: // assign(), a generalized assignment member function. Two williamr@2: // versions: one that takes a count, and one that takes a range. williamr@2: // The range version is a member template, so we dispatch on whether williamr@2: // or not the type is an integer. williamr@2: williamr@2: void _M_fill_assign(size_type __n, const _Tp& __val) { williamr@2: if (__n > size()) { williamr@2: _STLP_STD::fill(begin(), end(), __val); williamr@2: insert(end(), __n - size(), __val); williamr@2: } williamr@2: else { williamr@2: erase(begin() + __n, end()); williamr@2: _STLP_STD::fill(begin(), end(), __val); williamr@2: } williamr@2: } williamr@2: williamr@2: void assign(size_type __n, const _Tp& __val) { williamr@2: _M_fill_assign(__n, __val); williamr@2: } williamr@2: williamr@2: #ifdef _STLP_MEMBER_TEMPLATES williamr@2: williamr@2: template williamr@2: void assign(_InputIterator __first, _InputIterator __last) { williamr@2: typedef typename _Is_integer<_InputIterator>::_Integral _Integral; williamr@2: _M_assign_dispatch(__first, __last, _Integral()); williamr@2: } williamr@2: williamr@2: private: // helper functions for assign() williamr@2: williamr@2: template williamr@2: void _M_assign_dispatch(_Integer __n, _Integer __val, const __true_type&) williamr@2: { _M_fill_assign((size_type) __n, (_Tp) __val); } williamr@2: williamr@2: template williamr@2: void _M_assign_dispatch(_InputIterator __first, _InputIterator __last, williamr@2: const __false_type&) { williamr@2: _M_assign_aux(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator)); williamr@2: } williamr@2: williamr@2: template williamr@2: void _M_assign_aux(_InputIter __first, _InputIter __last, const input_iterator_tag &) { williamr@2: iterator __cur = begin(); williamr@2: for ( ; __first != __last && __cur != end(); ++__cur, ++__first) williamr@2: *__cur = *__first; williamr@2: if (__first == __last) williamr@2: erase(__cur, end()); williamr@2: else williamr@2: insert(end(), __first, __last); williamr@2: } williamr@2: williamr@2: template williamr@2: void _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, williamr@2: const forward_iterator_tag &) { williamr@2: size_type __len = distance(__first, __last); williamr@2: if (__len > size()) { williamr@2: _ForwardIterator __mid = __first; williamr@2: advance(__mid, size()); williamr@2: copy(__first, __mid, begin()); williamr@2: insert(end(), __mid, __last); williamr@2: } williamr@2: else williamr@2: erase(copy(__first, __last, begin()), end()); williamr@2: } williamr@2: williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: public: // push_* and pop_* williamr@2: williamr@2: void push_back(const value_type& __t) { williamr@2: if (this->_M_finish._M_cur != this->_M_finish._M_last - 1) { williamr@2: _Construct(this->_M_finish._M_cur, __t); williamr@2: ++this->_M_finish._M_cur; williamr@2: } williamr@2: else williamr@2: _M_push_back_aux_v(__t); williamr@2: } williamr@2: void push_front(const value_type& __t) { williamr@2: if (this->_M_start._M_cur != this->_M_start._M_first) { williamr@2: _Construct(this->_M_start._M_cur - 1, __t); williamr@2: --this->_M_start._M_cur; williamr@2: } williamr@2: else williamr@2: _M_push_front_aux_v(__t); williamr@2: } williamr@2: williamr@2: # ifndef _STLP_NO_ANACHRONISMS williamr@2: void push_back() { williamr@2: if (this->_M_finish._M_cur != this->_M_finish._M_last - 1) { williamr@2: _Construct(this->_M_finish._M_cur); williamr@2: ++this->_M_finish._M_cur; williamr@2: } williamr@2: else williamr@2: _M_push_back_aux(); williamr@2: } williamr@2: void push_front() { williamr@2: if (this->_M_start._M_cur != this->_M_start._M_first) { williamr@2: _Construct(this->_M_start._M_cur - 1); williamr@2: --this->_M_start._M_cur; williamr@2: } williamr@2: else williamr@2: _M_push_front_aux(); williamr@2: } williamr@2: # endif williamr@2: williamr@2: void pop_back() { williamr@2: if (this->_M_finish._M_cur != this->_M_finish._M_first) { williamr@2: --this->_M_finish._M_cur; williamr@2: _STLP_STD::_Destroy(this->_M_finish._M_cur); williamr@2: } williamr@2: else williamr@2: _M_pop_back_aux(); williamr@2: } williamr@2: williamr@2: void pop_front() { williamr@2: if (this->_M_start._M_cur != this->_M_start._M_last - 1) { williamr@2: _STLP_STD::_Destroy(this->_M_start._M_cur); williamr@2: ++this->_M_start._M_cur; williamr@2: } williamr@2: else williamr@2: _M_pop_front_aux(); williamr@2: } williamr@2: williamr@2: public: // Insert williamr@2: williamr@2: iterator insert(iterator __position, const value_type& __x) { williamr@2: if (__position._M_cur == this->_M_start._M_cur) { williamr@2: push_front(__x); williamr@2: return this->_M_start; williamr@2: } williamr@2: else if (__position._M_cur == this->_M_finish._M_cur) { williamr@2: push_back(__x); williamr@2: iterator __tmp = this->_M_finish; williamr@2: --__tmp; williamr@2: return __tmp; williamr@2: } williamr@2: else { williamr@2: return _M_insert_aux(__position, __x); williamr@2: } williamr@2: } williamr@2: williamr@2: iterator insert(iterator __position) williamr@2: { return insert(__position, value_type()); } williamr@2: williamr@2: void insert(iterator __pos, size_type __n, const value_type& __x) { williamr@2: _M_fill_insert(__pos, __n, __x); williamr@2: } williamr@2: williamr@2: void _M_fill_insert(iterator __pos, size_type __n, const value_type& __x); williamr@2: williamr@2: #ifdef _STLP_MEMBER_TEMPLATES williamr@2: williamr@2: // Check whether it's an integral type. If so, it's not an iterator. williamr@2: template williamr@2: void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { williamr@2: typedef typename _Is_integer<_InputIterator>::_Integral _Integral; williamr@2: _M_insert_dispatch(__pos, __first, __last, _Integral()); williamr@2: } williamr@2: williamr@2: template williamr@2: void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, williamr@2: const __true_type&) { williamr@2: _M_fill_insert(__pos, (size_type) __n, (value_type) __x); williamr@2: } williamr@2: williamr@2: template williamr@2: void _M_insert_dispatch(iterator __pos, williamr@2: _InputIterator __first, _InputIterator __last, williamr@2: const __false_type&) { williamr@2: insert(__pos, __first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator)); williamr@2: } williamr@2: williamr@2: #else /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: void insert(iterator __pos, williamr@2: const value_type* __first, const value_type* __last); williamr@2: void insert(iterator __pos, williamr@2: const_iterator __first, const_iterator __last); williamr@2: williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: void resize(size_type __new_size, value_type __x) { williamr@2: const size_type __len = size(); williamr@2: if (__new_size < __len) williamr@2: erase(this->_M_start + __new_size, this->_M_finish); williamr@2: else williamr@2: insert(this->_M_finish, __new_size - __len, __x); williamr@2: } williamr@2: williamr@2: void resize(size_type new_size) { resize(new_size, value_type()); } williamr@2: williamr@2: public: // Erase williamr@2: iterator erase(iterator __pos) { williamr@2: iterator __next = __pos; williamr@2: ++__next; williamr@2: difference_type __index = __pos - this->_M_start; williamr@2: if (size_type(__index) < this->size() >> 1) { williamr@2: copy_backward(this->_M_start, __pos, __next); williamr@2: pop_front(); williamr@2: } williamr@2: else { williamr@2: copy(__next, this->_M_finish, __pos); williamr@2: pop_back(); williamr@2: } williamr@2: return this->_M_start + __index; williamr@2: } williamr@2: williamr@2: iterator erase(iterator __first, iterator __last); williamr@2: void clear(); williamr@2: williamr@2: protected: // Internal construction/destruction williamr@2: williamr@2: void _M_fill_initialize(const value_type& __val); williamr@2: williamr@2: #ifdef _STLP_MEMBER_TEMPLATES williamr@2: williamr@2: template williamr@2: void _M_range_initialize(_InputIterator __first, williamr@2: _InputIterator __last, williamr@2: const input_iterator_tag &) { williamr@2: this->_M_initialize_map(0); williamr@2: _STLP_TRY { williamr@2: for ( ; __first != __last; ++__first) williamr@2: push_back(*__first); williamr@2: } williamr@2: _STLP_UNWIND(clear()); williamr@2: } williamr@2: template williamr@2: void _M_range_initialize(_ForwardIterator __first, williamr@2: _ForwardIterator __last, williamr@2: const forward_iterator_tag &) { williamr@2: size_type __n = distance(__first, __last); williamr@2: this->_M_initialize_map(__n); williamr@2: _STLP_LEAVE_VOLATILE _Map_pointer __cur_node = 0 ; williamr@2: _STLP_TRY { williamr@2: for (__cur_node = this->_M_start._M_node; williamr@2: __cur_node < this->_M_finish._M_node; williamr@2: ++__cur_node) { williamr@2: _ForwardIterator __mid = __first; williamr@2: advance(__mid, this->buffer_size()); williamr@2: uninitialized_copy(__first, __mid, *__cur_node); williamr@2: __first = __mid; williamr@2: } williamr@2: uninitialized_copy(__first, __last, this->_M_finish._M_first); williamr@2: } williamr@2: _STLP_UNWIND(_STLP_STD::_Destroy(this->_M_start, iterator(*__cur_node, __cur_node))); williamr@2: } williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: protected: // Internal push_* and pop_* williamr@2: williamr@2: void _M_push_back_aux_v(const value_type&); williamr@2: void _M_push_front_aux_v(const value_type&); williamr@2: # ifndef _STLP_NO_ANACHRONISMS williamr@2: void _M_push_back_aux(); williamr@2: void _M_push_front_aux(); williamr@2: # endif williamr@2: void _M_pop_back_aux(); williamr@2: void _M_pop_front_aux(); williamr@2: williamr@2: protected: // Internal insert functions williamr@2: williamr@2: #ifdef _STLP_MEMBER_TEMPLATES williamr@2: williamr@2: template williamr@2: void williamr@2: insert(iterator __pos, williamr@2: _InputIterator __first, williamr@2: _InputIterator __last, williamr@2: const input_iterator_tag &) williamr@2: { williamr@2: copy(__first, __last, inserter(*this, __pos)); williamr@2: } williamr@2: williamr@2: template williamr@2: void insert(iterator __pos, williamr@2: _ForwardIterator __first, williamr@2: _ForwardIterator __last, williamr@2: const forward_iterator_tag &) williamr@2: { williamr@2: size_type __n = distance(__first, __last); williamr@2: if (__pos._M_cur == this->_M_start._M_cur) { williamr@2: iterator __new_start = _M_reserve_elements_at_front(__n); williamr@2: _STLP_TRY { williamr@2: uninitialized_copy(__first, __last, __new_start); williamr@2: this->_M_start = __new_start; williamr@2: } williamr@2: _STLP_UNWIND(this->_M_destroy_nodes(__new_start._M_node, this->_M_start._M_node)); williamr@2: } williamr@2: else if (__pos._M_cur == this->_M_finish._M_cur) { williamr@2: iterator __new_finish = _M_reserve_elements_at_back(__n); williamr@2: _STLP_TRY { williamr@2: uninitialized_copy(__first, __last, this->_M_finish); williamr@2: this->_M_finish = __new_finish; williamr@2: } williamr@2: _STLP_UNWIND(this->_M_destroy_nodes(this->_M_finish._M_node + 1, __new_finish._M_node + 1)); williamr@2: } williamr@2: else williamr@2: _M_insert_aux(__pos, __first, __last, __n); williamr@2: } williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: iterator _M_insert_aux(iterator __pos, const value_type& __x); williamr@2: iterator _M_insert_aux(iterator __pos); williamr@2: iterator _M_insert_aux_prepare(iterator __pos); williamr@2: williamr@2: void _M_insert_aux(iterator __pos, size_type __n, const value_type& __x); williamr@2: williamr@2: #ifdef _STLP_MEMBER_TEMPLATES williamr@2: template williamr@2: void _M_insert_aux(iterator __pos, williamr@2: _ForwardIterator __first, williamr@2: _ForwardIterator __last, williamr@2: size_type __n) { williamr@2: williamr@2: const difference_type __elemsbefore = __pos - this->_M_start; williamr@2: size_type __length = size(); williamr@2: if (__elemsbefore < difference_type(__length / 2)) { williamr@2: iterator __new_start = _M_reserve_elements_at_front(__n); williamr@2: iterator __old_start = this->_M_start; williamr@2: __pos = this->_M_start + __elemsbefore; williamr@2: _STLP_TRY { williamr@2: if (__elemsbefore >= difference_type(__n)) { williamr@2: iterator __start_n = this->_M_start + difference_type(__n); williamr@2: uninitialized_copy(this->_M_start, __start_n, __new_start); williamr@2: this->_M_start = __new_start; williamr@2: copy(__start_n, __pos, __old_start); williamr@2: copy(__first, __last, __pos - difference_type(__n)); williamr@2: } williamr@2: else { williamr@2: _ForwardIterator __mid = __first; williamr@2: advance(__mid, difference_type(__n) - __elemsbefore); williamr@2: __uninitialized_copy_copy(this->_M_start, __pos, __first, __mid, williamr@2: __new_start, _IsPODType()); williamr@2: this->_M_start = __new_start; williamr@2: copy(__mid, __last, __old_start); williamr@2: } williamr@2: } williamr@2: _STLP_UNWIND(this->_M_destroy_nodes(__new_start._M_node, this->_M_start._M_node)); williamr@2: } williamr@2: else { williamr@2: iterator __new_finish = _M_reserve_elements_at_back(__n); williamr@2: iterator __old_finish = this->_M_finish; williamr@2: const difference_type __elemsafter = williamr@2: difference_type(__length) - __elemsbefore; williamr@2: __pos = this->_M_finish - __elemsafter; williamr@2: _STLP_TRY { williamr@2: if (__elemsafter > difference_type(__n)) { williamr@2: iterator __finish_n = this->_M_finish - difference_type(__n); williamr@2: uninitialized_copy(__finish_n, this->_M_finish, this->_M_finish); williamr@2: this->_M_finish = __new_finish; williamr@2: copy_backward(__pos, __finish_n, __old_finish); williamr@2: copy(__first, __last, __pos); williamr@2: } williamr@2: else { williamr@2: _ForwardIterator __mid = __first; williamr@2: advance(__mid, __elemsafter); williamr@2: __uninitialized_copy_copy(__mid, __last, __pos, this->_M_finish, this->_M_finish, _IsPODType()); williamr@2: this->_M_finish = __new_finish; williamr@2: copy(__first, __mid, __pos); williamr@2: } williamr@2: } williamr@2: _STLP_UNWIND(this->_M_destroy_nodes(this->_M_finish._M_node + 1, __new_finish._M_node + 1)); williamr@2: } williamr@2: } williamr@2: #else /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: void _M_insert_aux(iterator __pos, williamr@2: const value_type* __first, const value_type* __last, williamr@2: size_type __n); williamr@2: williamr@2: void _M_insert_aux(iterator __pos, williamr@2: const_iterator __first, const_iterator __last, williamr@2: size_type __n); williamr@2: williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: iterator _M_reserve_elements_at_front(size_type __n) { williamr@2: size_type __vacancies = this->_M_start._M_cur - this->_M_start._M_first; williamr@2: if (__n > __vacancies) williamr@2: _M_new_elements_at_front(__n - __vacancies); williamr@2: return this->_M_start - difference_type(__n); williamr@2: } williamr@2: williamr@2: iterator _M_reserve_elements_at_back(size_type __n) { williamr@2: size_type __vacancies = (this->_M_finish._M_last - this->_M_finish._M_cur) - 1; williamr@2: if (__n > __vacancies) williamr@2: _M_new_elements_at_back(__n - __vacancies); williamr@2: return this->_M_finish + difference_type(__n); williamr@2: } williamr@2: williamr@2: void _M_new_elements_at_front(size_type __new_elements); williamr@2: void _M_new_elements_at_back(size_type __new_elements); williamr@2: williamr@2: protected: // Allocation of _M_map and nodes williamr@2: williamr@2: // Makes sure the _M_map has space for new nodes. Does not actually williamr@2: // add the nodes. Can invalidate _M_map pointers. (And consequently, williamr@2: // deque iterators.) williamr@2: williamr@2: void _M_reserve_map_at_back (size_type __nodes_to_add = 1) { williamr@2: if (__nodes_to_add + 1 > this->_M_map_size._M_data - (this->_M_finish._M_node - this->_M_map._M_data)) williamr@2: _M_reallocate_map(__nodes_to_add, false); williamr@2: } williamr@2: williamr@2: void _M_reserve_map_at_front (size_type __nodes_to_add = 1) { williamr@2: if (__nodes_to_add > size_type(this->_M_start._M_node - this->_M_map._M_data)) williamr@2: _M_reallocate_map(__nodes_to_add, true); williamr@2: } williamr@2: williamr@2: void _M_reallocate_map(size_type __nodes_to_add, bool __add_at_front); williamr@2: williamr@2: }; williamr@2: williamr@2: # define _STLP_TEMPLATE_CONTAINER deque<_Tp, _Alloc> williamr@2: # define _STLP_TEMPLATE_HEADER template williamr@2: # include williamr@2: # undef _STLP_TEMPLATE_CONTAINER williamr@2: # undef _STLP_TEMPLATE_HEADER williamr@2: williamr@2: _STLP_END_NAMESPACE williamr@2: williamr@2: // do a cleanup williamr@2: # undef deque williamr@2: # undef __deque__ williamr@2: # define __deque__ __WORKAROUND_DBG_RENAME(deque) williamr@2: williamr@2: # if !defined (_STLP_LINK_TIME_INSTANTIATION) williamr@2: # include williamr@2: # endif williamr@2: williamr@2: #if defined (_STLP_DEBUG) williamr@2: # include williamr@2: #endif williamr@2: williamr@2: # if defined (_STLP_USE_WRAPPER_FOR_ALLOC_PARAM) williamr@2: # include williamr@2: # endif williamr@2: williamr@2: #endif /* _STLP_INTERNAL_DEQUE_H */ williamr@2: williamr@2: // Local Variables: williamr@2: // mode:C++ williamr@2: // End: williamr@2: