59namespace std _GLIBCXX_VISIBILITY(default)
61_GLIBCXX_BEGIN_NAMESPACE_VERSION
62_GLIBCXX_BEGIN_NAMESPACE_CONTAINER
64 template<
typename _Tp,
typename _Alloc>
70 if (__n > this->max_size())
71 __throw_length_error(__N(
"vector::reserve"));
72 if (this->capacity() < __n)
74 const size_type __old_size =
size();
76#if __cplusplus >= 201103L
77 if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
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());
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());
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;
102#if __cplusplus >= 201103L
103 template<
typename _Tp,
typename _Alloc>
104 template<
typename... _Args>
105#if __cplusplus > 201402L
107 typename vector<_Tp, _Alloc>::reference
114 if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
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);
123 _M_realloc_append(std::forward<_Args>(__args)...);
124#if __cplusplus > 201402L
130 template<
typename _Tp,
typename _Alloc>
132 typename vector<_Tp, _Alloc>::iterator
134#if __cplusplus >= 201103L
135 insert(const_iterator __position,
const value_type& __x)
137 insert(iterator __position,
const value_type& __x)
140 const size_type __n = __position -
begin();
141 if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
143 __glibcxx_assert(__position != const_iterator());
144 if (!(__position != const_iterator()))
145 __builtin_unreachable();
147 if (__position ==
end())
149 _GLIBCXX_ASAN_ANNOTATE_GROW(1);
150 _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,
152 ++this->_M_impl._M_finish;
153 _GLIBCXX_ASAN_ANNOTATE_GREW(1);
157#if __cplusplus >= 201103L
158 const auto __pos =
begin() + (__position -
cbegin());
161 _Temporary_value __x_copy(
this, __x);
162 _M_insert_aux(__pos,
std::move(__x_copy._M_val()));
164 _M_insert_aux(__position, __x);
169#if __cplusplus >= 201103L
170 _M_realloc_insert(
begin() + (__position -
cbegin()), __x);
172 _M_realloc_insert(__position, __x);
175 return iterator(this->_M_impl._M_start + __n);
178 template<
typename _Tp,
typename _Alloc>
180 typename vector<_Tp, _Alloc>::iterator
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);
192 template<
typename _Tp,
typename _Alloc>
194 typename vector<_Tp, _Alloc>::iterator
195 vector<_Tp, _Alloc>::
196 _M_erase(iterator __first, iterator __last)
198 if (__first != __last)
201 _GLIBCXX_MOVE3(__last,
end(), __first);
202 _M_erase_at_end(__first.base() + (
end() - __last));
207 template<
typename _Tp,
typename _Alloc>
211 operator=(
const vector<_Tp, _Alloc>& __x)
215 _GLIBCXX_ASAN_ANNOTATE_REINIT;
216#if __cplusplus >= 201103L
217 if (_Alloc_traits::_S_propagate_on_copy_assign())
219 if (!_Alloc_traits::_S_always_equal()
220 && _M_get_Tp_allocator() != __x._M_get_Tp_allocator())
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;
231 std::__alloc_on_copy(_M_get_Tp_allocator(),
232 __x._M_get_Tp_allocator());
235 const size_type __xlen = __x.size();
236 if (__xlen > capacity())
238 pointer __tmp = _M_allocate_and_copy(__xlen, __x.begin(),
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;
248 else if (
size() >= __xlen)
251 end(), _M_get_Tp_allocator());
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());
262 this->_M_impl._M_finish = this->_M_impl._M_start + __xlen;
267 template<
typename _Tp,
typename _Alloc>
270 vector<_Tp, _Alloc>::
271 _M_fill_assign(
size_t __n,
const value_type& __val)
273 const size_type __sz =
size();
274 if (__n > capacity())
277 __builtin_unreachable();
278 vector __tmp(__n, __val, _M_get_Tp_allocator());
279 __tmp._M_impl._M_swap_data(this->_M_impl);
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);
292 _M_erase_at_end(std::fill_n(this->_M_impl._M_start, __n, __val));
295 template<
typename _Tp,
typename _Alloc>
296 template<
typename _InputIterator>
299 vector<_Tp, _Alloc>::
300 _M_assign_aux(_InputIterator __first, _InputIterator __last,
303 pointer __cur(this->_M_impl._M_start);
304 for (; __first != __last && __cur != this->_M_impl._M_finish;
305 ++__cur, (void)++__first)
307 if (__first == __last)
308 _M_erase_at_end(__cur);
310 _M_range_insert(
end(), __first, __last,
314 template<
typename _Tp,
typename _Alloc>
315 template<
typename _ForwardIterator>
318 vector<_Tp, _Alloc>::
319 _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
322 const size_type __sz =
size();
325 if (__len > capacity())
328 __builtin_unreachable();
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;
342 else if (__sz >= __len)
343 _M_erase_at_end(std::copy(__first, __last, this->_M_impl._M_start));
346 _ForwardIterator __mid = __first;
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);
359#if __cplusplus >= 201103L
360 template<
typename _Tp,
typename _Alloc>
363 vector<_Tp, _Alloc>::
364 _M_insert_rval(const_iterator __position, value_type&& __v) -> iterator
366 const auto __n = __position -
cbegin();
367 if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
368 if (__position ==
cend())
370 _GLIBCXX_ASAN_ANNOTATE_GROW(1);
371 _Alloc_traits::construct(this->_M_impl, this->_M_impl._M_finish,
373 ++this->_M_impl._M_finish;
374 _GLIBCXX_ASAN_ANNOTATE_GREW(1);
381 return iterator(this->_M_impl._M_start + __n);
384 template<
typename _Tp,
typename _Alloc>
385 template<
typename... _Args>
388 vector<_Tp, _Alloc>::
389 _M_emplace_aux(const_iterator __position, _Args&&... __args)
392 const auto __n = __position -
cbegin();
393 if (this->_M_impl._M_finish != this->_M_impl._M_end_of_storage)
394 if (__position ==
cend())
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);
407 _Temporary_value __tmp(
this, std::forward<_Args>(__args)...);
411 _M_realloc_insert(
begin() + __n, std::forward<_Args>(__args)...);
413 return iterator(this->_M_impl._M_start + __n);
416 template<
typename _Tp,
typename _Alloc>
417 template<
typename _Arg>
420 vector<_Tp, _Alloc>::
421 _M_insert_aux(iterator __position, _Arg&& __arg)
423 template<
typename _Tp,
typename _Alloc>
425 vector<_Tp, _Alloc>::
426 _M_insert_aux(iterator __position,
const _Tp& __x)
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
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;
443 *__position = std::forward<_Arg>(__arg);
447#if __cplusplus >= 201103L
448 template<
typename _Tp,
typename _Alloc>
449 template<
typename... _Args>
452 vector<_Tp, _Alloc>::
453 _M_realloc_insert(iterator __position, _Args&&... __args)
455 template<
typename _Tp,
typename _Alloc>
457 vector<_Tp, _Alloc>::
458 _M_realloc_insert(iterator __position,
const _Tp& __x)
461 const size_type __len = _M_check_len(1u,
"vector::_M_realloc_insert");
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);
471 _Guard_alloc __guard(__new_start, __len, *
this);
480#if __cplusplus >= 201103L
481 _Alloc_traits::construct(this->_M_impl,
482 std::__to_address(__new_start + __elems_before),
483 std::forward<_Args>(__args)...);
485 _Alloc_traits::construct(this->_M_impl,
486 __new_start + __elems_before,
490#if __cplusplus >= 201103L
491 if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
494 __new_finish = _S_relocate(__old_start, __position.base(),
495 __new_start, _M_get_Tp_allocator());
497 __new_finish = _S_relocate(__position.base(), __old_finish,
498 __new_finish, _M_get_Tp_allocator());
506 pointer _M_first, _M_last;
507 _Tp_alloc_type& _M_alloc;
510 _Guard_elts(pointer __elt, _Tp_alloc_type& __a)
511 : _M_first(__elt), _M_last(__elt + 1), _M_alloc(__a)
519 _Guard_elts(
const _Guard_elts&);
523 _Guard_elts __guard_elts(__new_start + __elems_before, _M_impl);
525 __new_finish = std::__uninitialized_move_if_noexcept_a(
526 __old_start, __position.base(),
527 __new_start, _M_get_Tp_allocator());
531 __guard_elts._M_first = __new_start;
533 __new_finish = std::__uninitialized_move_if_noexcept_a(
534 __position.base(), __old_finish,
535 __new_finish, _M_get_Tp_allocator());
538 __guard_elts._M_first = __old_start;
539 __guard_elts._M_last = __old_finish;
541 __guard._M_storage = __old_start;
542 __guard._M_len = this->_M_impl._M_end_of_storage - __old_start;
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;
552#if __cplusplus >= 201103L
553 template<
typename _Tp,
typename _Alloc>
554 template<
typename... _Args>
557 vector<_Tp, _Alloc>::
558 _M_realloc_append(_Args&&... __args)
560 template<
typename _Tp,
typename _Alloc>
562 vector<_Tp, _Alloc>::
563 _M_realloc_append(
const _Tp& __x)
566 const size_type __len = _M_check_len(1u,
"vector::_M_realloc_append");
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);
576 _Guard_alloc __guard(__new_start, __len, *
this);
585#if __cplusplus >= 201103L
586 _Alloc_traits::construct(this->_M_impl,
587 std::__to_address(__new_start + __elems),
588 std::forward<_Args>(__args)...);
590 _Alloc_traits::construct(this->_M_impl,
591 __new_start + __elems,
595#if __cplusplus >= 201103L
596 if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
599 __new_finish = _S_relocate(__old_start, __old_finish,
600 __new_start, _M_get_Tp_allocator());
609 pointer _M_first, _M_last;
610 _Tp_alloc_type& _M_alloc;
613 _Guard_elts(pointer __elt, _Tp_alloc_type& __a)
614 : _M_first(__elt), _M_last(__elt + 1), _M_alloc(__a)
622 _Guard_elts(
const _Guard_elts&);
626 _Guard_elts __guard_elts(__new_start + __elems, _M_impl);
628 __new_finish = std::__uninitialized_move_if_noexcept_a(
629 __old_start, __old_finish,
630 __new_start, _M_get_Tp_allocator());
635 __guard_elts._M_first = __old_start;
636 __guard_elts._M_last = __old_finish;
638 __guard._M_storage = __old_start;
639 __guard._M_len = this->_M_impl._M_end_of_storage - __old_start;
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;
649 template<
typename _Tp,
typename _Alloc>
652 vector<_Tp, _Alloc>::
653 _M_fill_insert(iterator __position, size_type __n,
const value_type& __x)
657 if (size_type(this->_M_impl._M_end_of_storage
658 - this->_M_impl._M_finish) >= __n)
660#if __cplusplus < 201103L
661 value_type __x_copy = __x;
663 _Temporary_value __tmp(
this, __x);
664 value_type& __x_copy = __tmp._M_val();
666 const size_type __elems_after =
end() - __position;
667 pointer __old_finish(this->_M_impl._M_finish);
668 if (__elems_after > __n)
670 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
671 std::__uninitialized_move_a(__old_finish - __n,
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,
684 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
685 this->_M_impl._M_finish =
686 std::__uninitialized_fill_n_a(__old_finish,
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);
703 pointer __old_start = this->_M_impl._M_start;
704 pointer __old_finish = this->_M_impl._M_finish;
705 const pointer __pos = __position.base();
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);
715 std::__uninitialized_fill_n_a(__new_start + __elems_before,
717 _M_get_Tp_allocator());
718 __new_finish = pointer();
721 = std::__uninitialized_move_if_noexcept_a
722 (__old_start, __pos, __new_start, _M_get_Tp_allocator());
727 = std::__uninitialized_move_if_noexcept_a
728 (__pos, __old_finish, __new_finish, _M_get_Tp_allocator());
734 __new_start + __elems_before + __n,
735 _M_get_Tp_allocator());
738 _M_get_Tp_allocator());
739 _M_deallocate(__new_start, __len);
740 __throw_exception_again;
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;
753#if __cplusplus >= 201103L
754 template<
typename _Tp,
typename _Alloc>
757 vector<_Tp, _Alloc>::
758 _M_default_append(size_type __n)
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);
766 if (__size > max_size() || __navail > max_size() - __size)
767 __builtin_unreachable();
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);
781 pointer __old_start = this->_M_impl._M_start;
782 pointer __old_finish = this->_M_impl._M_finish;
784 const size_type __len =
785 _M_check_len(__n,
"vector::_M_default_append");
786 pointer __new_start(this->_M_allocate(__len));
789 _Guard_alloc __guard(__new_start, __len, *
this);
791 std::__uninitialized_default_n_a(__new_start + __size, __n,
792 _M_get_Tp_allocator());
794 if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
796 _S_relocate(__old_start, __old_finish,
797 __new_start, _M_get_Tp_allocator());
804 pointer _M_first, _M_last;
805 _Tp_alloc_type& _M_alloc;
808 _Guard_elts(pointer __first, size_type __n,
810 : _M_first(__first), _M_last(__first + __n), _M_alloc(__a)
818 _Guard_elts(
const _Guard_elts&);
820 _Guard_elts __guard_elts(__new_start + __size, __n, _M_impl);
822 std::__uninitialized_move_if_noexcept_a(
823 __old_start, __old_finish, __new_start,
824 _M_get_Tp_allocator());
826 __guard_elts._M_first = __old_start;
827 __guard_elts._M_last = __old_finish;
829 _GLIBCXX_ASAN_ANNOTATE_REINIT;
830 __guard._M_storage = __old_start;
831 __guard._M_len = this->_M_impl._M_end_of_storage - __old_start;
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;
843 template<
typename _Tp,
typename _Alloc>
846 vector<_Tp, _Alloc>::
849 if (capacity() ==
size())
851 _GLIBCXX_ASAN_ANNOTATE_REINIT;
852 return std::__shrink_to_fit_aux<vector>::_S_do_it(*
this);
856 template<
typename _Tp,
typename _Alloc>
857 template<
typename _InputIterator>
860 vector<_Tp, _Alloc>::
861 _M_range_insert(iterator __pos, _InputIterator __first,
866 for (; __first != __last; ++__first)
867 insert(
end(), *__first);
869 else if (__first != __last)
871 vector __tmp(__first, __last, _M_get_Tp_allocator());
873 _GLIBCXX_MAKE_MOVE_ITERATOR(__tmp.begin()),
874 _GLIBCXX_MAKE_MOVE_ITERATOR(__tmp.end()));
878 template<
typename _Tp,
typename _Alloc>
879 template<
typename _ForwardIterator>
882 vector<_Tp, _Alloc>::
883 _M_range_insert(iterator __position, _ForwardIterator __first,
886 if (__first != __last)
889 if (size_type(this->_M_impl._M_end_of_storage
890 - this->_M_impl._M_finish) >= __n)
892 const size_type __elems_after =
end() - __position;
893 pointer __old_finish(this->_M_impl._M_finish);
894 if (__elems_after > __n)
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);
909 _ForwardIterator __mid = __first;
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(),
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);
931 pointer __old_start = this->_M_impl._M_start;
932 pointer __old_finish = this->_M_impl._M_finish;
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();
941 pointer __new_start(this->_M_allocate(__len));
942 pointer __new_finish(__new_start);
946 = std::__uninitialized_move_if_noexcept_a
947 (__old_start, __position.base(),
948 __new_start, _M_get_Tp_allocator());
950 = std::__uninitialized_copy_a(__first, __last,
952 _M_get_Tp_allocator());
954 = std::__uninitialized_move_if_noexcept_a
955 (__position.base(), __old_finish,
956 __new_finish, _M_get_Tp_allocator());
961 _M_get_Tp_allocator());
962 _M_deallocate(__new_start, __len);
963 __throw_exception_again;
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;
979 template<
typename _Alloc>
982 vector<bool, _Alloc>::
983 _M_reallocate(size_type __n)
985 _Bit_pointer __q = this->_M_allocate(__n);
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);
994 template<
typename _Alloc>
997 vector<bool, _Alloc>::
998 _M_fill_insert(iterator __position, size_type __n,
bool __x)
1002 if (capacity() -
size() >= __n)
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);
1011 const size_type __len =
1012 _M_check_len(__n,
"vector<bool>::_M_fill_insert");
1013 _Bit_pointer __q = this->_M_allocate(__len);
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;
1026 template<
typename _Alloc>
1027 template<
typename _ForwardIterator>
1028 _GLIBCXX20_CONSTEXPR
1030 vector<bool, _Alloc>::
1031 _M_insert_range(iterator __position, _ForwardIterator __first,
1034 if (__first != __last)
1037 if (capacity() -
size() >= __n)
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);
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);
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;
1063 template<
typename _Alloc>
1064 _GLIBCXX20_CONSTEXPR
1066 vector<bool, _Alloc>::
1067 _M_insert_aux(iterator __position,
bool __x)
1069 if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_addr())
1071 std::copy_backward(__position, this->_M_impl._M_finish,
1072 this->_M_impl._M_finish + 1);
1074 ++this->_M_impl._M_finish;
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);
1082 iterator __i = _M_copy_aligned(
begin(), __position, __start);
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;
1092 template<
typename _Alloc>
1093 _GLIBCXX20_CONSTEXPR
1094 typename vector<bool, _Alloc>::iterator
1095 vector<bool, _Alloc>::
1096 _M_erase(iterator __position)
1098 if (__position + 1 !=
end())
1099 std::copy(__position + 1,
end(), __position);
1100 --this->_M_impl._M_finish;
1104 template<
typename _Alloc>
1105 _GLIBCXX20_CONSTEXPR
1106 typename vector<bool, _Alloc>::iterator
1107 vector<bool, _Alloc>::
1108 _M_erase(iterator __first, iterator __last)
1110 if (__first != __last)
1111 _M_erase_at_end(std::copy(__last,
end(), __first));
1115#if __cplusplus >= 201103L
1116 template<
typename _Alloc>
1117 _GLIBCXX20_CONSTEXPR
1122 if (capacity() -
size() <
int(_S_word_bit))
1126 if (size_type __n =
size())
1130 this->_M_deallocate();
1131 this->_M_impl._M_reset();
1140_GLIBCXX_END_NAMESPACE_CONTAINER
1141_GLIBCXX_END_NAMESPACE_VERSION
1144#if __cplusplus >= 201103L
1146namespace std _GLIBCXX_VISIBILITY(default)
1148_GLIBCXX_BEGIN_NAMESPACE_VERSION
1150 template<
typename _Alloc>
1152 hash<_GLIBCXX_STD_C::vector<bool, _Alloc>>::
1153 operator()(
const _GLIBCXX_STD_C::vector<bool, _Alloc>& __b)
const noexcept
1156 const size_t __words = __b.size() / _S_word_bit;
1159 const size_t __clength = __words *
sizeof(_Bit_type);
1160 __hash = std::_Hash_impl::hash(__b._M_impl._M_start._M_p, __clength);
1163 const size_t __extrabits = __b.size() % _S_word_bit;
1166 _Bit_type __hiword = *__b._M_impl._M_finish._M_p;
1167 __hiword &= ~((~static_cast<_Bit_type>(0)) << __extrabits);
1169 const size_t __clength
1170 = (__extrabits + __CHAR_BIT__ - 1) / __CHAR_BIT__;
1172 __hash = std::_Hash_impl::hash(&__hiword, __clength, __hash);
1174 __hash = std::_Hash_impl::hash(&__hiword, __clength);
1180_GLIBCXX_END_NAMESPACE_VERSION
1185#undef _GLIBCXX_ASAN_ANNOTATE_REINIT
1186#undef _GLIBCXX_ASAN_ANNOTATE_GROW
1187#undef _GLIBCXX_ASAN_ANNOTATE_GREW
1188#undef _GLIBCXX_ASAN_ANNOTATE_SHRINK
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
constexpr _Tp * __addressof(_Tp &__r) noexcept
Same as C++11 std::addressof.
_Tp * end(valarray< _Tp > &__va) noexcept
Return an iterator pointing to one past the last element of the valarray.
_Tp * begin(valarray< _Tp > &__va) noexcept
Return an iterator pointing to the first element of the valarray.
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)
Forward iterators support a superset of input iterator operations.
A standard container which offers fixed time access to individual elements in any order.
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.