libstdc++-v3/include/bits/vector.tcc

   1 // Vector implementation (out of line) -*- C++ -*-
   2
   3 // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007
   4 // Free Software Foundation, Inc.
   5 //
   6 // This file is part of the GNU ISO C++ Library.  This library is free
   7 // software; you can redistribute it and/or modify it under the
   8 // terms of the GNU General Public License as published by the
   9 // Free Software Foundation; either version 2, or (at your option)
  10 // any later version.
  11
  12 // This library is distributed in the hope that it will be useful,
  13 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  14 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  15 // GNU General Public License for more details.
  16
  17 // You should have received a copy of the GNU General Public License along
  18 // with this library; see the file COPYING.  If not, write to the Free
  19 // Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,
  20 // USA.
  21
  22 // As a special exception, you may use this file as part of a free software
  23 // library without restriction.  Specifically, if other files instantiate
  24 // templates or use macros or inline functions from this file, or you compile
  25 // this file and link it with other files to produce an executable, this
  26 // file does not by itself cause the resulting executable to be covered by
  27 // the GNU General Public License.  This exception does not however
  28 // invalidate any other reasons why the executable file might be covered by
  29 // the GNU General Public License.
  30
  31 /*
  32  *
  33  * Copyright (c) 1994
  34  * Hewlett-Packard Company
  35  *
  36  * Permission to use, copy, modify, distribute and sell this software
  37  * and its documentation for any purpose is hereby granted without fee,
  38  * provided that the above copyright notice appear in all copies and
  39  * that both that copyright notice and this permission notice appear
  40  * in supporting documentation.  Hewlett-Packard Company makes no
  41  * representations about the suitability of this software for any
  42  * purpose.  It is provided "as is" without express or implied warranty.
  43  *
  44  *
  45  * Copyright (c) 1996
  46  * Silicon Graphics Computer Systems, Inc.
  47  *
  48  * Permission to use, copy, modify, distribute and sell this software
  49  * and its documentation for any purpose is hereby granted without fee,
  50  * provided that the above copyright notice appear in all copies and
  51  * that both that copyright notice and this permission notice appear
  52  * in supporting documentation.  Silicon Graphics makes no
  53  * representations about the suitability of this  software for any
  54  * purpose.  It is provided "as is" without express or implied warranty.
  55  */
  56
  57 /** @file vector.tcc
  58  *  This is an internal header file, included by other library headers.
  59  *  You should not attempt to use it directly.
  60  */
  61
  62 #ifndef _VECTOR_TCC
  63 #define _VECTOR_TCC 1
  64
  65 _GLIBCXX_BEGIN_NESTED_NAMESPACE(std, _GLIBCXX_STD)
  66
  67   template<typename _Tp, typename _Alloc>
  68     void
  69     vector<_Tp, _Alloc>::
  70     reserve(size_type __n)
  71     {
  72       if (__n > this->max_size())
  73         __throw_length_error(__N("vector::reserve"));
  74       if (this->capacity() < __n)
  75         {
  76           const size_type __old_size = size();
  77           pointer __tmp = _M_allocate_and_copy(__n, this->_M_impl._M_start,
  78                                                this->_M_impl._M_finish);
  79           std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
  80                         _M_get_Tp_allocator());
  81           _M_deallocate(this->_M_impl._M_start,
  82                         this->_M_impl._M_end_of_storage
  83                         - this->_M_impl._M_start);
  84           this->_M_impl._M_start = __tmp;
  85           this->_M_impl._M_finish = __tmp + __old_size;
  86           this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
  87         }
  88     }
  89
  90   template<typename _Tp, typename _Alloc>
  91     typename vector<_Tp, _Alloc>::iterator
  92     vector<_Tp, _Alloc>::
  93     insert(iterator __position, const value_type& __x)
  94     {
  95       const size_type __n = __position - begin();
  96       if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage
  97           && __position == end())
  98         {
  99           this->_M_impl.construct(this->_M_impl._M_finish, __x);
 100           ++this->_M_impl._M_finish;
 101         }
 102       else
 103         _M_insert_aux(__position, __x);
 104       return iterator(this->_M_impl._M_start + __n);
 105     }
 106
 107   template<typename _Tp, typename _Alloc>
 108     typename vector<_Tp, _Alloc>::iterator
 109     vector<_Tp, _Alloc>::
 110     erase(iterator __position)
 111     {
 112       if (__position + 1 != end())
 113         std::copy(__position + 1, end(), __position);
 114       --this->_M_impl._M_finish;
 115       this->_M_impl.destroy(this->_M_impl._M_finish);
 116       return __position;
 117     }
 118
 119   template<typename _Tp, typename _Alloc>
 120     typename vector<_Tp, _Alloc>::iterator
 121     vector<_Tp, _Alloc>::
 122     erase(iterator __first, iterator __last)
 123     {
 124       if (__last != end())
 125         std::copy(__last, end(), __first);
 126       _M_erase_at_end(__first.base() + (end() - __last));
 127       return __first;
 128     }
 129
 130   template<typename _Tp, typename _Alloc>
 131     vector<_Tp, _Alloc>&
 132     vector<_Tp, _Alloc>::
 133     operator=(const vector<_Tp, _Alloc>& __x)
 134     {
 135       if (&__x != this)
 136         {
 137           const size_type __xlen = __x.size();
 138           if (__xlen > capacity())
 139             {
 140               pointer __tmp = _M_allocate_and_copy(__xlen, __x.begin(),
 141                                                    __x.end());
 142               std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
 143                             _M_get_Tp_allocator());
 144               _M_deallocate(this->_M_impl._M_start,
 145                             this->_M_impl._M_end_of_storage
 146                             - this->_M_impl._M_start);
 147               this->_M_impl._M_start = __tmp;
 148               this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __xlen;
 149             }
 150           else if (size() >= __xlen)
 151             {
 152               std::_Destroy(std::copy(__x.begin(), __x.end(), begin()),
 153                             end(), _M_get_Tp_allocator());
 154             }
 155           else
 156             {
 157               std::copy(__x._M_impl._M_start, __x._M_impl._M_start + size(),
 158                         this->_M_impl._M_start);
 159               std::__uninitialized_copy_a(__x._M_impl._M_start + size(),
 160                                           __x._M_impl._M_finish,
 161                                           this->_M_impl._M_finish,
 162                                           _M_get_Tp_allocator());
 163             }
 164           this->_M_impl._M_finish = this->_M_impl._M_start + __xlen;
 165         }
 166       return *this;
 167     }
 168
 169   template<typename _Tp, typename _Alloc>
 170     void
 171     vector<_Tp, _Alloc>::
 172     _M_fill_assign(size_t __n, const value_type& __val)
 173     {
 174       if (__n > capacity())
 175         {
 176           vector __tmp(__n, __val, _M_get_Tp_allocator());
 177           __tmp.swap(*this);
 178         }
 179       else if (__n > size())
 180         {
 181           std::fill(begin(), end(), __val);
 182           std::__uninitialized_fill_n_a(this->_M_impl._M_finish,
 183                                         __n - size(), __val,
 184                                         _M_get_Tp_allocator());
 185           this->_M_impl._M_finish += __n - size();
 186         }
 187       else
 188         _M_erase_at_end(std::fill_n(this->_M_impl._M_start, __n, __val));
 189     }
 190
 191   template<typename _Tp, typename _Alloc>
 192     template<typename _InputIterator>
 193       void
 194       vector<_Tp, _Alloc>::
 195       _M_assign_aux(_InputIterator __first, _InputIterator __last,
 196                     std::input_iterator_tag)
 197       {
 198         pointer __cur(this->_M_impl._M_start);
 199         for (; __first != __last && __cur != this->_M_impl._M_finish;
 200              ++__cur, ++__first)
 201           *__cur = *__first;
 202         if (__first == __last)
 203           _M_erase_at_end(__cur);
 204         else
 205           insert(end(), __first, __last);
 206       }
 207
 208   template<typename _Tp, typename _Alloc>
 209     template<typename _ForwardIterator>
 210       void
 211       vector<_Tp, _Alloc>::
 212       _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
 213                     std::forward_iterator_tag)
 214       {
 215         const size_type __len = std::distance(__first, __last);
 216
 217         if (__len > capacity())
 218           {
 219             pointer __tmp(_M_allocate_and_copy(__len, __first, __last));
 220             std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
 221                           _M_get_Tp_allocator());
 222             _M_deallocate(this->_M_impl._M_start,
 223                           this->_M_impl._M_end_of_storage
 224                           - this->_M_impl._M_start);
 225             this->_M_impl._M_start = __tmp;
 226             this->_M_impl._M_finish = this->_M_impl._M_start + __len;
 227             this->_M_impl._M_end_of_storage = this->_M_impl._M_finish;
 228           }
 229         else if (size() >= __len)
 230           _M_erase_at_end(std::copy(__first, __last, this->_M_impl._M_start));
 231         else
 232           {
 233             _ForwardIterator __mid = __first;
 234             std::advance(__mid, size());
 235             std::copy(__first, __mid, this->_M_impl._M_start);
 236             this->_M_impl._M_finish =
 237               std::__uninitialized_copy_a(__mid, __last,
 238                                           this->_M_impl._M_finish,
 239                                           _M_get_Tp_allocator());
 240           }
 241       }
 242
 243   template<typename _Tp, typename _Alloc>
 244     void
 245     vector<_Tp, _Alloc>::
 246     _M_insert_aux(iterator __position, const _Tp& __x)
 247     {
 248       if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
 249         {
 250           this->_M_impl.construct(this->_M_impl._M_finish,
 251                                   *(this->_M_impl._M_finish - 1));
 252           ++this->_M_impl._M_finish;
 253           _Tp __x_copy = __x;
 254           std::copy_backward(__position.base(),
 255                              this->_M_impl._M_finish - 2,
 256                              this->_M_impl._M_finish - 1);
 257           *__position = __x_copy;
 258         }
 259       else
 260         {
 261           const size_type __old_size = size();
 262           if (__old_size == this->max_size())
 263             __throw_length_error(__N("vector::_M_insert_aux"));
 264
 265           // When sizeof(value_type) == 1 and __old_size > size_type(-1)/2
 266           // __len overflows: if we don't notice and _M_allocate doesn't
 267           // throw we crash badly later.
 268           size_type __len = __old_size != 0 ? 2 * __old_size : 1;
 269           if (__len < __old_size)
 270             __len = this->max_size();
 271
 272           pointer __new_start(this->_M_allocate(__len));
 273           pointer __new_finish(__new_start);
 274           try
 275             {
 276               __new_finish =
 277                 std::__uninitialized_copy_a(this->_M_impl._M_start,
 278                                             __position.base(), __new_start,
 279                                             _M_get_Tp_allocator());
 280               this->_M_impl.construct(__new_finish, __x);
 281               ++__new_finish;
 282               __new_finish =
 283                 std::__uninitialized_copy_a(__position.base(),
 284                                             this->_M_impl._M_finish,
 285                                             __new_finish,
 286                                             _M_get_Tp_allocator());
 287             }
 288           catch(...)
 289             {
 290               std::_Destroy(__new_start, __new_finish, _M_get_Tp_allocator());
 291               _M_deallocate(__new_start, __len);
 292               __throw_exception_again;
 293             }
 294           std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
 295                         _M_get_Tp_allocator());
 296           _M_deallocate(this->_M_impl._M_start,
 297                         this->_M_impl._M_end_of_storage
 298                         - this->_M_impl._M_start);
 299           this->_M_impl._M_start = __new_start;
 300           this->_M_impl._M_finish = __new_finish;
 301           this->_M_impl._M_end_of_storage = __new_start + __len;
 302         }
 303     }
 304
 305   template<typename _Tp, typename _Alloc>
 306     void
 307     vector<_Tp, _Alloc>::
 308     _M_fill_insert(iterator __position, size_type __n, const value_type& __x)
 309     {
 310       if (__n != 0)
 311         {
 312           if (size_type(this->_M_impl._M_end_of_storage
 313                         - this->_M_impl._M_finish) >= __n)
 314             {
 315               value_type __x_copy = __x;
 316               const size_type __elems_after = end() - __position;
 317               pointer __old_finish(this->_M_impl._M_finish);
 318               if (__elems_after > __n)
 319                 {
 320                   std::__uninitialized_copy_a(this->_M_impl._M_finish - __n,
 321                                               this->_M_impl._M_finish,
 322                                               this->_M_impl._M_finish,
 323                                               _M_get_Tp_allocator());
 324                   this->_M_impl._M_finish += __n;
 325                   std::copy_backward(__position.base(), __old_finish - __n,
 326                                      __old_finish);
 327                   std::fill(__position.base(), __position.base() + __n,
 328                             __x_copy);
 329                 }
 330               else
 331                 {
 332                   std::__uninitialized_fill_n_a(this->_M_impl._M_finish,
 333                                                 __n - __elems_after,
 334                                                 __x_copy,
 335                                                 _M_get_Tp_allocator());
 336                   this->_M_impl._M_finish += __n - __elems_after;
 337                   std::__uninitialized_copy_a(__position.base(), __old_finish,
 338                                               this->_M_impl._M_finish,
 339                                               _M_get_Tp_allocator());
 340                   this->_M_impl._M_finish += __elems_after;
 341                   std::fill(__position.base(), __old_finish, __x_copy);
 342                 }
 343             }
 344           else
 345             {
 346               const size_type __old_size = size();
 347               if (this->max_size() - __old_size < __n)
 348                 __throw_length_error(__N("vector::_M_fill_insert"));
 349
 350               // See _M_insert_aux above.
 351               size_type __len = __old_size + std::max(__old_size, __n);
 352               if (__len < __old_size)
 353                 __len = this->max_size();
 354
 355               pointer __new_start(this->_M_allocate(__len));
 356               pointer __new_finish(__new_start);
 357               try
 358                 {
 359                   __new_finish =
 360                     std::__uninitialized_copy_a(this->_M_impl._M_start,
 361                                                 __position.base(),
 362                                                 __new_start,
 363                                                 _M_get_Tp_allocator());
 364                   std::__uninitialized_fill_n_a(__new_finish, __n, __x,
 365                                                 _M_get_Tp_allocator());
 366                   __new_finish += __n;
 367                   __new_finish =
 368                     std::__uninitialized_copy_a(__position.base(),
 369                                                 this->_M_impl._M_finish,
 370                                                 __new_finish,
 371                                                 _M_get_Tp_allocator());
 372                 }
 373               catch(...)
 374                 {
 375                   std::_Destroy(__new_start, __new_finish,
 376                                 _M_get_Tp_allocator());
 377                   _M_deallocate(__new_start, __len);
 378                   __throw_exception_again;
 379                 }
 380               std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
 381                             _M_get_Tp_allocator());
 382               _M_deallocate(this->_M_impl._M_start,
 383                             this->_M_impl._M_end_of_storage
 384                             - this->_M_impl._M_start);
 385               this->_M_impl._M_start = __new_start;
 386               this->_M_impl._M_finish = __new_finish;
 387               this->_M_impl._M_end_of_storage = __new_start + __len;
 388             }
 389         }
 390     }
 391
 392   template<typename _Tp, typename _Alloc>
 393     template<typename _InputIterator>
 394       void
 395       vector<_Tp, _Alloc>::
 396       _M_range_insert(iterator __pos, _InputIterator __first,
 397                       _InputIterator __last, std::input_iterator_tag)
 398       {
 399         for (; __first != __last; ++__first)
 400           {
 401             __pos = insert(__pos, *__first);
 402             ++__pos;
 403           }
 404       }
 405
 406   template<typename _Tp, typename _Alloc>
 407     template<typename _ForwardIterator>
 408       void
 409       vector<_Tp, _Alloc>::
 410       _M_range_insert(iterator __position, _ForwardIterator __first,
 411                       _ForwardIterator __last, std::forward_iterator_tag)
 412       {
 413         if (__first != __last)
 414           {
 415             const size_type __n = std::distance(__first, __last);
 416             if (size_type(this->_M_impl._M_end_of_storage
 417                           - this->_M_impl._M_finish) >= __n)
 418               {
 419                 const size_type __elems_after = end() - __position;
 420                 pointer __old_finish(this->_M_impl._M_finish);
 421                 if (__elems_after > __n)
 422                   {
 423                     std::__uninitialized_copy_a(this->_M_impl._M_finish - __n,
 424                                                 this->_M_impl._M_finish,
 425                                                 this->_M_impl._M_finish,
 426                                                 _M_get_Tp_allocator());
 427                     this->_M_impl._M_finish += __n;
 428                     std::copy_backward(__position.base(), __old_finish - __n,
 429                                        __old_finish);
 430                     std::copy(__first, __last, __position);
 431                   }
 432                 else
 433                   {
 434                     _ForwardIterator __mid = __first;
 435                     std::advance(__mid, __elems_after);
 436                     std::__uninitialized_copy_a(__mid, __last,
 437                                                 this->_M_impl._M_finish,
 438                                                 _M_get_Tp_allocator());
 439                     this->_M_impl._M_finish += __n - __elems_after;
 440                     std::__uninitialized_copy_a(__position.base(),
 441                                                 __old_finish,
 442                                                 this->_M_impl._M_finish,
 443                                                 _M_get_Tp_allocator());
 444                     this->_M_impl._M_finish += __elems_after;
 445                     std::copy(__first, __mid, __position);
 446                   }
 447               }
 448             else
 449               {
 450                 const size_type __old_size = size();
 451                 if (this->max_size() - __old_size < __n)
 452                   __throw_length_error(__N("vector::_M_range_insert"));
 453
 454                 // See _M_insert_aux above.
 455                 size_type __len = __old_size + std::max(__old_size, __n);
 456                 if (__len < __old_size)
 457                   __len = this->max_size();
 458
 459                 pointer __new_start(this->_M_allocate(__len));
 460                 pointer __new_finish(__new_start);
 461                 try
 462                   {
 463                     __new_finish =
 464                       std::__uninitialized_copy_a(this->_M_impl._M_start,
 465                                                   __position.base(),
 466                                                   __new_start,
 467                                                   _M_get_Tp_allocator());
 468                     __new_finish =
 469                       std::__uninitialized_copy_a(__first, __last, __new_finish,
 470                                                   _M_get_Tp_allocator());
 471                     __new_finish =
 472                       std::__uninitialized_copy_a(__position.base(),
 473                                                   this->_M_impl._M_finish,
 474                                                   __new_finish,
 475                                                   _M_get_Tp_allocator());
 476                   }
 477                 catch(...)
 478                   {
 479                     std::_Destroy(__new_start, __new_finish,
 480                                   _M_get_Tp_allocator());
 481                     _M_deallocate(__new_start, __len);
 482                     __throw_exception_again;
 483                   }
 484                 std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
 485                               _M_get_Tp_allocator());
 486                 _M_deallocate(this->_M_impl._M_start,
 487                               this->_M_impl._M_end_of_storage
 488                               - this->_M_impl._M_start);
 489                 this->_M_impl._M_start = __new_start;
 490                 this->_M_impl._M_finish = __new_finish;
 491                 this->_M_impl._M_end_of_storage = __new_start + __len;
 492               }
 493           }
 494       }
 495
 496
 497   // vector<bool>
 498
 499   template<typename _Alloc>
 500     void
 501     vector<bool, _Alloc>::
 502     _M_fill_insert(iterator __position, size_type __n, bool __x)
 503     {
 504       if (__n == 0)
 505         return;
 506       if (capacity() - size() >= __n)
 507         {
 508           std::copy_backward(__position, end(),
 509                              this->_M_impl._M_finish + difference_type(__n));
 510           std::fill(__position, __position + difference_type(__n), __x);
 511           this->_M_impl._M_finish += difference_type(__n);
 512         }
 513       else
 514         {
 515           const size_type __len = size() + std::max(size(), __n);
 516           _Bit_type * __q = this->_M_allocate(__len);
 517           iterator __i = _M_copy_aligned(begin(), __position,
 518                                          iterator(__q, 0));
 519           std::fill(__i, __i + difference_type(__n), __x);
 520           this->_M_impl._M_finish = std::copy(__position, end(),
 521                                               __i + difference_type(__n));
 522           this->_M_deallocate();
 523           this->_M_impl._M_end_of_storage = (__q + ((__len
 524                                                      + int(_S_word_bit) - 1)
 525                                                     / int(_S_word_bit)));
 526           this->_M_impl._M_start = iterator(__q, 0);
 527         }
 528     }
 529
 530   template<typename _Alloc>
 531     template<typename _ForwardIterator>
 532       void
 533       vector<bool, _Alloc>::
 534       _M_insert_range(iterator __position, _ForwardIterator __first,
 535                       _ForwardIterator __last, std::forward_iterator_tag)
 536       {
 537         if (__first != __last)
 538           {
 539             size_type __n = std::distance(__first, __last);
 540             if (capacity() - size() >= __n)
 541               {
 542                 std::copy_backward(__position, end(),
 543                                    this->_M_impl._M_finish
 544                                    + difference_type(__n));
 545                 std::copy(__first, __last, __position);
 546                 this->_M_impl._M_finish += difference_type(__n);
 547               }
 548             else
 549               {
 550                 const size_type __len = size() + std::max(size(), __n);
 551                 _Bit_type * __q = this->_M_allocate(__len);
 552                 iterator __i = _M_copy_aligned(begin(), __position,
 553                                                iterator(__q, 0));
 554                 __i = std::copy(__first, __last, __i);
 555                 this->_M_impl._M_finish = std::copy(__position, end(), __i);
 556                 this->_M_deallocate();
 557                 this->_M_impl._M_end_of_storage = (__q
 558                                                    + ((__len
 559                                                        + int(_S_word_bit) - 1)
 560                                                       / int(_S_word_bit)));
 561                 this->_M_impl._M_start = iterator(__q, 0);
 562               }
 563           }
 564       }
 565
 566   template<typename _Alloc>
 567     void
 568     vector<bool, _Alloc>::
 569     _M_insert_aux(iterator __position, bool __x)
 570     {
 571       if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage)
 572         {
 573           std::copy_backward(__position, this->_M_impl._M_finish,
 574                              this->_M_impl._M_finish + 1);
 575           *__position = __x;
 576           ++this->_M_impl._M_finish;
 577         }
 578       else
 579         {
 580           const size_type __len = size() ? 2 * size()
 581                                          : static_cast<size_type>(_S_word_bit);
 582           _Bit_type * __q = this->_M_allocate(__len);
 583           iterator __i = _M_copy_aligned(begin(), __position,
 584                                          iterator(__q, 0));
 585           *__i++ = __x;
 586           this->_M_impl._M_finish = std::copy(__position, end(), __i);
 587           this->_M_deallocate();
 588           this->_M_impl._M_end_of_storage = (__q + ((__len
 589                                                      + int(_S_word_bit) - 1)
 590                                                     / int(_S_word_bit)));
 591           this->_M_impl._M_start = iterator(__q, 0);
 592         }
 593     }
 594
 595 _GLIBCXX_END_NESTED_NAMESPACE
 596
 597 #endif /* _VECTOR_TCC */