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_D)
  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 __len =
 262             _M_check_len(size_type(1), "vector::_M_insert_aux");
 263           pointer __new_start(this->_M_allocate(__len));
 264           pointer __new_finish(__new_start);
 265           try
 266             {
 267               __new_finish =
 268                 std::__uninitialized_copy_a(this->_M_impl._M_start,
 269                                             __position.base(), __new_start,
 270                                             _M_get_Tp_allocator());
 271               this->_M_impl.construct(__new_finish, __x);
 272               ++__new_finish;
 273               __new_finish =
 274                 std::__uninitialized_copy_a(__position.base(),
 275                                             this->_M_impl._M_finish,
 276                                             __new_finish,
 277                                             _M_get_Tp_allocator());
 278             }
 279           catch(...)
 280             {
 281               std::_Destroy(__new_start, __new_finish, _M_get_Tp_allocator());
 282               _M_deallocate(__new_start, __len);
 283               __throw_exception_again;
 284             }
 285           std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
 286                         _M_get_Tp_allocator());
 287           _M_deallocate(this->_M_impl._M_start,
 288                         this->_M_impl._M_end_of_storage
 289                         - this->_M_impl._M_start);
 290           this->_M_impl._M_start = __new_start;
 291           this->_M_impl._M_finish = __new_finish;
 292           this->_M_impl._M_end_of_storage = __new_start + __len;
 293         }
 294     }
 295
 296   template<typename _Tp, typename _Alloc>
 297     void
 298     vector<_Tp, _Alloc>::
 299     _M_fill_insert(iterator __position, size_type __n, const value_type& __x)
 300     {
 301       if (__n != 0)
 302         {
 303           if (size_type(this->_M_impl._M_end_of_storage
 304                         - this->_M_impl._M_finish) >= __n)
 305             {
 306               value_type __x_copy = __x;
 307               const size_type __elems_after = end() - __position;
 308               pointer __old_finish(this->_M_impl._M_finish);
 309               if (__elems_after > __n)
 310                 {
 311                   std::__uninitialized_copy_a(this->_M_impl._M_finish - __n,
 312                                               this->_M_impl._M_finish,
 313                                               this->_M_impl._M_finish,
 314                                               _M_get_Tp_allocator());
 315                   this->_M_impl._M_finish += __n;
 316                   std::copy_backward(__position.base(), __old_finish - __n,
 317                                      __old_finish);
 318                   std::fill(__position.base(), __position.base() + __n,
 319                             __x_copy);
 320                 }
 321               else
 322                 {
 323                   std::__uninitialized_fill_n_a(this->_M_impl._M_finish,
 324                                                 __n - __elems_after,
 325                                                 __x_copy,
 326                                                 _M_get_Tp_allocator());
 327                   this->_M_impl._M_finish += __n - __elems_after;
 328                   std::__uninitialized_copy_a(__position.base(), __old_finish,
 329                                               this->_M_impl._M_finish,
 330                                               _M_get_Tp_allocator());
 331                   this->_M_impl._M_finish += __elems_after;
 332                   std::fill(__position.base(), __old_finish, __x_copy);
 333                 }
 334             }
 335           else
 336             {
 337               const size_type __len =
 338                 _M_check_len(__n, "vector::_M_fill_insert");
 339               pointer __new_start(this->_M_allocate(__len));
 340               pointer __new_finish(__new_start);
 341               try
 342                 {
 343                   __new_finish =
 344                     std::__uninitialized_copy_a(this->_M_impl._M_start,
 345                                                 __position.base(),
 346                                                 __new_start,
 347                                                 _M_get_Tp_allocator());
 348                   std::__uninitialized_fill_n_a(__new_finish, __n, __x,
 349                                                 _M_get_Tp_allocator());
 350                   __new_finish += __n;
 351                   __new_finish =
 352                     std::__uninitialized_copy_a(__position.base(),
 353                                                 this->_M_impl._M_finish,
 354                                                 __new_finish,
 355                                                 _M_get_Tp_allocator());
 356                 }
 357               catch(...)
 358                 {
 359                   std::_Destroy(__new_start, __new_finish,
 360                                 _M_get_Tp_allocator());
 361                   _M_deallocate(__new_start, __len);
 362                   __throw_exception_again;
 363                 }
 364               std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
 365                             _M_get_Tp_allocator());
 366               _M_deallocate(this->_M_impl._M_start,
 367                             this->_M_impl._M_end_of_storage
 368                             - this->_M_impl._M_start);
 369               this->_M_impl._M_start = __new_start;
 370               this->_M_impl._M_finish = __new_finish;
 371               this->_M_impl._M_end_of_storage = __new_start + __len;
 372             }
 373         }
 374     }
 375
 376   template<typename _Tp, typename _Alloc>
 377     template<typename _InputIterator>
 378       void
 379       vector<_Tp, _Alloc>::
 380       _M_range_insert(iterator __pos, _InputIterator __first,
 381                       _InputIterator __last, std::input_iterator_tag)
 382       {
 383         for (; __first != __last; ++__first)
 384           {
 385             __pos = insert(__pos, *__first);
 386             ++__pos;
 387           }
 388       }
 389
 390   template<typename _Tp, typename _Alloc>
 391     template<typename _ForwardIterator>
 392       void
 393       vector<_Tp, _Alloc>::
 394       _M_range_insert(iterator __position, _ForwardIterator __first,
 395                       _ForwardIterator __last, std::forward_iterator_tag)
 396       {
 397         if (__first != __last)
 398           {
 399             const size_type __n = std::distance(__first, __last);
 400             if (size_type(this->_M_impl._M_end_of_storage
 401                           - this->_M_impl._M_finish) >= __n)
 402               {
 403                 const size_type __elems_after = end() - __position;
 404                 pointer __old_finish(this->_M_impl._M_finish);
 405                 if (__elems_after > __n)
 406                   {
 407                     std::__uninitialized_copy_a(this->_M_impl._M_finish - __n,
 408                                                 this->_M_impl._M_finish,
 409                                                 this->_M_impl._M_finish,
 410                                                 _M_get_Tp_allocator());
 411                     this->_M_impl._M_finish += __n;
 412                     std::copy_backward(__position.base(), __old_finish - __n,
 413                                        __old_finish);
 414                     std::copy(__first, __last, __position);
 415                   }
 416                 else
 417                   {
 418                     _ForwardIterator __mid = __first;
 419                     std::advance(__mid, __elems_after);
 420                     std::__uninitialized_copy_a(__mid, __last,
 421                                                 this->_M_impl._M_finish,
 422                                                 _M_get_Tp_allocator());
 423                     this->_M_impl._M_finish += __n - __elems_after;
 424                     std::__uninitialized_copy_a(__position.base(),
 425                                                 __old_finish,
 426                                                 this->_M_impl._M_finish,
 427                                                 _M_get_Tp_allocator());
 428                     this->_M_impl._M_finish += __elems_after;
 429                     std::copy(__first, __mid, __position);
 430                   }
 431               }
 432             else
 433               {
 434                 const size_type __len =
 435                   _M_check_len(__n, "vector::_M_range_insert");
 436                 pointer __new_start(this->_M_allocate(__len));
 437                 pointer __new_finish(__new_start);
 438                 try
 439                   {
 440                     __new_finish =
 441                       std::__uninitialized_copy_a(this->_M_impl._M_start,
 442                                                   __position.base(),
 443                                                   __new_start,
 444                                                   _M_get_Tp_allocator());
 445                     __new_finish =
 446                       std::__uninitialized_copy_a(__first, __last, __new_finish,
 447                                                   _M_get_Tp_allocator());
 448                     __new_finish =
 449                       std::__uninitialized_copy_a(__position.base(),
 450                                                   this->_M_impl._M_finish,
 451                                                   __new_finish,
 452                                                   _M_get_Tp_allocator());
 453                   }
 454                 catch(...)
 455                   {
 456                     std::_Destroy(__new_start, __new_finish,
 457                                   _M_get_Tp_allocator());
 458                     _M_deallocate(__new_start, __len);
 459                     __throw_exception_again;
 460                   }
 461                 std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
 462                               _M_get_Tp_allocator());
 463                 _M_deallocate(this->_M_impl._M_start,
 464                               this->_M_impl._M_end_of_storage
 465                               - this->_M_impl._M_start);
 466                 this->_M_impl._M_start = __new_start;
 467                 this->_M_impl._M_finish = __new_finish;
 468                 this->_M_impl._M_end_of_storage = __new_start + __len;
 469               }
 470           }
 471       }
 472
 473
 474   // vector<bool>
 475
 476   template<typename _Alloc>
 477     void
 478     vector<bool, _Alloc>::
 479     _M_fill_insert(iterator __position, size_type __n, bool __x)
 480     {
 481       if (__n == 0)
 482         return;
 483       if (capacity() - size() >= __n)
 484         {
 485           std::copy_backward(__position, end(),
 486                              this->_M_impl._M_finish + difference_type(__n));
 487           std::fill(__position, __position + difference_type(__n), __x);
 488           this->_M_impl._M_finish += difference_type(__n);
 489         }
 490       else
 491         {
 492           const size_type __len =
 493             _M_check_len(__n, "vector<bool>::_M_fill_insert");
 494           _Bit_type * __q = this->_M_allocate(__len);
 495           iterator __i = _M_copy_aligned(begin(), __position,
 496                                          iterator(__q, 0));
 497           std::fill(__i, __i + difference_type(__n), __x);
 498           this->_M_impl._M_finish = std::copy(__position, end(),
 499                                               __i + difference_type(__n));
 500           this->_M_deallocate();
 501           this->_M_impl._M_end_of_storage = (__q + ((__len
 502                                                      + int(_S_word_bit) - 1)
 503                                                     / int(_S_word_bit)));
 504           this->_M_impl._M_start = iterator(__q, 0);
 505         }
 506     }
 507
 508   template<typename _Alloc>
 509     template<typename _ForwardIterator>
 510       void
 511       vector<bool, _Alloc>::
 512       _M_insert_range(iterator __position, _ForwardIterator __first,
 513                       _ForwardIterator __last, std::forward_iterator_tag)
 514       {
 515         if (__first != __last)
 516           {
 517             size_type __n = std::distance(__first, __last);
 518             if (capacity() - size() >= __n)
 519               {
 520                 std::copy_backward(__position, end(),
 521                                    this->_M_impl._M_finish
 522                                    + difference_type(__n));
 523                 std::copy(__first, __last, __position);
 524                 this->_M_impl._M_finish += difference_type(__n);
 525               }
 526             else
 527               {
 528                 const size_type __len =
 529                   _M_check_len(__n, "vector<bool>::_M_insert_range");
 530                 _Bit_type * __q = this->_M_allocate(__len);
 531                 iterator __i = _M_copy_aligned(begin(), __position,
 532                                                iterator(__q, 0));
 533                 __i = std::copy(__first, __last, __i);
 534                 this->_M_impl._M_finish = std::copy(__position, end(), __i);
 535                 this->_M_deallocate();
 536                 this->_M_impl._M_end_of_storage = (__q
 537                                                    + ((__len
 538                                                        + int(_S_word_bit) - 1)
 539                                                       / int(_S_word_bit)));
 540                 this->_M_impl._M_start = iterator(__q, 0);
 541               }
 542           }
 543       }
 544
 545   template<typename _Alloc>
 546     void
 547     vector<bool, _Alloc>::
 548     _M_insert_aux(iterator __position, bool __x)
 549     {
 550       if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_of_storage)
 551         {
 552           std::copy_backward(__position, this->_M_impl._M_finish,
 553                              this->_M_impl._M_finish + 1);
 554           *__position = __x;
 555           ++this->_M_impl._M_finish;
 556         }
 557       else
 558         {
 559           const size_type __len =
 560             _M_check_len(size_type(1), "vector<bool>::_M_insert_aux");
 561           _Bit_type * __q = this->_M_allocate(__len);
 562           iterator __i = _M_copy_aligned(begin(), __position,
 563                                          iterator(__q, 0));
 564           *__i++ = __x;
 565           this->_M_impl._M_finish = std::copy(__position, end(), __i);
 566           this->_M_deallocate();
 567           this->_M_impl._M_end_of_storage = (__q + ((__len
 568                                                      + int(_S_word_bit) - 1)
 569                                                     / int(_S_word_bit)));
 570           this->_M_impl._M_start = iterator(__q, 0);
 571         }
 572     }
 573
 574 _GLIBCXX_END_NESTED_NAMESPACE
 575
 576 #endif /* _VECTOR_TCC */