libstdc++
vector.tcc
Go to the documentation of this file.
1// Vector implementation (out of line) -*- C++ -*-
2
3// Copyright (C) 2001-2024 Free Software Foundation, Inc.
4//
5// This file is part of the GNU ISO C++ Library. This library is free
6// software; you can redistribute it and/or modify it under the
7// terms of the GNU General Public License as published by the
8// Free Software Foundation; either version 3, or (at your option)
9// any later version.
10
11// This library is distributed in the hope that it will be useful,
12// but WITHOUT ANY WARRANTY; without even the implied warranty of
13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14// GNU General Public License for more details.
15
16// Under Section 7 of GPL version 3, you are granted additional
17// permissions described in the GCC Runtime Library Exception, version
18// 3.1, as published by the Free Software Foundation.
19
20// You should have received a copy of the GNU General Public License and
21// a copy of the GCC Runtime Library Exception along with this program;
22// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23// <http://www.gnu.org/licenses/>.
24
25/*
26 *
27 * Copyright (c) 1994
28 * Hewlett-Packard Company
29 *
30 * Permission to use, copy, modify, distribute and sell this software
31 * and its documentation for any purpose is hereby granted without fee,
32 * provided that the above copyright notice appear in all copies and
33 * that both that copyright notice and this permission notice appear
34 * in supporting documentation. Hewlett-Packard Company makes no
35 * representations about the suitability of this software for any
36 * purpose. It is provided "as is" without express or implied warranty.
37 *
38 *
39 * Copyright (c) 1996
40 * Silicon Graphics Computer Systems, Inc.
41 *
42 * Permission to use, copy, modify, distribute and sell this software
43 * and its documentation for any purpose is hereby granted without fee,
44 * provided that the above copyright notice appear in all copies and
45 * that both that copyright notice and this permission notice appear
46 * in supporting documentation. Silicon Graphics makes no
47 * representations about the suitability of this software for any
48 * purpose. It is provided "as is" without express or implied warranty.
49 */
50
51/** @file bits/vector.tcc
52 * This is an internal header file, included by other library headers.
53 * Do not attempt to use it directly. @headername{vector}
54 */
55
56#ifndef _VECTOR_TCC
57#define _VECTOR_TCC 1
58
59namespace std _GLIBCXX_VISIBILITY(default)
60{
61_GLIBCXX_BEGIN_NAMESPACE_VERSION
62_GLIBCXX_BEGIN_NAMESPACE_CONTAINER
63
64 template<typename _Tp, typename _Alloc>
65 _GLIBCXX20_CONSTEXPR
66 void
68 reserve(size_type __n)
69 {
70 if (__n > this->max_size())
71 __throw_length_error(__N("vector::reserve"));
72 if (this->capacity() < __n)
73 {
74 const size_type __old_size = size();
75 pointer __tmp;
76#if __cplusplus >= 201103L
77 if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
78 {
79 __tmp = this->_M_allocate(__n);
80 _S_relocate(this->_M_impl._M_start, this->_M_impl._M_finish,
81 __tmp, _M_get_Tp_allocator());
82 }
83 else
84#endif
85 {
86 __tmp = _M_allocate_and_copy(__n,
87 _GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(this->_M_impl._M_start),
88 _GLIBCXX_MAKE_MOVE_IF_NOEXCEPT_ITERATOR(this->_M_impl._M_finish));
89 std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
90 _M_get_Tp_allocator());
91 }
92 _GLIBCXX_ASAN_ANNOTATE_REINIT;
93 _M_deallocate(this->_M_impl._M_start,
94 this->_M_impl._M_end_of_storage
95 - this->_M_impl._M_start);
96 this->_M_impl._M_start = __tmp;
97 this->_M_impl._M_finish = __tmp + __old_size;
98 this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __n;
99 }
100 }
101
102#if __cplusplus >= 201103L
103 template<typename _Tp, typename _Alloc>
104 template<typename... _Args>
105#if __cplusplus > 201402L
106 _GLIBCXX20_CONSTEXPR
107 typename vector<_Tp, _Alloc>::reference
108#else
109 void
110#endif
112 emplace_back(_Args&&... __args)
113 {
114 if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
115 {
116 _GLIBCXX_ASAN_ANNOTATE_GROW(1);
117 _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,
118 std::forward<_Args>(__args)...);
119 ++this->_M_impl._M_finish;
120 _GLIBCXX_ASAN_ANNOTATE_GREW(1);
121 }
122 else
123 _M_realloc_append(std::forward<_Args>(__args)...);
124#if __cplusplus > 201402L
125 return back();
126#endif
127 }
128#endif
129
130 template<typename _Tp, typename _Alloc>
131 _GLIBCXX20_CONSTEXPR
132 typename vector<_Tp, _Alloc>::iterator
134#if __cplusplus >= 201103L
135 insert(const_iterator __position, const value_type& __x)
136#else
137 insert(iterator __position, const value_type& __x)
138#endif
139 {
140 const size_type __n = __position - begin();
141 if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
142 {
143 __glibcxx_assert(__position != const_iterator());
144 if (!(__position != const_iterator()))
145 __builtin_unreachable(); // PR 106434
146
147 if (__position == end())
148 {
149 _GLIBCXX_ASAN_ANNOTATE_GROW(1);
150 _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,
151 __x);
152 ++this->_M_impl._M_finish;
153 _GLIBCXX_ASAN_ANNOTATE_GREW(1);
154 }
155 else
156 {
157#if __cplusplus >= 201103L
158 const auto __pos = begin() + (__position - cbegin());
159 // __x could be an existing element of this vector, so make a
160 // copy of it before _M_insert_aux moves elements around.
161 _Temporary_value __x_copy(this, __x);
162 _M_insert_aux(__pos, std::move(__x_copy._M_val()));
163#else
164 _M_insert_aux(__position, __x);
165#endif
166 }
167 }
168 else
169#if __cplusplus >= 201103L
170 _M_realloc_insert(begin() + (__position - cbegin()), __x);
171#else
172 _M_realloc_insert(__position, __x);
173#endif
174
175 return iterator(this->_M_impl._M_start + __n);
176 }
177
178 template<typename _Tp, typename _Alloc>
179 _GLIBCXX20_CONSTEXPR
180 typename vector<_Tp, _Alloc>::iterator
182 _M_erase(iterator __position)
183 {
184 if (__position + 1 != end())
185 _GLIBCXX_MOVE3(__position + 1, end(), __position);
186 --this->_M_impl._M_finish;
187 _Alloc_traits::destroy(this->_M_impl, this->_M_impl._M_finish);
188 _GLIBCXX_ASAN_ANNOTATE_SHRINK(1);
189 return __position;
190 }
191
192 template<typename _Tp, typename _Alloc>
193 _GLIBCXX20_CONSTEXPR
194 typename vector<_Tp, _Alloc>::iterator
195 vector<_Tp, _Alloc>::
196 _M_erase(iterator __first, iterator __last)
197 {
198 if (__first != __last)
199 {
200 if (__last != end())
201 _GLIBCXX_MOVE3(__last, end(), __first);
202 _M_erase_at_end(__first.base() + (end() - __last));
203 }
204 return __first;
205 }
206
207 template<typename _Tp, typename _Alloc>
208 _GLIBCXX20_CONSTEXPR
209 vector<_Tp, _Alloc>&
211 operator=(const vector<_Tp, _Alloc>& __x)
212 {
213 if (std::__addressof(__x) != this)
214 {
215 _GLIBCXX_ASAN_ANNOTATE_REINIT;
216#if __cplusplus >= 201103L
217 if (_Alloc_traits::_S_propagate_on_copy_assign())
218 {
219 if (!_Alloc_traits::_S_always_equal()
220 && _M_get_Tp_allocator() != __x._M_get_Tp_allocator())
221 {
222 // replacement allocator cannot free existing storage
223 this->clear();
224 _M_deallocate(this->_M_impl._M_start,
225 this->_M_impl._M_end_of_storage
226 - this->_M_impl._M_start);
227 this->_M_impl._M_start = nullptr;
228 this->_M_impl._M_finish = nullptr;
229 this->_M_impl._M_end_of_storage = nullptr;
230 }
231 std::__alloc_on_copy(_M_get_Tp_allocator(),
232 __x._M_get_Tp_allocator());
233 }
234#endif
235 const size_type __xlen = __x.size();
236 if (__xlen > capacity())
237 {
238 pointer __tmp = _M_allocate_and_copy(__xlen, __x.begin(),
239 __x.end());
240 std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
241 _M_get_Tp_allocator());
242 _M_deallocate(this->_M_impl._M_start,
243 this->_M_impl._M_end_of_storage
244 - this->_M_impl._M_start);
245 this->_M_impl._M_start = __tmp;
246 this->_M_impl._M_end_of_storage = this->_M_impl._M_start + __xlen;
247 }
248 else if (size() >= __xlen)
249 {
250 std::_Destroy(std::copy(__x.begin(), __x.end(), begin()),
251 end(), _M_get_Tp_allocator());
252 }
253 else
254 {
255 std::copy(__x._M_impl._M_start, __x._M_impl._M_start + size(),
256 this->_M_impl._M_start);
257 std::__uninitialized_copy_a(__x._M_impl._M_start + size(),
258 __x._M_impl._M_finish,
259 this->_M_impl._M_finish,
260 _M_get_Tp_allocator());
261 }
262 this->_M_impl._M_finish = this->_M_impl._M_start + __xlen;
263 }
264 return *this;
265 }
266
267 template<typename _Tp, typename _Alloc>
268 _GLIBCXX20_CONSTEXPR
269 void
270 vector<_Tp, _Alloc>::
271 _M_fill_assign(size_t __n, const value_type& __val)
272 {
273 const size_type __sz = size();
274 if (__n > capacity())
275 {
276 if (__n <= __sz)
277 __builtin_unreachable();
278 vector __tmp(__n, __val, _M_get_Tp_allocator());
279 __tmp._M_impl._M_swap_data(this->_M_impl);
280 }
281 else if (__n > __sz)
282 {
283 std::fill(begin(), end(), __val);
284 const size_type __add = __n - __sz;
285 _GLIBCXX_ASAN_ANNOTATE_GROW(__add);
286 this->_M_impl._M_finish =
287 std::__uninitialized_fill_n_a(this->_M_impl._M_finish,
288 __add, __val, _M_get_Tp_allocator());
289 _GLIBCXX_ASAN_ANNOTATE_GREW(__add);
290 }
291 else
292 _M_erase_at_end(std::fill_n(this->_M_impl._M_start, __n, __val));
293 }
294
295 template<typename _Tp, typename _Alloc>
296 template<typename _InputIterator>
297 _GLIBCXX20_CONSTEXPR
298 void
299 vector<_Tp, _Alloc>::
300 _M_assign_aux(_InputIterator __first, _InputIterator __last,
302 {
303 pointer __cur(this->_M_impl._M_start);
304 for (; __first != __last && __cur != this->_M_impl._M_finish;
305 ++__cur, (void)++__first)
306 *__cur = *__first;
307 if (__first == __last)
308 _M_erase_at_end(__cur);
309 else
310 _M_range_insert(end(), __first, __last,
311 std::__iterator_category(__first));
312 }
313
314 template<typename _Tp, typename _Alloc>
315 template<typename _ForwardIterator>
316 _GLIBCXX20_CONSTEXPR
317 void
318 vector<_Tp, _Alloc>::
319 _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
321 {
322 const size_type __sz = size();
323 const size_type __len = std::distance(__first, __last);
324
325 if (__len > capacity())
326 {
327 if (__len <= __sz)
328 __builtin_unreachable();
329
330 _S_check_init_len(__len, _M_get_Tp_allocator());
331 pointer __tmp(_M_allocate_and_copy(__len, __first, __last));
332 std::_Destroy(this->_M_impl._M_start, this->_M_impl._M_finish,
333 _M_get_Tp_allocator());
334 _GLIBCXX_ASAN_ANNOTATE_REINIT;
335 _M_deallocate(this->_M_impl._M_start,
336 this->_M_impl._M_end_of_storage
337 - this->_M_impl._M_start);
338 this->_M_impl._M_start = __tmp;
339 this->_M_impl._M_finish = this->_M_impl._M_start + __len;
340 this->_M_impl._M_end_of_storage = this->_M_impl._M_finish;
341 }
342 else if (__sz >= __len)
343 _M_erase_at_end(std::copy(__first, __last, this->_M_impl._M_start));
344 else
345 {
346 _ForwardIterator __mid = __first;
347 std::advance(__mid, __sz);
348 std::copy(__first, __mid, this->_M_impl._M_start);
349 const size_type __attribute__((__unused__)) __n = __len - __sz;
350 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
351 this->_M_impl._M_finish =
352 std::__uninitialized_copy_a(__mid, __last,
353 this->_M_impl._M_finish,
354 _M_get_Tp_allocator());
355 _GLIBCXX_ASAN_ANNOTATE_GREW(__n);
356 }
357 }
358
359#if __cplusplus >= 201103L
360 template<typename _Tp, typename _Alloc>
361 _GLIBCXX20_CONSTEXPR
362 auto
363 vector<_Tp, _Alloc>::
364 _M_insert_rval(const_iterator __position, value_type&& __v) -> iterator
365 {
366 const auto __n = __position - cbegin();
367 if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
368 if (__position == cend())
369 {
370 _GLIBCXX_ASAN_ANNOTATE_GROW(1);
371 _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,
372 std::move(__v));
373 ++this->_M_impl._M_finish;
374 _GLIBCXX_ASAN_ANNOTATE_GREW(1);
375 }
376 else
377 _M_insert_aux(begin() + __n, std::move(__v));
378 else
379 _M_realloc_insert(begin() + __n, std::move(__v));
380
381 return iterator(this->_M_impl._M_start + __n);
382 }
383
384 template<typename _Tp, typename _Alloc>
385 template<typename... _Args>
386 _GLIBCXX20_CONSTEXPR
387 auto
388 vector<_Tp, _Alloc>::
389 _M_emplace_aux(const_iterator __position, _Args&&... __args)
390 -> iterator
391 {
392 const auto __n = __position - cbegin();
393 if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
394 if (__position == cend())
395 {
396 _GLIBCXX_ASAN_ANNOTATE_GROW(1);
397 _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,
398 std::forward<_Args>(__args)...);
399 ++this->_M_impl._M_finish;
400 _GLIBCXX_ASAN_ANNOTATE_GREW(1);
401 }
402 else
403 {
404 // We need to construct a temporary because something in __args...
405 // could alias one of the elements of the container and so we
406 // need to use it before _M_insert_aux moves elements around.
407 _Temporary_value __tmp(this, std::forward<_Args>(__args)...);
408 _M_insert_aux(begin() + __n, std::move(__tmp._M_val()));
409 }
410 else
411 _M_realloc_insert(begin() + __n, std::forward<_Args>(__args)...);
412
413 return iterator(this->_M_impl._M_start + __n);
414 }
415
416 template<typename _Tp, typename _Alloc>
417 template<typename _Arg>
418 _GLIBCXX20_CONSTEXPR
419 void
420 vector<_Tp, _Alloc>::
421 _M_insert_aux(iterator __position, _Arg&& __arg)
422#else
423 template<typename _Tp, typename _Alloc>
424 void
425 vector<_Tp, _Alloc>::
426 _M_insert_aux(iterator __position, const _Tp& __x)
427#endif
428 {
429 _GLIBCXX_ASAN_ANNOTATE_GROW(1);
430 _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,
431 _GLIBCXX_MOVE(*(this->_M_impl._M_finish - 1)));
432 ++this->_M_impl._M_finish;
433 _GLIBCXX_ASAN_ANNOTATE_GREW(1);
434#if __cplusplus < 201103L
435 _Tp __x_copy = __x;
436#endif
437 _GLIBCXX_MOVE_BACKWARD3(__position.base(),
438 this->_M_impl._M_finish - 2,
439 this->_M_impl._M_finish - 1);
440#if __cplusplus < 201103L
441 *__position = __x_copy;
442#else
443 *__position = std::forward<_Arg>(__arg);
444#endif
445 }
446
447#if __cplusplus >= 201103L
448 template<typename _Tp, typename _Alloc>
449 template<typename... _Args>
450 _GLIBCXX20_CONSTEXPR
451 void
452 vector<_Tp, _Alloc>::
453 _M_realloc_insert(iterator __position, _Args&&... __args)
454#else
455 template<typename _Tp, typename _Alloc>
456 void
457 vector<_Tp, _Alloc>::
458 _M_realloc_insert(iterator __position, const _Tp& __x)
459#endif
460 {
461 const size_type __len = _M_check_len(1u, "vector::_M_realloc_insert");
462 if (__len <= 0)
463 __builtin_unreachable ();
464 pointer __old_start = this->_M_impl._M_start;
465 pointer __old_finish = this->_M_impl._M_finish;
466 const size_type __elems_before = __position - begin();
467 pointer __new_start(this->_M_allocate(__len));
468 pointer __new_finish(__new_start);
469
470 {
471 _Guard_alloc __guard(__new_start, __len, *this);
472
473 // The order of the three operations is dictated by the C++11
474 // case, where the moves could alter a new element belonging
475 // to the existing vector. This is an issue only for callers
476 // taking the element by lvalue ref (see last bullet of C++11
477 // [res.on.arguments]).
478
479 // If this throws, the existing elements are unchanged.
480#if __cplusplus >= 201103L
481 _Alloc_traits::construct(this->_M_impl,
482 std::__to_address(__new_start + __elems_before),
483 std::forward<_Args>(__args)...);
484#else
485 _Alloc_traits::construct(this->_M_impl,
486 __new_start + __elems_before,
487 __x);
488#endif
489
490#if __cplusplus >= 201103L
491 if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
492 {
493 // Relocation cannot throw.
494 __new_finish = _S_relocate(__old_start, __position.base(),
495 __new_start, _M_get_Tp_allocator());
496 ++__new_finish;
497 __new_finish = _S_relocate(__position.base(), __old_finish,
498 __new_finish, _M_get_Tp_allocator());
499 }
500 else
501#endif
502 {
503 // RAII type to destroy initialized elements.
504 struct _Guard_elts
505 {
506 pointer _M_first, _M_last; // Elements to destroy
507 _Tp_alloc_type& _M_alloc;
508
509 _GLIBCXX20_CONSTEXPR
510 _Guard_elts(pointer __elt, _Tp_alloc_type& __a)
511 : _M_first(__elt), _M_last(__elt + 1), _M_alloc(__a)
512 { }
513
514 _GLIBCXX20_CONSTEXPR
515 ~_Guard_elts()
516 { std::_Destroy(_M_first, _M_last, _M_alloc); }
517
518 private:
519 _Guard_elts(const _Guard_elts&);
520 };
521
522 // Guard the new element so it will be destroyed if anything throws.
523 _Guard_elts __guard_elts(__new_start + __elems_before, _M_impl);
524
525 __new_finish = std::__uninitialized_move_if_noexcept_a(
526 __old_start, __position.base(),
527 __new_start, _M_get_Tp_allocator());
528
529 ++__new_finish;
530 // Guard everything before the new element too.
531 __guard_elts._M_first = __new_start;
532
533 __new_finish = std::__uninitialized_move_if_noexcept_a(
534 __position.base(), __old_finish,
535 __new_finish, _M_get_Tp_allocator());
536
537 // New storage has been fully initialized, destroy the old elements.
538 __guard_elts._M_first = __old_start;
539 __guard_elts._M_last = __old_finish;
540 }
541 __guard._M_storage = __old_start;
542 __guard._M_len = this->_M_impl._M_end_of_storage - __old_start;
543 }
544 // deallocate should be called before assignments to _M_impl,
545 // to avoid call-clobbering
546
547 this->_M_impl._M_start = __new_start;
548 this->_M_impl._M_finish = __new_finish;
549 this->_M_impl._M_end_of_storage = __new_start + __len;
550 }
551
552#if __cplusplus >= 201103L
553 template<typename _Tp, typename _Alloc>
554 template<typename... _Args>
555 _GLIBCXX20_CONSTEXPR
556 void
557 vector<_Tp, _Alloc>::
558 _M_realloc_append(_Args&&... __args)
559#else
560 template<typename _Tp, typename _Alloc>
561 void
562 vector<_Tp, _Alloc>::
563 _M_realloc_append(const _Tp& __x)
564#endif
565 {
566 const size_type __len = _M_check_len(1u, "vector::_M_realloc_append");
567 if (__len <= 0)
568 __builtin_unreachable ();
569 pointer __old_start = this->_M_impl._M_start;
570 pointer __old_finish = this->_M_impl._M_finish;
571 const size_type __elems = end() - begin();
572 pointer __new_start(this->_M_allocate(__len));
573 pointer __new_finish(__new_start);
574
575 {
576 _Guard_alloc __guard(__new_start, __len, *this);
577
578 // The order of the three operations is dictated by the C++11
579 // case, where the moves could alter a new element belonging
580 // to the existing vector. This is an issue only for callers
581 // taking the element by lvalue ref (see last bullet of C++11
582 // [res.on.arguments]).
583
584 // If this throws, the existing elements are unchanged.
585#if __cplusplus >= 201103L
586 _Alloc_traits::construct(this->_M_impl,
587 std::__to_address(__new_start + __elems),
588 std::forward<_Args>(__args)...);
589#else
590 _Alloc_traits::construct(this->_M_impl,
591 __new_start + __elems,
592 __x);
593#endif
594
595#if __cplusplus >= 201103L
596 if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
597 {
598 // Relocation cannot throw.
599 __new_finish = _S_relocate(__old_start, __old_finish,
600 __new_start, _M_get_Tp_allocator());
601 ++__new_finish;
602 }
603 else
604#endif
605 {
606 // RAII type to destroy initialized elements.
607 struct _Guard_elts
608 {
609 pointer _M_first, _M_last; // Elements to destroy
610 _Tp_alloc_type& _M_alloc;
611
612 _GLIBCXX20_CONSTEXPR
613 _Guard_elts(pointer __elt, _Tp_alloc_type& __a)
614 : _M_first(__elt), _M_last(__elt + 1), _M_alloc(__a)
615 { }
616
617 _GLIBCXX20_CONSTEXPR
618 ~_Guard_elts()
619 { std::_Destroy(_M_first, _M_last, _M_alloc); }
620
621 private:
622 _Guard_elts(const _Guard_elts&);
623 };
624
625 // Guard the new element so it will be destroyed if anything throws.
626 _Guard_elts __guard_elts(__new_start + __elems, _M_impl);
627
628 __new_finish = std::__uninitialized_move_if_noexcept_a(
629 __old_start, __old_finish,
630 __new_start, _M_get_Tp_allocator());
631
632 ++__new_finish;
633
634 // New storage has been fully initialized, destroy the old elements.
635 __guard_elts._M_first = __old_start;
636 __guard_elts._M_last = __old_finish;
637 }
638 __guard._M_storage = __old_start;
639 __guard._M_len = this->_M_impl._M_end_of_storage - __old_start;
640 }
641 // deallocate should be called before assignments to _M_impl,
642 // to avoid call-clobbering
643
644 this->_M_impl._M_start = __new_start;
645 this->_M_impl._M_finish = __new_finish;
646 this->_M_impl._M_end_of_storage = __new_start + __len;
647 }
648
649 template<typename _Tp, typename _Alloc>
650 _GLIBCXX20_CONSTEXPR
651 void
652 vector<_Tp, _Alloc>::
653 _M_fill_insert(iterator __position, size_type __n, const value_type& __x)
654 {
655 if (__n != 0)
656 {
657 if (size_type(this->_M_impl._M_end_of_storage
658 - this->_M_impl._M_finish) >= __n)
659 {
660#if __cplusplus < 201103L
661 value_type __x_copy = __x;
662#else
663 _Temporary_value __tmp(this, __x);
664 value_type& __x_copy = __tmp._M_val();
665#endif
666 const size_type __elems_after = end() - __position;
667 pointer __old_finish(this->_M_impl._M_finish);
668 if (__elems_after > __n)
669 {
670 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
671 std::__uninitialized_move_a(__old_finish - __n,
672 __old_finish,
673 __old_finish,
674 _M_get_Tp_allocator());
675 this->_M_impl._M_finish += __n;
676 _GLIBCXX_ASAN_ANNOTATE_GREW(__n);
677 _GLIBCXX_MOVE_BACKWARD3(__position.base(),
678 __old_finish - __n, __old_finish);
679 std::fill(__position.base(), __position.base() + __n,
680 __x_copy);
681 }
682 else
683 {
684 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
685 this->_M_impl._M_finish =
686 std::__uninitialized_fill_n_a(__old_finish,
687 __n - __elems_after,
688 __x_copy,
689 _M_get_Tp_allocator());
690 _GLIBCXX_ASAN_ANNOTATE_GREW(__n - __elems_after);
691 std::__uninitialized_move_a(__position.base(), __old_finish,
692 this->_M_impl._M_finish,
693 _M_get_Tp_allocator());
694 this->_M_impl._M_finish += __elems_after;
695 _GLIBCXX_ASAN_ANNOTATE_GREW(__elems_after);
696 std::fill(__position.base(), __old_finish, __x_copy);
697 }
698 }
699 else
700 {
701 // Make local copies of these members because the compiler thinks
702 // the allocator can alter them if 'this' is globally reachable.
703 pointer __old_start = this->_M_impl._M_start;
704 pointer __old_finish = this->_M_impl._M_finish;
705 const pointer __pos = __position.base();
706
707 const size_type __len =
708 _M_check_len(__n, "vector::_M_fill_insert");
709 const size_type __elems_before = __pos - __old_start;
710 pointer __new_start(this->_M_allocate(__len));
711 pointer __new_finish(__new_start);
712 __try
713 {
714 // See _M_realloc_insert above.
715 std::__uninitialized_fill_n_a(__new_start + __elems_before,
716 __n, __x,
717 _M_get_Tp_allocator());
718 __new_finish = pointer();
719
720 __new_finish
721 = std::__uninitialized_move_if_noexcept_a
722 (__old_start, __pos, __new_start, _M_get_Tp_allocator());
723
724 __new_finish += __n;
725
726 __new_finish
727 = std::__uninitialized_move_if_noexcept_a
728 (__pos, __old_finish, __new_finish, _M_get_Tp_allocator());
729 }
730 __catch(...)
731 {
732 if (!__new_finish)
733 std::_Destroy(__new_start + __elems_before,
734 __new_start + __elems_before + __n,
735 _M_get_Tp_allocator());
736 else
737 std::_Destroy(__new_start, __new_finish,
738 _M_get_Tp_allocator());
739 _M_deallocate(__new_start, __len);
740 __throw_exception_again;
741 }
742 std::_Destroy(__old_start, __old_finish, _M_get_Tp_allocator());
743 _GLIBCXX_ASAN_ANNOTATE_REINIT;
744 _M_deallocate(__old_start,
745 this->_M_impl._M_end_of_storage - __old_start);
746 this->_M_impl._M_start = __new_start;
747 this->_M_impl._M_finish = __new_finish;
748 this->_M_impl._M_end_of_storage = __new_start + __len;
749 }
750 }
751 }
752
753#if __cplusplus >= 201103L
754 template<typename _Tp, typename _Alloc>
755 _GLIBCXX20_CONSTEXPR
756 void
757 vector<_Tp, _Alloc>::
758 _M_default_append(size_type __n)
759 {
760 if (__n != 0)
761 {
762 const size_type __size = size();
763 size_type __navail = size_type(this->_M_impl._M_end_of_storage
764 - this->_M_impl._M_finish);
765
766 if (__size > max_size() || __navail > max_size() - __size)
767 __builtin_unreachable();
768
769 if (__navail >= __n)
770 {
771 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
772 this->_M_impl._M_finish =
773 std::__uninitialized_default_n_a(this->_M_impl._M_finish,
774 __n, _M_get_Tp_allocator());
775 _GLIBCXX_ASAN_ANNOTATE_GREW(__n);
776 }
777 else
778 {
779 // Make local copies of these members because the compiler thinks
780 // the allocator can alter them if 'this' is globally reachable.
781 pointer __old_start = this->_M_impl._M_start;
782 pointer __old_finish = this->_M_impl._M_finish;
783
784 const size_type __len =
785 _M_check_len(__n, "vector::_M_default_append");
786 pointer __new_start(this->_M_allocate(__len));
787
788 {
789 _Guard_alloc __guard(__new_start, __len, *this);
790
791 std::__uninitialized_default_n_a(__new_start + __size, __n,
792 _M_get_Tp_allocator());
793
794 if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
795 {
796 _S_relocate(__old_start, __old_finish,
797 __new_start, _M_get_Tp_allocator());
798 }
799 else
800 {
801 // RAII type to destroy initialized elements.
802 struct _Guard_elts
803 {
804 pointer _M_first, _M_last; // Elements to destroy
805 _Tp_alloc_type& _M_alloc;
806
807 _GLIBCXX20_CONSTEXPR
808 _Guard_elts(pointer __first, size_type __n,
809 _Tp_alloc_type& __a)
810 : _M_first(__first), _M_last(__first + __n), _M_alloc(__a)
811 { }
812
813 _GLIBCXX20_CONSTEXPR
814 ~_Guard_elts()
815 { std::_Destroy(_M_first, _M_last, _M_alloc); }
816
817 private:
818 _Guard_elts(const _Guard_elts&);
819 };
820 _Guard_elts __guard_elts(__new_start + __size, __n, _M_impl);
821
822 std::__uninitialized_move_if_noexcept_a(
823 __old_start, __old_finish, __new_start,
824 _M_get_Tp_allocator());
825
826 __guard_elts._M_first = __old_start;
827 __guard_elts._M_last = __old_finish;
828 }
829 _GLIBCXX_ASAN_ANNOTATE_REINIT;
830 __guard._M_storage = __old_start;
831 __guard._M_len = this->_M_impl._M_end_of_storage - __old_start;
832 }
833 // deallocate should be called before assignments to _M_impl,
834 // to avoid call-clobbering
835
836 this->_M_impl._M_start = __new_start;
837 this->_M_impl._M_finish = __new_start + __size + __n;
838 this->_M_impl._M_end_of_storage = __new_start + __len;
839 }
840 }
841 }
842
843 template<typename _Tp, typename _Alloc>
844 _GLIBCXX20_CONSTEXPR
845 bool
846 vector<_Tp, _Alloc>::
847 _M_shrink_to_fit()
848 {
849 if (capacity() == size())
850 return false;
851 _GLIBCXX_ASAN_ANNOTATE_REINIT;
852 return std::__shrink_to_fit_aux<vector>::_S_do_it(*this);
853 }
854#endif
855
856 template<typename _Tp, typename _Alloc>
857 template<typename _InputIterator>
858 _GLIBCXX20_CONSTEXPR
859 void
860 vector<_Tp, _Alloc>::
861 _M_range_insert(iterator __pos, _InputIterator __first,
862 _InputIterator __last, std::input_iterator_tag)
863 {
864 if (__pos == end())
865 {
866 for (; __first != __last; ++__first)
867 insert(end(), *__first);
868 }
869 else if (__first != __last)
870 {
871 vector __tmp(__first, __last, _M_get_Tp_allocator());
872 insert(__pos,
873 _GLIBCXX_MAKE_MOVE_ITERATOR(__tmp.begin()),
874 _GLIBCXX_MAKE_MOVE_ITERATOR(__tmp.end()));
875 }
876 }
877
878 template<typename _Tp, typename _Alloc>
879 template<typename _ForwardIterator>
880 _GLIBCXX20_CONSTEXPR
881 void
882 vector<_Tp, _Alloc>::
883 _M_range_insert(iterator __position, _ForwardIterator __first,
884 _ForwardIterator __last, std::forward_iterator_tag)
885 {
886 if (__first != __last)
887 {
888 const size_type __n = std::distance(__first, __last);
889 if (size_type(this->_M_impl._M_end_of_storage
890 - this->_M_impl._M_finish) >= __n)
891 {
892 const size_type __elems_after = end() - __position;
893 pointer __old_finish(this->_M_impl._M_finish);
894 if (__elems_after > __n)
895 {
896 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
897 std::__uninitialized_move_a(this->_M_impl._M_finish - __n,
898 this->_M_impl._M_finish,
899 this->_M_impl._M_finish,
900 _M_get_Tp_allocator());
901 this->_M_impl._M_finish += __n;
902 _GLIBCXX_ASAN_ANNOTATE_GREW(__n);
903 _GLIBCXX_MOVE_BACKWARD3(__position.base(),
904 __old_finish - __n, __old_finish);
905 std::copy(__first, __last, __position);
906 }
907 else
908 {
909 _ForwardIterator __mid = __first;
910 std::advance(__mid, __elems_after);
911 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
912 std::__uninitialized_copy_a(__mid, __last,
913 this->_M_impl._M_finish,
914 _M_get_Tp_allocator());
915 this->_M_impl._M_finish += __n - __elems_after;
916 _GLIBCXX_ASAN_ANNOTATE_GREW(__n - __elems_after);
917 std::__uninitialized_move_a(__position.base(),
918 __old_finish,
919 this->_M_impl._M_finish,
920 _M_get_Tp_allocator());
921 this->_M_impl._M_finish += __elems_after;
922 _GLIBCXX_ASAN_ANNOTATE_GREW(__elems_after);
923 std::copy(__first, __mid, __position);
924 }
925 }
926 else
927 {
928 // Make local copies of these members because the compiler
929 // thinks the allocator can alter them if 'this' is globally
930 // reachable.
931 pointer __old_start = this->_M_impl._M_start;
932 pointer __old_finish = this->_M_impl._M_finish;
933
934 const size_type __len =
935 _M_check_len(__n, "vector::_M_range_insert");
936#if __cplusplus < 201103LL
937 if (__len < (__n + (__old_start - __old_finish)))
938 __builtin_unreachable();
939#endif
940
941 pointer __new_start(this->_M_allocate(__len));
942 pointer __new_finish(__new_start);
943 __try
944 {
945 __new_finish
946 = std::__uninitialized_move_if_noexcept_a
947 (__old_start, __position.base(),
948 __new_start, _M_get_Tp_allocator());
949 __new_finish
950 = std::__uninitialized_copy_a(__first, __last,
951 __new_finish,
952 _M_get_Tp_allocator());
953 __new_finish
954 = std::__uninitialized_move_if_noexcept_a
955 (__position.base(), __old_finish,
956 __new_finish, _M_get_Tp_allocator());
957 }
958 __catch(...)
959 {
960 std::_Destroy(__new_start, __new_finish,
961 _M_get_Tp_allocator());
962 _M_deallocate(__new_start, __len);
963 __throw_exception_again;
964 }
965 std::_Destroy(__old_start, __old_finish,
966 _M_get_Tp_allocator());
967 _GLIBCXX_ASAN_ANNOTATE_REINIT;
968 _M_deallocate(__old_start,
969 this->_M_impl._M_end_of_storage - __old_start);
970 this->_M_impl._M_start = __new_start;
971 this->_M_impl._M_finish = __new_finish;
972 this->_M_impl._M_end_of_storage = __new_start + __len;
973 }
974 }
975 }
976
977
978 // vector<bool>
979 template<typename _Alloc>
980 _GLIBCXX20_CONSTEXPR
981 void
982 vector<bool, _Alloc>::
983 _M_reallocate(size_type __n)
984 {
985 _Bit_pointer __q = this->_M_allocate(__n);
986 iterator __start(std::__addressof(*__q), 0);
987 iterator __finish(_M_copy_aligned(begin(), end(), __start));
988 this->_M_deallocate();
989 this->_M_impl._M_start = __start;
990 this->_M_impl._M_finish = __finish;
991 this->_M_impl._M_end_of_storage = __q + _S_nword(__n);
992 }
993
994 template<typename _Alloc>
995 _GLIBCXX20_CONSTEXPR
996 void
997 vector<bool, _Alloc>::
998 _M_fill_insert(iterator __position, size_type __n, bool __x)
999 {
1000 if (__n == 0)
1001 return;
1002 if (capacity() - size() >= __n)
1003 {
1004 std::copy_backward(__position, end(),
1005 this->_M_impl._M_finish + difference_type(__n));
1006 std::fill(__position, __position + difference_type(__n), __x);
1007 this->_M_impl._M_finish += difference_type(__n);
1008 }
1009 else
1010 {
1011 const size_type __len =
1012 _M_check_len(__n, "vector<bool>::_M_fill_insert");
1013 _Bit_pointer __q = this->_M_allocate(__len);
1014 iterator __start(std::__addressof(*__q), 0);
1015 iterator __i = _M_copy_aligned(begin(), __position, __start);
1016 std::fill(__i, __i + difference_type(__n), __x);
1017 iterator __finish = std::copy(__position, end(),
1018 __i + difference_type(__n));
1019 this->_M_deallocate();
1020 this->_M_impl._M_end_of_storage = __q + _S_nword(__len);
1021 this->_M_impl._M_start = __start;
1022 this->_M_impl._M_finish = __finish;
1023 }
1024 }
1025
1026 template<typename _Alloc>
1027 template<typename _ForwardIterator>
1028 _GLIBCXX20_CONSTEXPR
1029 void
1030 vector<bool, _Alloc>::
1031 _M_insert_range(iterator __position, _ForwardIterator __first,
1032 _ForwardIterator __last, std::forward_iterator_tag)
1033 {
1034 if (__first != __last)
1035 {
1036 size_type __n = std::distance(__first, __last);
1037 if (capacity() - size() >= __n)
1038 {
1039 std::copy_backward(__position, end(),
1040 this->_M_impl._M_finish
1041 + difference_type(__n));
1042 std::copy(__first, __last, __position);
1043 this->_M_impl._M_finish += difference_type(__n);
1044 }
1045 else
1046 {
1047 const size_type __len =
1048 _M_check_len(__n, "vector<bool>::_M_insert_range");
1049 const iterator __begin = begin(), __end = end();
1050 _Bit_pointer __q = this->_M_allocate(__len);
1051 iterator __start(std::__addressof(*__q), 0);
1052 iterator __i = _M_copy_aligned(__begin, __position, __start);
1053 __i = std::copy(__first, __last, __i);
1054 iterator __finish = std::copy(__position, __end, __i);
1055 this->_M_deallocate();
1056 this->_M_impl._M_end_of_storage = __q + _S_nword(__len);
1057 this->_M_impl._M_start = __start;
1058 this->_M_impl._M_finish = __finish;
1059 }
1060 }
1061 }
1062
1063 template<typename _Alloc>
1064 _GLIBCXX20_CONSTEXPR
1065 void
1066 vector<bool, _Alloc>::
1067 _M_insert_aux(iterator __position, bool __x)
1068 {
1069 if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_addr())
1070 {
1071 std::copy_backward(__position, this->_M_impl._M_finish,
1072 this->_M_impl._M_finish + 1);
1073 *__position = __x;
1074 ++this->_M_impl._M_finish;
1075 }
1076 else
1077 {
1078 const size_type __len =
1079 _M_check_len(size_type(1), "vector<bool>::_M_insert_aux");
1080 _Bit_pointer __q = this->_M_allocate(__len);
1081 iterator __start(std::__addressof(*__q), 0);
1082 iterator __i = _M_copy_aligned(begin(), __position, __start);
1083 *__i++ = __x;
1084 iterator __finish = std::copy(__position, end(), __i);
1085 this->_M_deallocate();
1086 this->_M_impl._M_end_of_storage = __q + _S_nword(__len);
1087 this->_M_impl._M_start = __start;
1088 this->_M_impl._M_finish = __finish;
1089 }
1090 }
1091
1092 template<typename _Alloc>
1093 _GLIBCXX20_CONSTEXPR
1094 typename vector<bool, _Alloc>::iterator
1095 vector<bool, _Alloc>::
1096 _M_erase(iterator __position)
1097 {
1098 if (__position + 1 != end())
1099 std::copy(__position + 1, end(), __position);
1100 --this->_M_impl._M_finish;
1101 return __position;
1102 }
1103
1104 template<typename _Alloc>
1105 _GLIBCXX20_CONSTEXPR
1106 typename vector<bool, _Alloc>::iterator
1107 vector<bool, _Alloc>::
1108 _M_erase(iterator __first, iterator __last)
1109 {
1110 if (__first != __last)
1111 _M_erase_at_end(std::copy(__last, end(), __first));
1112 return __first;
1113 }
1114
1115#if __cplusplus >= 201103L
1116 template<typename _Alloc>
1117 _GLIBCXX20_CONSTEXPR
1118 bool
1121 {
1122 if (capacity() - size() < int(_S_word_bit))
1123 return false;
1124 __try
1125 {
1126 if (size_type __n = size())
1127 _M_reallocate(__n);
1128 else
1129 {
1130 this->_M_deallocate();
1131 this->_M_impl._M_reset();
1132 }
1133 return true;
1134 }
1135 __catch(...)
1136 { return false; }
1137 }
1138#endif
1139
1140_GLIBCXX_END_NAMESPACE_CONTAINER
1141_GLIBCXX_END_NAMESPACE_VERSION
1142} // namespace std
1143
1144#if __cplusplus >= 201103L
1145
1146namespace std _GLIBCXX_VISIBILITY(default)
1147{
1148_GLIBCXX_BEGIN_NAMESPACE_VERSION
1149
1150 template<typename _Alloc>
1151 size_t
1152 hash<_GLIBCXX_STD_C::vector<bool, _Alloc>>::
1153 operator()(const _GLIBCXX_STD_C::vector<bool, _Alloc>& __b) const noexcept
1154 {
1155 size_t __hash = 0;
1156 const size_t __words = __b.size() / _S_word_bit;
1157 if (__words)
1158 {
1159 const size_t __clength = __words * sizeof(_Bit_type);
1160 __hash = std::_Hash_impl::hash(__b._M_impl._M_start._M_p, __clength);
1161 }
1162
1163 const size_t __extrabits = __b.size() % _S_word_bit;
1164 if (__extrabits)
1165 {
1166 _Bit_type __hiword = *__b._M_impl._M_finish._M_p;
1167 __hiword &= ~((~static_cast<_Bit_type>(0)) << __extrabits);
1168
1169 const size_t __clength
1170 = (__extrabits + __CHAR_BIT__ - 1) / __CHAR_BIT__;
1171 if (__words)
1172 __hash = std::_Hash_impl::hash(&__hiword, __clength, __hash);
1173 else
1174 __hash = std::_Hash_impl::hash(&__hiword, __clength);
1175 }
1176
1177 return __hash;
1178 }
1179
1180_GLIBCXX_END_NAMESPACE_VERSION
1181} // namespace std
1182
1183#endif // C++11
1184
1185#undef _GLIBCXX_ASAN_ANNOTATE_REINIT
1186#undef _GLIBCXX_ASAN_ANNOTATE_GROW
1187#undef _GLIBCXX_ASAN_ANNOTATE_GREW
1188#undef _GLIBCXX_ASAN_ANNOTATE_SHRINK
1189
1190#endif /* _VECTOR_TCC */
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
Definition move.h:127
constexpr _Tp * __addressof(_Tp &__r) noexcept
Same as C++11 std::addressof.
Definition move.h:51
_Tp * end(valarray< _Tp > &__va) noexcept
Return an iterator pointing to one past the last element of the valarray.
Definition valarray:1249
_Tp * begin(valarray< _Tp > &__va) noexcept
Return an iterator pointing to the first element of the valarray.
Definition valarray:1227
constexpr iterator_traits< _Iter >::iterator_category __iterator_category(const _Iter &)
ISO C++ entities toplevel namespace is std.
constexpr iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)
A generalization of pointer arithmetic.
constexpr auto cend(const _Container &__cont) noexcept(noexcept(std::end(__cont))) -> decltype(std::end(__cont))
Return an iterator pointing to one past the last element of the const container.
constexpr auto size(const _Container &__cont) noexcept(noexcept(__cont.size())) -> decltype(__cont.size())
Return the size of a container.
constexpr void advance(_InputIterator &__i, _Distance __n)
A generalization of pointer arithmetic.
constexpr auto cbegin(const _Container &__cont) noexcept(noexcept(std::begin(__cont))) -> decltype(std::begin(__cont))
Return an iterator pointing to the first element of the const container.
constexpr void _Destroy(_ForwardIterator __first, _ForwardIterator __last)
Marking input iterators.
Forward iterators support a superset of input iterator operations.
Common iterator class.
A standard container which offers fixed time access to individual elements in any order.
Definition stl_vector.h:429
constexpr vector & operator=(const vector &__x)
Vector assignment operator.
constexpr void reserve(size_type __n)
Attempt to preallocate enough memory for specified number of elements.
Definition vector.tcc:68