williamr@2: /* williamr@2: * 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: #ifndef _STLP_DEQUE_C williamr@2: # define _STLP_DEQUE_C williamr@2: williamr@2: # ifndef _STLP_INTERNAL_DEQUE_H williamr@2: # include williamr@2: # endif williamr@2: williamr@2: _STLP_BEGIN_NAMESPACE williamr@2: williamr@2: // Non-inline member functions from _Deque_base. williamr@2: williamr@2: template williamr@2: _Deque_base<_Tp,_Alloc >::~_Deque_base() { williamr@2: if (_M_map._M_data) { williamr@2: if (_M_start._M_node) { williamr@2: _M_destroy_nodes(_M_start._M_node, this->_M_finish._M_node + 1); williamr@2: } williamr@2: _M_map.deallocate(_M_map._M_data, _M_map_size._M_data); williamr@2: } williamr@2: } williamr@2: williamr@2: template williamr@2: void williamr@2: _Deque_base<_Tp,_Alloc>::_M_initialize_map(size_t __num_elements) williamr@2: { williamr@2: size_t __num_nodes = williamr@2: __num_elements / this->buffer_size() + 1 ; williamr@2: williamr@2: _M_map_size._M_data = (max)((size_t) _S_initial_map_size, __num_nodes + 2); williamr@2: _M_map._M_data = _M_map.allocate(_M_map_size._M_data); williamr@2: williamr@2: _Tp** __nstart = _M_map._M_data + (_M_map_size._M_data - __num_nodes) / 2; williamr@2: _Tp** __nfinish = __nstart + __num_nodes; williamr@2: williamr@2: _STLP_TRY { williamr@2: _M_create_nodes(__nstart, __nfinish); williamr@2: } williamr@2: _STLP_UNWIND((_M_map.deallocate(_M_map._M_data, _M_map_size._M_data), williamr@2: _M_map._M_data = 0, _M_map_size._M_data = 0)); williamr@2: _M_start._M_set_node(__nstart); williamr@2: this->_M_finish._M_set_node(__nfinish - 1); williamr@2: _M_start._M_cur = _M_start._M_first; williamr@2: this->_M_finish._M_cur = this->_M_finish._M_first + williamr@2: __num_elements % this->buffer_size(); williamr@2: } williamr@2: williamr@2: template williamr@2: void williamr@2: _Deque_base<_Tp,_Alloc>::_M_create_nodes(_Tp** __nstart, williamr@2: _Tp** __nfinish) williamr@2: { williamr@2: _Tp** _STLP_LEAVE_VOLATILE __cur = 0; williamr@2: _STLP_TRY { williamr@2: for (__cur = __nstart; __cur < __nfinish; ++__cur) williamr@2: *__cur = _M_map_size.allocate(this->buffer_size()); williamr@2: } williamr@2: _STLP_UNWIND(_M_destroy_nodes(__nstart, __cur)); williamr@2: } williamr@2: williamr@2: template williamr@2: void williamr@2: _Deque_base<_Tp,_Alloc>::_M_destroy_nodes(_Tp** __nstart, williamr@2: _Tp** __nfinish) williamr@2: { williamr@2: for (_Tp** __n = __nstart; __n < __nfinish; ++__n) williamr@2: _M_map_size.deallocate(*__n, this->buffer_size()); williamr@2: } williamr@2: williamr@2: williamr@2: williamr@2: // Non-inline member functions williamr@2: williamr@2: # if defined ( _STLP_NESTED_TYPE_PARAM_BUG ) williamr@2: // qualified references williamr@2: # define __iterator__ _Deque_iterator<_Tp, _Nonconst_traits<_Tp> > williamr@2: # define const_iterator _Deque_iterator<_Tp, _Const_traits<_Tp> > williamr@2: # define iterator __iterator__ williamr@2: # define size_type size_t williamr@2: # define value_type _Tp williamr@2: # else williamr@2: # define __iterator__ _STLP_TYPENAME_ON_RETURN_TYPE __deque__<_Tp, _Alloc>::iterator williamr@2: # endif williamr@2: williamr@2: template williamr@2: __deque__<_Tp, _Alloc >& williamr@2: __deque__<_Tp, _Alloc >::operator= (const __deque__<_Tp, _Alloc >& __x) { williamr@2: const size_type __len = size(); williamr@2: if (&__x != this) { williamr@2: if (__len >= __x.size()) williamr@2: erase(copy(__x.begin(), __x.end(), this->_M_start), this->_M_finish); williamr@2: else { williamr@2: const_iterator __mid = __x.begin() + difference_type(__len); williamr@2: copy(__x.begin(), __mid, this->_M_start); williamr@2: insert(this->_M_finish, __mid, __x.end()); williamr@2: } williamr@2: } williamr@2: return *this; williamr@2: } williamr@2: williamr@2: template williamr@2: void williamr@2: __deque__<_Tp, _Alloc >::_M_fill_insert(iterator __pos, williamr@2: size_type __n, const value_type& __x) williamr@2: { 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_fill(__new_start, this->_M_start, __x); williamr@2: } williamr@2: _STLP_UNWIND(this->_M_destroy_nodes(__new_start._M_node, this->_M_start._M_node)); williamr@2: this->_M_start = __new_start; 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_fill(this->_M_finish, __new_finish, __x); williamr@2: } williamr@2: _STLP_UNWIND(this->_M_destroy_nodes(this->_M_finish._M_node+1, __new_finish._M_node+1)); williamr@2: this->_M_finish = __new_finish; williamr@2: } williamr@2: else williamr@2: _M_insert_aux(__pos, __n, __x); williamr@2: } williamr@2: williamr@2: #ifndef _STLP_MEMBER_TEMPLATES williamr@2: williamr@2: template williamr@2: void __deque__<_Tp, _Alloc>::insert(iterator __pos, williamr@2: const value_type* __first, williamr@2: const value_type* __last) { williamr@2: size_type __n = __last - __first; 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: } williamr@2: _STLP_UNWIND(this->_M_destroy_nodes(__new_start._M_node, this->_M_start._M_node)); williamr@2: this->_M_start = __new_start; 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: } williamr@2: _STLP_UNWIND(this->_M_destroy_nodes(this->_M_finish._M_node + 1, williamr@2: __new_finish._M_node + 1)); williamr@2: this->_M_finish = __new_finish; williamr@2: } williamr@2: else williamr@2: _M_insert_aux(__pos, __first, __last, __n); williamr@2: } williamr@2: williamr@2: template williamr@2: void __deque__<_Tp,_Alloc>::insert(iterator __pos, williamr@2: const_iterator __first, williamr@2: const_iterator __last) williamr@2: { williamr@2: size_type __n = __last - __first; 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: } williamr@2: _STLP_UNWIND(this->_M_destroy_nodes(__new_start._M_node, this->_M_start._M_node)); williamr@2: this->_M_start = __new_start; 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: } williamr@2: _STLP_UNWIND(this->_M_destroy_nodes(this->_M_finish._M_node + 1,__new_finish._M_node + 1)); williamr@2: this->_M_finish = __new_finish; williamr@2: } williamr@2: else williamr@2: _M_insert_aux(__pos, __first, __last, __n); williamr@2: } williamr@2: williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: template williamr@2: __iterator__ williamr@2: __deque__<_Tp,_Alloc>::erase(iterator __first, iterator __last) williamr@2: { williamr@2: if (__first == this->_M_start && __last == this->_M_finish) { williamr@2: clear(); williamr@2: return this->_M_finish; williamr@2: } williamr@2: else { williamr@2: difference_type __n = __last - __first; williamr@2: difference_type __elems_before = __first - this->_M_start; williamr@2: if (__elems_before < difference_type(this->size() - __n) / 2) { williamr@2: copy_backward(this->_M_start, __first, __last); williamr@2: iterator __new_start = this->_M_start + __n; williamr@2: _STLP_STD::_Destroy(this->_M_start, __new_start); williamr@2: this->_M_destroy_nodes(this->_M_start._M_node, __new_start._M_node); williamr@2: this->_M_start = __new_start; williamr@2: } williamr@2: else { williamr@2: copy(__last, this->_M_finish, __first); williamr@2: iterator __new_finish = this->_M_finish - __n; williamr@2: _STLP_STD::_Destroy(__new_finish, this->_M_finish); williamr@2: this->_M_destroy_nodes(__new_finish._M_node + 1, this->_M_finish._M_node + 1); williamr@2: this->_M_finish = __new_finish; williamr@2: } williamr@2: return this->_M_start + __elems_before; williamr@2: } williamr@2: } williamr@2: williamr@2: template williamr@2: void __deque__<_Tp,_Alloc>::clear() williamr@2: { williamr@2: for (_Map_pointer __node = this->_M_start._M_node + 1; williamr@2: __node < this->_M_finish._M_node; williamr@2: ++__node) { williamr@2: _STLP_STD::_Destroy(*__node, *__node + this->buffer_size()); williamr@2: this->_M_map_size.deallocate(*__node, this->buffer_size()); williamr@2: } williamr@2: williamr@2: if (this->_M_start._M_node != this->_M_finish._M_node) { williamr@2: _STLP_STD::_Destroy(this->_M_start._M_cur, this->_M_start._M_last); williamr@2: _STLP_STD::_Destroy(this->_M_finish._M_first, this->_M_finish._M_cur); williamr@2: this->_M_map_size.deallocate(this->_M_finish._M_first, this->buffer_size()); williamr@2: } williamr@2: else williamr@2: _STLP_STD::_Destroy(this->_M_start._M_cur, this->_M_finish._M_cur); williamr@2: williamr@2: this->_M_finish = this->_M_start; williamr@2: } williamr@2: williamr@2: // Precondition: this->_M_start and this->_M_finish have already been initialized, williamr@2: // but none of the deque's elements have yet been constructed. williamr@2: template williamr@2: void williamr@2: __deque__<_Tp,_Alloc>::_M_fill_initialize(const value_type& __val) { williamr@2: _STLP_LEAVE_VOLATILE _Map_pointer __cur = 0; williamr@2: _STLP_TRY { williamr@2: for (__cur = this->_M_start._M_node; __cur < this->_M_finish._M_node; ++__cur) williamr@2: uninitialized_fill(*__cur, *__cur + this->buffer_size(), __val); williamr@2: uninitialized_fill(this->_M_finish._M_first, this->_M_finish._M_cur, __val); williamr@2: } williamr@2: _STLP_UNWIND(_STLP_STD::_Destroy(this->_M_start, iterator(*__cur, __cur))); williamr@2: } williamr@2: williamr@2: williamr@2: // Called only if this->_M_finish._M_cur == this->_M_finish._M_last - 1. williamr@2: template williamr@2: void williamr@2: __deque__<_Tp,_Alloc>::_M_push_back_aux_v(const value_type& __t) williamr@2: { williamr@2: value_type __t_copy = __t; williamr@2: _STLP_PUSH_CLEANUP_ITEM(value_type, &__t_copy); williamr@2: _M_reserve_map_at_back(); williamr@2: *(this->_M_finish._M_node + 1) = this->_M_map_size.allocate(this->buffer_size()); williamr@2: _STLP_TRY { williamr@2: _Construct(this->_M_finish._M_cur, __t_copy); williamr@2: this->_M_finish._M_set_node(this->_M_finish._M_node + 1); williamr@2: this->_M_finish._M_cur = this->_M_finish._M_first; williamr@2: } williamr@2: _STLP_UNWIND(this->_M_map_size.deallocate(*(this->_M_finish._M_node + 1), williamr@2: this->buffer_size())); williamr@2: #ifdef _STLP_USE_TRAP_LEAVE williamr@2: CleanupStack::Pop(); williamr@2: #endif williamr@2: } williamr@2: williamr@2: # ifndef _STLP_NO_ANACHRONISMS williamr@2: // Called only if this->_M_finish._M_cur == this->_M_finish._M_last - 1. williamr@2: template williamr@2: void williamr@2: __deque__<_Tp,_Alloc>::_M_push_back_aux() williamr@2: { williamr@2: _M_reserve_map_at_back(); williamr@2: *(this->_M_finish._M_node + 1) = this->_M_map_size.allocate(this->buffer_size()); williamr@2: _STLP_TRY { williamr@2: _Construct(this->_M_finish._M_cur); williamr@2: this->_M_finish._M_set_node(this->_M_finish._M_node + 1); williamr@2: this->_M_finish._M_cur = this->_M_finish._M_first; williamr@2: } williamr@2: _STLP_UNWIND(this->_M_map_size.deallocate(*(this->_M_finish._M_node + 1), williamr@2: this->buffer_size())); williamr@2: } williamr@2: # endif williamr@2: williamr@2: // Called only if this->_M_start._M_cur == this->_M_start._M_first. williamr@2: template williamr@2: void williamr@2: __deque__<_Tp,_Alloc>::_M_push_front_aux_v(const value_type& __t) williamr@2: { williamr@2: value_type __t_copy = __t; williamr@2: _STLP_PUSH_CLEANUP_ITEM(value_type, &__t_copy); williamr@2: _M_reserve_map_at_front(); williamr@2: *(this->_M_start._M_node - 1) = this->_M_map_size.allocate(this->buffer_size()); williamr@2: _STLP_TRY { williamr@2: this->_M_start._M_set_node(this->_M_start._M_node - 1); williamr@2: this->_M_start._M_cur = this->_M_start._M_last - 1; williamr@2: _Construct(this->_M_start._M_cur, __t_copy); williamr@2: } williamr@2: _STLP_UNWIND((++this->_M_start, williamr@2: this->_M_map_size.deallocate(*(this->_M_start._M_node - 1), this->buffer_size()))); williamr@2: #ifdef _STLP_USE_TRAP_LEAVE williamr@2: CleanupStack::Pop(); williamr@2: #endif williamr@2: } williamr@2: williamr@2: williamr@2: # ifndef _STLP_NO_ANACHRONISMS williamr@2: // Called only if this->_M_start._M_cur == this->_M_start._M_first. williamr@2: template williamr@2: void williamr@2: __deque__<_Tp,_Alloc>::_M_push_front_aux() williamr@2: { williamr@2: _M_reserve_map_at_front(); williamr@2: *(this->_M_start._M_node - 1) = this->_M_map_size.allocate(this->buffer_size()); williamr@2: _STLP_TRY { williamr@2: this->_M_start._M_set_node(this->_M_start._M_node - 1); williamr@2: this->_M_start._M_cur = this->_M_start._M_last - 1; williamr@2: _Construct(this->_M_start._M_cur); williamr@2: } williamr@2: _STLP_UNWIND((++this->_M_start, this->_M_map_size.deallocate(*(this->_M_start._M_node - 1), williamr@2: this->buffer_size() ))); williamr@2: } williamr@2: # endif williamr@2: williamr@2: // Called only if this->_M_finish._M_cur == this->_M_finish._M_first. williamr@2: template williamr@2: void williamr@2: __deque__<_Tp,_Alloc>::_M_pop_back_aux() williamr@2: { williamr@2: this->_M_map_size.deallocate(this->_M_finish._M_first, this->buffer_size()); williamr@2: this->_M_finish._M_set_node(this->_M_finish._M_node - 1); williamr@2: this->_M_finish._M_cur = this->_M_finish._M_last - 1; williamr@2: _STLP_STD::_Destroy(this->_M_finish._M_cur); williamr@2: } williamr@2: williamr@2: // Called only if this->_M_start._M_cur == this->_M_start._M_last - 1. Note that williamr@2: // if the deque has at least one element (a precondition for this member williamr@2: // function), and if this->_M_start._M_cur == this->_M_start._M_last, then the deque williamr@2: // must have at least two nodes. williamr@2: template williamr@2: void williamr@2: __deque__<_Tp,_Alloc>::_M_pop_front_aux() williamr@2: { williamr@2: _STLP_STD::_Destroy(this->_M_start._M_cur); williamr@2: this->_M_map_size.deallocate(this->_M_start._M_first, this->buffer_size()); williamr@2: this->_M_start._M_set_node(this->_M_start._M_node + 1); williamr@2: this->_M_start._M_cur = this->_M_start._M_first; williamr@2: } williamr@2: williamr@2: williamr@2: williamr@2: template williamr@2: __iterator__ williamr@2: __deque__<_Tp,_Alloc>::_M_insert_aux_prepare(iterator __pos) { williamr@2: difference_type __index = __pos - this->_M_start; williamr@2: if (__index < difference_type(size() / 2)) { williamr@2: push_front(front()); williamr@2: iterator __front1 = this->_M_start; williamr@2: ++__front1; williamr@2: iterator __front2 = __front1; williamr@2: ++__front2; williamr@2: __pos = this->_M_start + __index; williamr@2: iterator __pos1 = __pos; williamr@2: ++__pos1; williamr@2: copy(__front2, __pos1, __front1); williamr@2: } williamr@2: else { williamr@2: push_back(back()); williamr@2: iterator __back1 = this->_M_finish; williamr@2: --__back1; williamr@2: iterator __back2 = __back1; williamr@2: --__back2; williamr@2: __pos = this->_M_start + __index; williamr@2: copy_backward(__pos, __back2, __back1); williamr@2: } williamr@2: return __pos; williamr@2: } williamr@2: williamr@2: template williamr@2: __iterator__ williamr@2: __deque__<_Tp,_Alloc>::_M_insert_aux(iterator __pos, williamr@2: const value_type& __x) { williamr@2: value_type __x_copy = __x; williamr@2: _STLP_PUSH_CLEANUP_ITEM(value_type, &__x_copy); williamr@2: _STLP_MPWFIX_TRY //*TY 06/01/2000 - mpw forget to call dtor on __x_copy without this try block williamr@2: __pos = _M_insert_aux_prepare(__pos); williamr@2: *__pos = __x_copy; williamr@2: #ifdef _STLP_USE_TRAP_LEAVE williamr@2: CleanupStack::Pop(); williamr@2: #endif williamr@2: return __pos; williamr@2: _STLP_MPWFIX_CATCH //*TY 06/01/2000 - williamr@2: } williamr@2: williamr@2: template williamr@2: __iterator__ williamr@2: __deque__<_Tp,_Alloc>::_M_insert_aux(iterator __pos) williamr@2: { williamr@2: __pos = _M_insert_aux_prepare(__pos); williamr@2: *__pos = value_type(); williamr@2: return __pos; williamr@2: } williamr@2: williamr@2: template williamr@2: void williamr@2: __deque__<_Tp,_Alloc>::_M_insert_aux(iterator __pos, williamr@2: size_type __n, williamr@2: const value_type& __x) williamr@2: { williamr@2: const difference_type __elems_before = __pos - this->_M_start; williamr@2: size_type __length = this->size(); williamr@2: value_type __x_copy = __x; williamr@2: _STLP_PUSH_CLEANUP_ITEM(value_type, &__x_copy); williamr@2: williamr@2: if (__elems_before < 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 + __elems_before; williamr@2: _STLP_TRY { williamr@2: if (__elems_before >= 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: fill(__pos - difference_type(__n), __pos, __x_copy); williamr@2: } williamr@2: else { williamr@2: __uninitialized_copy_fill(this->_M_start, __pos, __new_start, williamr@2: this->_M_start, __x_copy); williamr@2: this->_M_start = __new_start; williamr@2: fill(__old_start, __pos, __x_copy); 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 __elems_after = williamr@2: difference_type(__length) - __elems_before; williamr@2: __pos = this->_M_finish - __elems_after; williamr@2: _STLP_TRY { williamr@2: if (__elems_after > 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: fill(__pos, __pos + difference_type(__n), __x_copy); williamr@2: } williamr@2: else { williamr@2: __uninitialized_fill_copy(this->_M_finish, __pos + difference_type(__n), williamr@2: __x_copy, __pos, this->_M_finish); williamr@2: this->_M_finish = __new_finish; williamr@2: fill(__pos, __old_finish, __x_copy); 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: #ifdef _STLP_USE_TRAP_LEAVE williamr@2: CleanupStack::Pop(); williamr@2: #endif williamr@2: } williamr@2: williamr@2: #ifndef _STLP_MEMBER_TEMPLATES williamr@2: template williamr@2: void williamr@2: __deque__<_Tp,_Alloc>::_M_insert_aux(iterator __pos, williamr@2: const value_type* __first, williamr@2: const value_type* __last, williamr@2: size_type __n) williamr@2: { 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: const value_type* __mid = williamr@2: __first + (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: const value_type* __mid = __first + __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: williamr@2: template williamr@2: void williamr@2: __deque__<_Tp,_Alloc>::_M_insert_aux(iterator __pos, williamr@2: const_iterator __first, williamr@2: const_iterator __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 + __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: const_iterator __mid = __first + (__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 = __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: const_iterator __mid = __first + __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: williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: template williamr@2: void williamr@2: __deque__<_Tp,_Alloc>::_M_new_elements_at_front(size_type __new_elems) williamr@2: { williamr@2: size_type __new_nodes williamr@2: = (__new_elems + this->buffer_size() - 1) / this->buffer_size(); williamr@2: _M_reserve_map_at_front(__new_nodes); williamr@2: size_type __i =1; williamr@2: _STLP_TRY { williamr@2: for (; __i <= __new_nodes; ++__i) williamr@2: *(this->_M_start._M_node - __i) = this->_M_map_size.allocate(this->buffer_size()); williamr@2: } williamr@2: _STLP_CATCH_ALL { williamr@2: for (size_type __j = 1; __j < __i; ++__j) williamr@2: this->_M_map_size.deallocate(*(this->_M_start._M_node - __j), this->buffer_size()); williamr@2: _STLP_RETHROW; williamr@2: } williamr@2: } williamr@2: williamr@2: template williamr@2: void williamr@2: __deque__<_Tp,_Alloc>::_M_new_elements_at_back(size_type __new_elems) williamr@2: { williamr@2: size_type __new_nodes williamr@2: = (__new_elems + this->buffer_size() - 1) / this->buffer_size(); williamr@2: _M_reserve_map_at_back(__new_nodes); williamr@2: size_type __i = 1; williamr@2: _STLP_TRY { williamr@2: for (; __i <= __new_nodes; ++__i) williamr@2: *(this->_M_finish._M_node + __i) = this->_M_map_size.allocate(this->buffer_size()); williamr@2: } williamr@2: _STLP_CATCH_ALL { williamr@2: for (size_type __j = 1; __j < __i; ++__j) williamr@2: this->_M_map_size.deallocate(*(this->_M_finish._M_node + __j), this->buffer_size()); williamr@2: _STLP_RETHROW; williamr@2: } williamr@2: } williamr@2: williamr@2: template williamr@2: void williamr@2: __deque__<_Tp,_Alloc>::_M_reallocate_map(size_type __nodes_to_add, williamr@2: bool __add_at_front) williamr@2: { williamr@2: size_type __old_num_nodes = this->_M_finish._M_node - this->_M_start._M_node + 1; williamr@2: size_type __new_num_nodes = __old_num_nodes + __nodes_to_add; williamr@2: williamr@2: _Map_pointer __new_nstart; williamr@2: if (this->_M_map_size._M_data > 2 * __new_num_nodes) { williamr@2: __new_nstart = this->_M_map._M_data + (this->_M_map_size._M_data - __new_num_nodes) / 2 williamr@2: + (__add_at_front ? __nodes_to_add : 0); williamr@2: if (__new_nstart < this->_M_start._M_node) williamr@2: copy(this->_M_start._M_node, this->_M_finish._M_node + 1, __new_nstart); williamr@2: else williamr@2: copy_backward(this->_M_start._M_node, this->_M_finish._M_node + 1, williamr@2: __new_nstart + __old_num_nodes); williamr@2: } williamr@2: else { williamr@2: size_type __new_map_size = williamr@2: this->_M_map_size._M_data + (max)((size_t)this->_M_map_size._M_data, __nodes_to_add) + 2; williamr@2: williamr@2: _Map_pointer __new_map = this->_M_map.allocate(__new_map_size); williamr@2: __new_nstart = __new_map + (__new_map_size - __new_num_nodes) / 2 williamr@2: + (__add_at_front ? __nodes_to_add : 0); williamr@2: copy(this->_M_start._M_node, this->_M_finish._M_node + 1, __new_nstart); williamr@2: this->_M_map.deallocate(this->_M_map._M_data, this->_M_map_size._M_data); williamr@2: williamr@2: this->_M_map._M_data = __new_map; williamr@2: this->_M_map_size._M_data = __new_map_size; williamr@2: } williamr@2: williamr@2: this->_M_start._M_set_node(__new_nstart); williamr@2: this->_M_finish._M_set_node(__new_nstart + __old_num_nodes - 1); williamr@2: } williamr@2: williamr@2: _STLP_END_NAMESPACE williamr@2: williamr@2: # undef __iterator__ williamr@2: # undef iterator williamr@2: # undef const_iterator williamr@2: # undef size_type williamr@2: # undef value_type williamr@2: williamr@2: #endif /* _STLP_DEQUE_C */ williamr@2: williamr@2: // Local Variables: williamr@2: // mode:C++ williamr@2: // End: