// Vector implementation (out of line) -*- C++ -*-// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007// 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 2, 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.// You should have received a copy of the GNU General Public License along// with this library; see the file COPYING. If not, write to the Free// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,// USA.// As a special exception, you may use this file as part of a free software// library without restriction. Specifically, if other files instantiate// templates or use macros or inline functions from this file, or you compile// this file and link it with other files to produce an executable, this// file does not by itself cause the resulting executable to be covered by// the GNU General Public License. This exception does not however// invalidate any other reasons why the executable file might be covered by// the GNU General Public License./*** Copyright (c) 1994* Hewlett-Packard Company** Permission to use, copy, modify, distribute and sell this software* and its documentation for any purpose is hereby granted without fee,* provided that the above copyright notice appear in all copies and* that both that copyright notice and this permission notice appear* in supporting documentation. Hewlett-Packard Company makes no* representations about the suitability of this software for any* purpose. It is provided "as is" without express or implied warranty.*** Copyright (c) 1996* Silicon Graphics Computer Systems, Inc.** Permission to use, copy, modify, distribute and sell this software* and its documentation for any purpose is hereby granted without fee,* provided that the above copyright notice appear in all copies and* that both that copyright notice and this permission notice appear* in supporting documentation. Silicon Graphics makes no* representations about the suitability of this software for any* purpose. It is provided "as is" without express or implied warranty.*//** @file vector.tcc* This is an internal header file, included by other library headers.* You should not attempt to use it directly.*/#ifndef _VECTOR_TCC#define _VECTOR_TCC 1_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD_D)template<typename _Tp, typename _Alloc>voidvector<_Tp, _Alloc>::reserve(size_type __n){if (__n > this->max_size())__throw_length_error(__N("vector::reserve"));if (this->capacity() < __n){const size_type __old_size = size();pointer __tmp = _M_allocate_and_copy(__n,_GLIBCXX_MAKE_MOVE_ITERATOR(this->_M_impl._M_start),_GLIBCXX_MAKE_MOVE_ITERATOR(this->_M_impl._M_finish));std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,_M_get_Tp_allocator());_M_deallocate(this->_M_impl._M_start,this->_M_impl._M_end_of_storage- this->_M_impl._M_start);this->_M_impl._M_start = __tmp;this->_M_impl._M_finish = __tmp + __old_size;this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;}}template<typename _Tp, typename _Alloc>typename vector<_Tp, _Alloc>::iteratorvector<_Tp, _Alloc>::insert(iterator __position, const value_type& __x){const size_type __n = __position - begin();if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage&& __position == end()){this->_M_impl.construct(this->_M_impl._M_finish, __x);++this->_M_impl._M_finish;}else{#ifdef __GXX_EXPERIMENTAL_CXX0X__if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage){_Tp __x_copy = __x;_M_insert_aux(__position, std::move(__x_copy));}else#endif_M_insert_aux(__position, __x);}return iterator(this->_M_impl._M_start + __n);}template<typename _Tp, typename _Alloc>typename vector<_Tp, _Alloc>::iteratorvector<_Tp, _Alloc>::erase(iterator __position){if (__position + 1 != end())_GLIBCXX_MOVE3(__position + 1, end(), __position);--this->_M_impl._M_finish;this->_M_impl.destroy(this->_M_impl._M_finish);return __position;}template<typename _Tp, typename _Alloc>typename vector<_Tp, _Alloc>::iteratorvector<_Tp, _Alloc>::erase(iterator __first, iterator __last){if (__last != end())_GLIBCXX_MOVE3(__last, end(), __first);_M_erase_at_end(__first.base() + (end() - __last));return __first;}template<typename _Tp, typename _Alloc>vector<_Tp, _Alloc>&vector<_Tp, _Alloc>::operator=(const vector<_Tp, _Alloc>& __x){if (&__x != this){const size_type __xlen = __x.size();if (__xlen > capacity()){pointer __tmp = _M_allocate_and_copy(__xlen, __x.begin(),__x.end());std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,_M_get_Tp_allocator());_M_deallocate(this->_M_impl._M_start,this->_M_impl._M_end_of_storage- this->_M_impl._M_start);this->_M_impl._M_start = __tmp;this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __xlen;}else if (size() >= __xlen){std::_Destroy(std::copy(__x.begin(), __x.end(), begin()),end(), _M_get_Tp_allocator());}else{std::copy(__x._M_impl._M_start, __x._M_impl._M_start + size(),this->_M_impl._M_start);std::__uninitialized_copy_a(__x._M_impl._M_start + size(),__x._M_impl._M_finish,this->_M_impl._M_finish,_M_get_Tp_allocator());}this->_M_impl._M_finish = this->_M_impl._M_start + __xlen;}return *this;}template<typename _Tp, typename _Alloc>voidvector<_Tp, _Alloc>::_M_fill_assign(size_t __n, const value_type& __val){if (__n > capacity()){vector __tmp(__n, __val, _M_get_Tp_allocator());__tmp.swap(*this);}else if (__n > size()){std::fill(begin(), end(), __val);std::__uninitialized_fill_n_a(this->_M_impl._M_finish,__n - size(), __val,_M_get_Tp_allocator());this->_M_impl._M_finish += __n - size();}else_M_erase_at_end(std::fill_n(this->_M_impl._M_start, __n, __val));}template<typename _Tp, typename _Alloc>template<typename _InputIterator>voidvector<_Tp, _Alloc>::_M_assign_aux(_InputIterator __first, _InputIterator __last,std::input_iterator_tag){pointer __cur(this->_M_impl._M_start);for (; __first != __last && __cur != this->_M_impl._M_finish;++__cur, ++__first)*__cur = *__first;if (__first == __last)_M_erase_at_end(__cur);elseinsert(end(), __first, __last);}template<typename _Tp, typename _Alloc>template<typename _ForwardIterator>voidvector<_Tp, _Alloc>::_M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,std::forward_iterator_tag){const size_type __len = std::distance(__first, __last);if (__len > capacity()){pointer __tmp(_M_allocate_and_copy(__len, __first, __last));std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,_M_get_Tp_allocator());_M_deallocate(this->_M_impl._M_start,this->_M_impl._M_end_of_storage- this->_M_impl._M_start);this->_M_impl._M_start = __tmp;this->_M_impl._M_finish = this->_M_impl._M_start + __len;this->_M_impl._M_end_of_storage = this->_M_impl._M_finish;}else if (size() >= __len)_M_erase_at_end(std::copy(__first, __last, this->_M_impl._M_start));else{_ForwardIterator __mid = __first;std::advance(__mid, size());std::copy(__first, __mid, this->_M_impl._M_start);this->_M_impl._M_finish =std::__uninitialized_copy_a(__mid, __last,this->_M_impl._M_finish,_M_get_Tp_allocator());}}#ifdef __GXX_EXPERIMENTAL_CXX0X__template<typename _Tp, typename _Alloc>template<typename... _Args>typename vector<_Tp, _Alloc>::iteratorvector<_Tp, _Alloc>::emplace(iterator __position, _Args&&... __args){const size_type __n = __position - begin();if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage&& __position == end()){this->_M_impl.construct(this->_M_impl._M_finish,std::forward<_Args>(__args)...);++this->_M_impl._M_finish;}else_M_insert_aux(__position, std::forward<_Args>(__args)...);return iterator(this->_M_impl._M_start + __n);}template<typename _Tp, typename _Alloc>template<typename... _Args>voidvector<_Tp, _Alloc>::_M_insert_aux(iterator __position, _Args&&... __args)#elsetemplate<typename _Tp, typename _Alloc>voidvector<_Tp, _Alloc>::_M_insert_aux(iterator __position, const _Tp& __x)#endif{if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage){this->_M_impl.construct(this->_M_impl._M_finish,_GLIBCXX_MOVE(*(this->_M_impl._M_finish- 1)));++this->_M_impl._M_finish;#ifndef __GXX_EXPERIMENTAL_CXX0X___Tp __x_copy = __x;#endif_GLIBCXX_MOVE_BACKWARD3(__position.base(),this->_M_impl._M_finish - 2,this->_M_impl._M_finish - 1);#ifndef __GXX_EXPERIMENTAL_CXX0X__*__position = __x_copy;#else*__position = _Tp(std::forward<_Args>(__args)...);#endif}else{const size_type __len =_M_check_len(size_type(1), "vector::_M_insert_aux");pointer __new_start(this->_M_allocate(__len));pointer __new_finish(__new_start);try{#ifdef __GXX_EXPERIMENTAL_CXX0X__this->_M_impl.construct(__new_start + (__position - begin()),std::forward<_Args>(__args)...);#endif__new_finish =std::__uninitialized_move_a(this->_M_impl._M_start,__position.base(), __new_start,_M_get_Tp_allocator());#ifndef __GXX_EXPERIMENTAL_CXX0X__this->_M_impl.construct(__new_finish, __x);#endif++__new_finish;__new_finish =std::__uninitialized_move_a(__position.base(),this->_M_impl._M_finish,__new_finish,_M_get_Tp_allocator());}catch(...){std::_Destroy(__new_start, __new_finish, _M_get_Tp_allocator());_M_deallocate(__new_start, __len);__throw_exception_again;}std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,_M_get_Tp_allocator());_M_deallocate(this->_M_impl._M_start,this->_M_impl._M_end_of_storage- this->_M_impl._M_start);this->_M_impl._M_start = __new_start;this->_M_impl._M_finish = __new_finish;this->_M_impl._M_end_of_storage = __new_start + __len;}}template<typename _Tp, typename _Alloc>voidvector<_Tp, _Alloc>::_M_fill_insert(iterator __position, size_type __n, const value_type& __x){if (__n != 0){#ifdef __GXX_EXPERIMENTAL_CXX0X__value_type __x_copy = __x;#endifif (size_type(this->_M_impl._M_end_of_storage- this->_M_impl._M_finish) >= __n){#ifndef __GXX_EXPERIMENTAL_CXX0X__value_type __x_copy = __x;#endifconst size_type __elems_after = end() - __position;pointer __old_finish(this->_M_impl._M_finish);if (__elems_after > __n){std::__uninitialized_move_a(this->_M_impl._M_finish - __n,this->_M_impl._M_finish,this->_M_impl._M_finish,_M_get_Tp_allocator());this->_M_impl._M_finish += __n;_GLIBCXX_MOVE_BACKWARD3(__position.base(),__old_finish - __n, __old_finish);std::fill(__position.base(), __position.base() + __n,__x_copy);}else{std::__uninitialized_fill_n_a(this->_M_impl._M_finish,__n - __elems_after,__x_copy,_M_get_Tp_allocator());this->_M_impl._M_finish += __n - __elems_after;std::__uninitialized_move_a(__position.base(), __old_finish,this->_M_impl._M_finish,_M_get_Tp_allocator());this->_M_impl._M_finish += __elems_after;std::fill(__position.base(), __old_finish, __x_copy);}}else{const size_type __len =_M_check_len(__n, "vector::_M_fill_insert");pointer __new_start(this->_M_allocate(__len));pointer __new_finish(__new_start);try{__new_finish =std::__uninitialized_move_a(this->_M_impl._M_start,__position.base(),__new_start,_M_get_Tp_allocator());#ifdef __GXX_EXPERIMENTAL_CXX0X__std::__uninitialized_fill_n_a(__new_finish, __n, __x_copy,#elsestd::__uninitialized_fill_n_a(__new_finish, __n, __x,#endif_M_get_Tp_allocator());__new_finish += __n;__new_finish =std::__uninitialized_move_a(__position.base(),this->_M_impl._M_finish,__new_finish,_M_get_Tp_allocator());}catch(...){std::_Destroy(__new_start, __new_finish,_M_get_Tp_allocator());_M_deallocate(__new_start, __len);__throw_exception_again;}std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,_M_get_Tp_allocator());_M_deallocate(this->_M_impl._M_start,this->_M_impl._M_end_of_storage- this->_M_impl._M_start);this->_M_impl._M_start = __new_start;this->_M_impl._M_finish = __new_finish;this->_M_impl._M_end_of_storage = __new_start + __len;}}}template<typename _Tp, typename _Alloc>template<typename _InputIterator>voidvector<_Tp, _Alloc>::_M_range_insert(iterator __pos, _InputIterator __first,_InputIterator __last, std::input_iterator_tag){for (; __first != __last; ++__first){__pos = insert(__pos, *__first);++__pos;}}template<typename _Tp, typename _Alloc>template<typename _ForwardIterator>voidvector<_Tp, _Alloc>::_M_range_insert(iterator __position, _ForwardIterator __first,_ForwardIterator __last, std::forward_iterator_tag){if (__first != __last){const size_type __n = std::distance(__first, __last);if (size_type(this->_M_impl._M_end_of_storage- this->_M_impl._M_finish) >= __n){const size_type __elems_after = end() - __position;pointer __old_finish(this->_M_impl._M_finish);if (__elems_after > __n){std::__uninitialized_move_a(this->_M_impl._M_finish - __n,this->_M_impl._M_finish,this->_M_impl._M_finish,_M_get_Tp_allocator());this->_M_impl._M_finish += __n;_GLIBCXX_MOVE_BACKWARD3(__position.base(),__old_finish - __n, __old_finish);std::copy(__first, __last, __position);}else{_ForwardIterator __mid = __first;std::advance(__mid, __elems_after);std::__uninitialized_copy_a(__mid, __last,this->_M_impl._M_finish,_M_get_Tp_allocator());this->_M_impl._M_finish += __n - __elems_after;std::__uninitialized_move_a(__position.base(),__old_finish,this->_M_impl._M_finish,_M_get_Tp_allocator());this->_M_impl._M_finish += __elems_after;std::copy(__first, __mid, __position);}}else{const size_type __len =_M_check_len(__n, "vector::_M_range_insert");pointer __new_start(this->_M_allocate(__len));pointer __new_finish(__new_start);try{__new_finish =std::__uninitialized_move_a(this->_M_impl._M_start,__position.base(),__new_start,_M_get_Tp_allocator());__new_finish =std::__uninitialized_copy_a(__first, __last,__new_finish,_M_get_Tp_allocator());__new_finish =std::__uninitialized_move_a(__position.base(),this->_M_impl._M_finish,__new_finish,_M_get_Tp_allocator());}catch(...){std::_Destroy(__new_start, __new_finish,_M_get_Tp_allocator());_M_deallocate(__new_start, __len);__throw_exception_again;}std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,_M_get_Tp_allocator());_M_deallocate(this->_M_impl._M_start,this->_M_impl._M_end_of_storage- this->_M_impl._M_start);this->_M_impl._M_start = __new_start;this->_M_impl._M_finish = __new_finish;this->_M_impl._M_end_of_storage = __new_start + __len;}}}// vector<bool>template<typename _Alloc>voidvector<bool, _Alloc>::reserve(size_type __n){if (__n > this->max_size())__throw_length_error(__N("vector::reserve"));if (this->capacity() < __n){_Bit_type* __q = this->_M_allocate(__n);this->_M_impl._M_finish = _M_copy_aligned(begin(), end(),iterator(__q, 0));this->_M_deallocate();this->_M_impl._M_start = iterator(__q, 0);this->_M_impl._M_end_of_storage = (__q + (__n + int(_S_word_bit) - 1)/ int(_S_word_bit));}}template<typename _Alloc>voidvector<bool, _Alloc>::_M_fill_insert(iterator __position, size_type __n, bool __x){if (__n == 0)return;if (capacity() - size() >= __n){std::copy_backward(__position, end(),this->_M_impl._M_finish + difference_type(__n));std::fill(__position, __position + difference_type(__n), __x);this->_M_impl._M_finish += difference_type(__n);}else{const size_type __len =_M_check_len(__n, "vector<bool>::_M_fill_insert");_Bit_type * __q = this->_M_allocate(__len);iterator __i = _M_copy_aligned(begin(), __position,iterator(__q, 0));std::fill(__i, __i + difference_type(__n), __x);this->_M_impl._M_finish = std::copy(__position, end(),__i + difference_type(__n));this->_M_deallocate();this->_M_impl._M_end_of_storage = (__q + ((__len+ int(_S_word_bit) - 1)/ int(_S_word_bit)));this->_M_impl._M_start = iterator(__q, 0);}}template<typename _Alloc>template<typename _ForwardIterator>voidvector<bool, _Alloc>::_M_insert_range(iterator __position, _ForwardIterator __first,_ForwardIterator __last, std::forward_iterator_tag){if (__first != __last){size_type __n = std::distance(__first, __last);if (capacity() - size() >= __n){std::copy_backward(__position, end(),this->_M_impl._M_finish+ difference_type(__n));std::copy(__first, __last, __position);this->_M_impl._M_finish += difference_type(__n);}else{const size_type __len =_M_check_len(__n, "vector<bool>::_M_insert_range");_Bit_type * __q = this->_M_allocate(__len);iterator __i = _M_copy_aligned(begin(), __position,iterator(__q, 0));__i = std::copy(__first, __last, __i);this->_M_impl._M_finish = std::copy(__position, end(), __i);this->_M_deallocate();this->_M_impl._M_end_of_storage = (__q+ ((__len+ int(_S_word_bit) - 1)/ int(_S_word_bit)));this->_M_impl._M_start = iterator(__q, 0);}}}template<typename _Alloc>voidvector<bool, _Alloc>::_M_insert_aux(iterator __position, bool __x){if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage){std::copy_backward(__position, this->_M_impl._M_finish,this->_M_impl._M_finish + 1);*__position = __x;++this->_M_impl._M_finish;}else{const size_type __len =_M_check_len(size_type(1), "vector<bool>::_M_insert_aux");_Bit_type * __q = this->_M_allocate(__len);iterator __i = _M_copy_aligned(begin(), __position,iterator(__q, 0));*__i++ = __x;this->_M_impl._M_finish = std::copy(__position, end(), __i);this->_M_deallocate();this->_M_impl._M_end_of_storage = (__q + ((__len+ int(_S_word_bit) - 1)/ int(_S_word_bit)));this->_M_impl._M_start = iterator(__q, 0);}}_GLIBCXX_END_NESTED_NAMESPACE#endif /* _VECTOR_TCC */