vector.tcc revision 169691
1117397Skan// Vector implementation (out of line) -*- C++ -*- 2117397Skan 3169691Skan// Copyright (C) 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc. 4117397Skan// 5117397Skan// This file is part of the GNU ISO C++ Library. This library is free 6117397Skan// software; you can redistribute it and/or modify it under the 7117397Skan// terms of the GNU General Public License as published by the 8117397Skan// Free Software Foundation; either version 2, or (at your option) 9117397Skan// any later version. 10117397Skan 11117397Skan// This library is distributed in the hope that it will be useful, 12117397Skan// but WITHOUT ANY WARRANTY; without even the implied warranty of 13117397Skan// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14117397Skan// GNU General Public License for more details. 15117397Skan 16117397Skan// You should have received a copy of the GNU General Public License along 17117397Skan// with this library; see the file COPYING. If not, write to the Free 18169691Skan// Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, 19117397Skan// USA. 20117397Skan 21117397Skan// As a special exception, you may use this file as part of a free software 22117397Skan// library without restriction. Specifically, if other files instantiate 23117397Skan// templates or use macros or inline functions from this file, or you compile 24117397Skan// this file and link it with other files to produce an executable, this 25117397Skan// file does not by itself cause the resulting executable to be covered by 26117397Skan// the GNU General Public License. This exception does not however 27117397Skan// invalidate any other reasons why the executable file might be covered by 28117397Skan// the GNU General Public License. 29117397Skan 30117397Skan/* 31117397Skan * 32117397Skan * Copyright (c) 1994 33117397Skan * Hewlett-Packard Company 34117397Skan * 35117397Skan * Permission to use, copy, modify, distribute and sell this software 36117397Skan * and its documentation for any purpose is hereby granted without fee, 37117397Skan * provided that the above copyright notice appear in all copies and 38117397Skan * that both that copyright notice and this permission notice appear 39117397Skan * in supporting documentation. Hewlett-Packard Company makes no 40117397Skan * representations about the suitability of this software for any 41117397Skan * purpose. It is provided "as is" without express or implied warranty. 42117397Skan * 43117397Skan * 44117397Skan * Copyright (c) 1996 45117397Skan * Silicon Graphics Computer Systems, Inc. 46117397Skan * 47117397Skan * Permission to use, copy, modify, distribute and sell this software 48117397Skan * and its documentation for any purpose is hereby granted without fee, 49117397Skan * provided that the above copyright notice appear in all copies and 50117397Skan * that both that copyright notice and this permission notice appear 51117397Skan * in supporting documentation. Silicon Graphics makes no 52117397Skan * representations about the suitability of this software for any 53117397Skan * purpose. It is provided "as is" without express or implied warranty. 54117397Skan */ 55117397Skan 56117397Skan/** @file vector.tcc 57117397Skan * This is an internal header file, included by other library headers. 58117397Skan * You should not attempt to use it directly. 59117397Skan */ 60117397Skan 61132720Skan#ifndef _VECTOR_TCC 62132720Skan#define _VECTOR_TCC 1 63117397Skan 64169691Skan_GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD) 65169691Skan 66117397Skan template<typename _Tp, typename _Alloc> 67117397Skan void 68169691Skan vector<_Tp, _Alloc>:: 69117397Skan reserve(size_type __n) 70117397Skan { 71117397Skan if (__n > this->max_size()) 72132720Skan __throw_length_error(__N("vector::reserve")); 73117397Skan if (this->capacity() < __n) 74117397Skan { 75117397Skan const size_type __old_size = size(); 76169691Skan pointer __tmp = _M_allocate_and_copy(__n, this->_M_impl._M_start, 77132720Skan this->_M_impl._M_finish); 78169691Skan std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, 79169691Skan _M_get_Tp_allocator()); 80132720Skan _M_deallocate(this->_M_impl._M_start, 81169691Skan this->_M_impl._M_end_of_storage 82169691Skan - this->_M_impl._M_start); 83132720Skan this->_M_impl._M_start = __tmp; 84132720Skan this->_M_impl._M_finish = __tmp + __old_size; 85132720Skan this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n; 86117397Skan } 87117397Skan } 88132720Skan 89117397Skan template<typename _Tp, typename _Alloc> 90169691Skan typename vector<_Tp, _Alloc>::iterator 91169691Skan vector<_Tp, _Alloc>:: 92117397Skan insert(iterator __position, const value_type& __x) 93117397Skan { 94169691Skan const size_type __n = __position - begin(); 95169691Skan if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage 96169691Skan && __position == end()) 97169691Skan { 98169691Skan this->_M_impl.construct(this->_M_impl._M_finish, __x); 99169691Skan ++this->_M_impl._M_finish; 100169691Skan } 101117397Skan else 102117397Skan _M_insert_aux(__position, __x); 103169691Skan return iterator(this->_M_impl._M_start + __n); 104117397Skan } 105132720Skan 106117397Skan template<typename _Tp, typename _Alloc> 107169691Skan typename vector<_Tp, _Alloc>::iterator 108169691Skan vector<_Tp, _Alloc>:: 109117397Skan erase(iterator __position) 110117397Skan { 111117397Skan if (__position + 1 != end()) 112132720Skan std::copy(__position + 1, end(), __position); 113132720Skan --this->_M_impl._M_finish; 114169691Skan this->_M_impl.destroy(this->_M_impl._M_finish); 115117397Skan return __position; 116117397Skan } 117132720Skan 118117397Skan template<typename _Tp, typename _Alloc> 119169691Skan typename vector<_Tp, _Alloc>::iterator 120169691Skan vector<_Tp, _Alloc>:: 121117397Skan erase(iterator __first, iterator __last) 122117397Skan { 123169691Skan if (__last != end()) 124169691Skan std::copy(__last, end(), __first); 125169691Skan _M_erase_at_end(__first.base() + (end() - __last)); 126117397Skan return __first; 127117397Skan } 128132720Skan 129117397Skan template<typename _Tp, typename _Alloc> 130169691Skan vector<_Tp, _Alloc>& 131169691Skan vector<_Tp, _Alloc>:: 132169691Skan operator=(const vector<_Tp, _Alloc>& __x) 133117397Skan { 134117397Skan if (&__x != this) 135169691Skan { 136169691Skan const size_type __xlen = __x.size(); 137169691Skan if (__xlen > capacity()) 138169691Skan { 139169691Skan pointer __tmp = _M_allocate_and_copy(__xlen, __x.begin(), 140169691Skan __x.end()); 141169691Skan std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, 142169691Skan _M_get_Tp_allocator()); 143169691Skan _M_deallocate(this->_M_impl._M_start, 144169691Skan this->_M_impl._M_end_of_storage 145169691Skan - this->_M_impl._M_start); 146169691Skan this->_M_impl._M_start = __tmp; 147169691Skan this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __xlen; 148169691Skan } 149169691Skan else if (size() >= __xlen) 150169691Skan { 151169691Skan std::_Destroy(std::copy(__x.begin(), __x.end(), begin()), 152169691Skan end(), _M_get_Tp_allocator()); 153169691Skan } 154169691Skan else 155169691Skan { 156169691Skan std::copy(__x._M_impl._M_start, __x._M_impl._M_start + size(), 157169691Skan this->_M_impl._M_start); 158169691Skan std::__uninitialized_copy_a(__x._M_impl._M_start + size(), 159169691Skan __x._M_impl._M_finish, 160169691Skan this->_M_impl._M_finish, 161169691Skan _M_get_Tp_allocator()); 162169691Skan } 163169691Skan this->_M_impl._M_finish = this->_M_impl._M_start + __xlen; 164169691Skan } 165117397Skan return *this; 166117397Skan } 167132720Skan 168117397Skan template<typename _Tp, typename _Alloc> 169117397Skan void 170169691Skan vector<_Tp, _Alloc>:: 171117397Skan _M_fill_assign(size_t __n, const value_type& __val) 172117397Skan { 173117397Skan if (__n > capacity()) 174169691Skan { 175169691Skan vector __tmp(__n, __val, _M_get_Tp_allocator()); 176169691Skan __tmp.swap(*this); 177169691Skan } 178117397Skan else if (__n > size()) 179169691Skan { 180169691Skan std::fill(begin(), end(), __val); 181169691Skan std::__uninitialized_fill_n_a(this->_M_impl._M_finish, 182169691Skan __n - size(), __val, 183169691Skan _M_get_Tp_allocator()); 184169691Skan this->_M_impl._M_finish += __n - size(); 185169691Skan } 186117397Skan else 187169691Skan _M_erase_at_end(std::fill_n(this->_M_impl._M_start, __n, __val)); 188117397Skan } 189132720Skan 190169691Skan template<typename _Tp, typename _Alloc> 191169691Skan template<typename _InputIterator> 192169691Skan void 193169691Skan vector<_Tp, _Alloc>:: 194169691Skan _M_assign_aux(_InputIterator __first, _InputIterator __last, 195169691Skan std::input_iterator_tag) 196117397Skan { 197169691Skan pointer __cur(this->_M_impl._M_start); 198169691Skan for (; __first != __last && __cur != this->_M_impl._M_finish; 199169691Skan ++__cur, ++__first) 200169691Skan *__cur = *__first; 201169691Skan if (__first == __last) 202169691Skan _M_erase_at_end(__cur); 203169691Skan else 204169691Skan insert(end(), __first, __last); 205117397Skan } 206169691Skan 207169691Skan template<typename _Tp, typename _Alloc> 208169691Skan template<typename _ForwardIterator> 209169691Skan void 210169691Skan vector<_Tp, _Alloc>:: 211169691Skan _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last, 212169691Skan std::forward_iterator_tag) 213117397Skan { 214169691Skan const size_type __len = std::distance(__first, __last); 215169691Skan 216169691Skan if (__len > capacity()) 217169691Skan { 218169691Skan pointer __tmp(_M_allocate_and_copy(__len, __first, __last)); 219169691Skan std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, 220169691Skan _M_get_Tp_allocator()); 221169691Skan _M_deallocate(this->_M_impl._M_start, 222169691Skan this->_M_impl._M_end_of_storage 223169691Skan - this->_M_impl._M_start); 224169691Skan this->_M_impl._M_start = __tmp; 225169691Skan this->_M_impl._M_finish = this->_M_impl._M_start + __len; 226169691Skan this->_M_impl._M_end_of_storage = this->_M_impl._M_finish; 227169691Skan } 228169691Skan else if (size() >= __len) 229169691Skan _M_erase_at_end(std::copy(__first, __last, this->_M_impl._M_start)); 230169691Skan else 231169691Skan { 232169691Skan _ForwardIterator __mid = __first; 233169691Skan std::advance(__mid, size()); 234169691Skan std::copy(__first, __mid, this->_M_impl._M_start); 235169691Skan this->_M_impl._M_finish = 236169691Skan std::__uninitialized_copy_a(__mid, __last, 237169691Skan this->_M_impl._M_finish, 238169691Skan _M_get_Tp_allocator()); 239169691Skan } 240117397Skan } 241132720Skan 242117397Skan template<typename _Tp, typename _Alloc> 243117397Skan void 244169691Skan vector<_Tp, _Alloc>:: 245117397Skan _M_insert_aux(iterator __position, const _Tp& __x) 246117397Skan { 247132720Skan if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage) 248169691Skan { 249169691Skan this->_M_impl.construct(this->_M_impl._M_finish, 250169691Skan *(this->_M_impl._M_finish - 1)); 251169691Skan ++this->_M_impl._M_finish; 252169691Skan _Tp __x_copy = __x; 253169691Skan std::copy_backward(__position.base(), 254169691Skan this->_M_impl._M_finish - 2, 255169691Skan this->_M_impl._M_finish - 1); 256169691Skan *__position = __x_copy; 257169691Skan } 258117397Skan else 259169691Skan { 260169691Skan const size_type __old_size = size(); 261169691Skan if (__old_size == this->max_size()) 262169691Skan __throw_length_error(__N("vector::_M_insert_aux")); 263169691Skan 264169691Skan // When sizeof(value_type) == 1 and __old_size > size_type(-1)/2 265169691Skan // __len overflows: if we don't notice and _M_allocate doesn't 266169691Skan // throw we crash badly later. 267169691Skan size_type __len = __old_size != 0 ? 2 * __old_size : 1; 268169691Skan if (__len < __old_size) 269169691Skan __len = this->max_size(); 270169691Skan 271169691Skan pointer __new_start(this->_M_allocate(__len)); 272169691Skan pointer __new_finish(__new_start); 273169691Skan try 274169691Skan { 275169691Skan __new_finish = 276169691Skan std::__uninitialized_copy_a(this->_M_impl._M_start, 277169691Skan __position.base(), __new_start, 278169691Skan _M_get_Tp_allocator()); 279169691Skan this->_M_impl.construct(__new_finish, __x); 280169691Skan ++__new_finish; 281169691Skan __new_finish = 282169691Skan std::__uninitialized_copy_a(__position.base(), 283169691Skan this->_M_impl._M_finish, 284169691Skan __new_finish, 285169691Skan _M_get_Tp_allocator()); 286169691Skan } 287169691Skan catch(...) 288169691Skan { 289169691Skan std::_Destroy(__new_start, __new_finish, _M_get_Tp_allocator()); 290169691Skan _M_deallocate(__new_start, __len); 291169691Skan __throw_exception_again; 292169691Skan } 293169691Skan std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, 294169691Skan _M_get_Tp_allocator()); 295169691Skan _M_deallocate(this->_M_impl._M_start, 296169691Skan this->_M_impl._M_end_of_storage 297169691Skan - this->_M_impl._M_start); 298169691Skan this->_M_impl._M_start = __new_start; 299169691Skan this->_M_impl._M_finish = __new_finish; 300169691Skan this->_M_impl._M_end_of_storage = __new_start + __len; 301169691Skan } 302117397Skan } 303132720Skan 304117397Skan template<typename _Tp, typename _Alloc> 305117397Skan void 306169691Skan vector<_Tp, _Alloc>:: 307117397Skan _M_fill_insert(iterator __position, size_type __n, const value_type& __x) 308117397Skan { 309117397Skan if (__n != 0) 310169691Skan { 311169691Skan if (size_type(this->_M_impl._M_end_of_storage 312169691Skan - this->_M_impl._M_finish) >= __n) 313169691Skan { 314169691Skan value_type __x_copy = __x; 315169691Skan const size_type __elems_after = end() - __position; 316169691Skan pointer __old_finish(this->_M_impl._M_finish); 317169691Skan if (__elems_after > __n) 318169691Skan { 319169691Skan std::__uninitialized_copy_a(this->_M_impl._M_finish - __n, 320169691Skan this->_M_impl._M_finish, 321169691Skan this->_M_impl._M_finish, 322169691Skan _M_get_Tp_allocator()); 323169691Skan this->_M_impl._M_finish += __n; 324169691Skan std::copy_backward(__position.base(), __old_finish - __n, 325169691Skan __old_finish); 326169691Skan std::fill(__position.base(), __position.base() + __n, 327169691Skan __x_copy); 328169691Skan } 329169691Skan else 330169691Skan { 331169691Skan std::__uninitialized_fill_n_a(this->_M_impl._M_finish, 332169691Skan __n - __elems_after, 333169691Skan __x_copy, 334169691Skan _M_get_Tp_allocator()); 335169691Skan this->_M_impl._M_finish += __n - __elems_after; 336169691Skan std::__uninitialized_copy_a(__position.base(), __old_finish, 337169691Skan this->_M_impl._M_finish, 338169691Skan _M_get_Tp_allocator()); 339169691Skan this->_M_impl._M_finish += __elems_after; 340169691Skan std::fill(__position.base(), __old_finish, __x_copy); 341169691Skan } 342169691Skan } 343169691Skan else 344169691Skan { 345169691Skan const size_type __old_size = size(); 346169691Skan if (this->max_size() - __old_size < __n) 347169691Skan __throw_length_error(__N("vector::_M_fill_insert")); 348169691Skan 349169691Skan // See _M_insert_aux above. 350169691Skan size_type __len = __old_size + std::max(__old_size, __n); 351169691Skan if (__len < __old_size) 352169691Skan __len = this->max_size(); 353169691Skan 354169691Skan pointer __new_start(this->_M_allocate(__len)); 355169691Skan pointer __new_finish(__new_start); 356169691Skan try 357169691Skan { 358169691Skan __new_finish = 359169691Skan std::__uninitialized_copy_a(this->_M_impl._M_start, 360169691Skan __position.base(), 361169691Skan __new_start, 362169691Skan _M_get_Tp_allocator()); 363169691Skan std::__uninitialized_fill_n_a(__new_finish, __n, __x, 364169691Skan _M_get_Tp_allocator()); 365169691Skan __new_finish += __n; 366169691Skan __new_finish = 367169691Skan std::__uninitialized_copy_a(__position.base(), 368169691Skan this->_M_impl._M_finish, 369169691Skan __new_finish, 370169691Skan _M_get_Tp_allocator()); 371169691Skan } 372169691Skan catch(...) 373169691Skan { 374169691Skan std::_Destroy(__new_start, __new_finish, 375169691Skan _M_get_Tp_allocator()); 376169691Skan _M_deallocate(__new_start, __len); 377169691Skan __throw_exception_again; 378169691Skan } 379169691Skan std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, 380169691Skan _M_get_Tp_allocator()); 381169691Skan _M_deallocate(this->_M_impl._M_start, 382169691Skan this->_M_impl._M_end_of_storage 383169691Skan - this->_M_impl._M_start); 384169691Skan this->_M_impl._M_start = __new_start; 385169691Skan this->_M_impl._M_finish = __new_finish; 386169691Skan this->_M_impl._M_end_of_storage = __new_start + __len; 387169691Skan } 388169691Skan } 389169691Skan } 390169691Skan 391169691Skan template<typename _Tp, typename _Alloc> template<typename _InputIterator> 392169691Skan void 393169691Skan vector<_Tp, _Alloc>:: 394169691Skan _M_range_insert(iterator __pos, _InputIterator __first, 395169691Skan _InputIterator __last, std::input_iterator_tag) 396169691Skan { 397169691Skan for (; __first != __last; ++__first) 398169691Skan { 399169691Skan __pos = insert(__pos, *__first); 400169691Skan ++__pos; 401169691Skan } 402169691Skan } 403169691Skan 404169691Skan template<typename _Tp, typename _Alloc> 405169691Skan template<typename _ForwardIterator> 406169691Skan void 407169691Skan vector<_Tp, _Alloc>:: 408169691Skan _M_range_insert(iterator __position, _ForwardIterator __first, 409169691Skan _ForwardIterator __last, std::forward_iterator_tag) 410117397Skan { 411169691Skan if (__first != __last) 412117397Skan { 413169691Skan const size_type __n = std::distance(__first, __last); 414169691Skan if (size_type(this->_M_impl._M_end_of_storage 415169691Skan - this->_M_impl._M_finish) >= __n) 416117397Skan { 417169691Skan const size_type __elems_after = end() - __position; 418169691Skan pointer __old_finish(this->_M_impl._M_finish); 419169691Skan if (__elems_after > __n) 420169691Skan { 421169691Skan std::__uninitialized_copy_a(this->_M_impl._M_finish - __n, 422169691Skan this->_M_impl._M_finish, 423169691Skan this->_M_impl._M_finish, 424169691Skan _M_get_Tp_allocator()); 425169691Skan this->_M_impl._M_finish += __n; 426169691Skan std::copy_backward(__position.base(), __old_finish - __n, 427169691Skan __old_finish); 428169691Skan std::copy(__first, __last, __position); 429169691Skan } 430169691Skan else 431169691Skan { 432169691Skan _ForwardIterator __mid = __first; 433169691Skan std::advance(__mid, __elems_after); 434169691Skan std::__uninitialized_copy_a(__mid, __last, 435169691Skan this->_M_impl._M_finish, 436169691Skan _M_get_Tp_allocator()); 437169691Skan this->_M_impl._M_finish += __n - __elems_after; 438169691Skan std::__uninitialized_copy_a(__position.base(), 439169691Skan __old_finish, 440169691Skan this->_M_impl._M_finish, 441169691Skan _M_get_Tp_allocator()); 442169691Skan this->_M_impl._M_finish += __elems_after; 443169691Skan std::copy(__first, __mid, __position); 444169691Skan } 445117397Skan } 446169691Skan else 447117397Skan { 448169691Skan const size_type __old_size = size(); 449169691Skan if (this->max_size() - __old_size < __n) 450169691Skan __throw_length_error(__N("vector::_M_range_insert")); 451169691Skan 452169691Skan // See _M_insert_aux above. 453169691Skan size_type __len = __old_size + std::max(__old_size, __n); 454169691Skan if (__len < __old_size) 455169691Skan __len = this->max_size(); 456169691Skan 457169691Skan pointer __new_start(this->_M_allocate(__len)); 458169691Skan pointer __new_finish(__new_start); 459169691Skan try 460169691Skan { 461169691Skan __new_finish = 462169691Skan std::__uninitialized_copy_a(this->_M_impl._M_start, 463169691Skan __position.base(), 464169691Skan __new_start, 465169691Skan _M_get_Tp_allocator()); 466169691Skan __new_finish = 467169691Skan std::__uninitialized_copy_a(__first, __last, __new_finish, 468169691Skan _M_get_Tp_allocator()); 469169691Skan __new_finish = 470169691Skan std::__uninitialized_copy_a(__position.base(), 471169691Skan this->_M_impl._M_finish, 472169691Skan __new_finish, 473169691Skan _M_get_Tp_allocator()); 474169691Skan } 475169691Skan catch(...) 476169691Skan { 477169691Skan std::_Destroy(__new_start, __new_finish, 478169691Skan _M_get_Tp_allocator()); 479169691Skan _M_deallocate(__new_start, __len); 480169691Skan __throw_exception_again; 481169691Skan } 482169691Skan std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish, 483169691Skan _M_get_Tp_allocator()); 484169691Skan _M_deallocate(this->_M_impl._M_start, 485169691Skan this->_M_impl._M_end_of_storage 486169691Skan - this->_M_impl._M_start); 487169691Skan this->_M_impl._M_start = __new_start; 488169691Skan this->_M_impl._M_finish = __new_finish; 489169691Skan this->_M_impl._M_end_of_storage = __new_start + __len; 490117397Skan } 491117397Skan } 492117397Skan } 493132720Skan 494169691Skan_GLIBCXX_END_NESTED_NAMESPACE 495132720Skan 496132720Skan#endif /* _VECTOR_TCC */ 497