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,
119 ++this->_M_impl._M_finish;
120 _GLIBCXX_ASAN_ANNOTATE_GREW(1);
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,
399 ++this->_M_impl._M_finish;
400 _GLIBCXX_ASAN_ANNOTATE_GREW(1);
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;
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);
475 _Tp_alloc_type& _M_alloc;
478 _Guard(pointer __s, size_type __l, _Tp_alloc_type& __a)
479 : _M_storage(__s), _M_len(__l), _M_alloc(__a)
491 _Guard(
const _Guard&);
495 _Guard __guard(__new_start, __len, _M_impl);
504#if __cplusplus >= 201103L
505 _Alloc_traits::construct(this->_M_impl,
506 std::__to_address(__new_start + __elems_before),
509 _Alloc_traits::construct(this->_M_impl,
510 __new_start + __elems_before,
514#if __cplusplus >= 201103L
515 if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
518 __new_finish = _S_relocate(__old_start, __position.base(),
519 __new_start, _M_get_Tp_allocator());
521 __new_finish = _S_relocate(__position.base(), __old_finish,
522 __new_finish, _M_get_Tp_allocator());
530 pointer _M_first, _M_last;
531 _Tp_alloc_type& _M_alloc;
534 _Guard_elts(pointer __elt, _Tp_alloc_type& __a)
535 : _M_first(__elt), _M_last(__elt + 1), _M_alloc(__a)
543 _Guard_elts(
const _Guard_elts&);
547 _Guard_elts __guard_elts(__new_start + __elems_before, _M_impl);
549 __new_finish = std::__uninitialized_move_if_noexcept_a(
550 __old_start, __position.base(),
551 __new_start, _M_get_Tp_allocator());
555 __guard_elts._M_first = __new_start;
557 __new_finish = std::__uninitialized_move_if_noexcept_a(
558 __position.base(), __old_finish,
559 __new_finish, _M_get_Tp_allocator());
562 __guard_elts._M_first = __old_start;
563 __guard_elts._M_last = __old_finish;
565 __guard._M_storage = __old_start;
566 __guard._M_len = this->_M_impl._M_end_of_storage - __old_start;
571 this->_M_impl._M_start = __new_start;
572 this->_M_impl._M_finish = __new_finish;
573 this->_M_impl._M_end_of_storage = __new_start + __len;
576#if __cplusplus >= 201103L
577 template<
typename _Tp,
typename _Alloc>
578 template<
typename... _Args>
581 vector<_Tp, _Alloc>::
582 _M_realloc_append(_Args&&... __args)
584 template<
typename _Tp,
typename _Alloc>
586 vector<_Tp, _Alloc>::
587 _M_realloc_append(
const _Tp& __x)
590 const size_type __len = _M_check_len(1u,
"vector::_M_realloc_append");
592 __builtin_unreachable ();
593 pointer __old_start = this->_M_impl._M_start;
594 pointer __old_finish = this->_M_impl._M_finish;
595 const size_type __elems =
end() -
begin();
596 pointer __new_start(this->_M_allocate(__len));
597 pointer __new_finish(__new_start);
604 _Tp_alloc_type& _M_alloc;
607 _Guard(pointer __s, size_type __l, _Tp_alloc_type& __a)
608 : _M_storage(__s), _M_len(__l), _M_alloc(__a)
620 _Guard(
const _Guard&);
624 _Guard __guard(__new_start, __len, _M_impl);
633#if __cplusplus >= 201103L
634 _Alloc_traits::construct(this->_M_impl,
635 std::__to_address(__new_start + __elems),
638 _Alloc_traits::construct(this->_M_impl,
639 __new_start + __elems,
643#if __cplusplus >= 201103L
644 if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
647 __new_finish = _S_relocate(__old_start, __old_finish,
648 __new_start, _M_get_Tp_allocator());
657 pointer _M_first, _M_last;
658 _Tp_alloc_type& _M_alloc;
661 _Guard_elts(pointer __elt, _Tp_alloc_type& __a)
662 : _M_first(__elt), _M_last(__elt + 1), _M_alloc(__a)
670 _Guard_elts(
const _Guard_elts&);
674 _Guard_elts __guard_elts(__new_start + __elems, _M_impl);
676 __new_finish = std::__uninitialized_move_if_noexcept_a(
677 __old_start, __old_finish,
678 __new_start, _M_get_Tp_allocator());
683 __guard_elts._M_first = __old_start;
684 __guard_elts._M_last = __old_finish;
686 __guard._M_storage = __old_start;
687 __guard._M_len = this->_M_impl._M_end_of_storage - __old_start;
692 this->_M_impl._M_start = __new_start;
693 this->_M_impl._M_finish = __new_finish;
694 this->_M_impl._M_end_of_storage = __new_start + __len;
697 template<
typename _Tp,
typename _Alloc>
700 vector<_Tp, _Alloc>::
701 _M_fill_insert(iterator __position, size_type __n,
const value_type& __x)
705 if (size_type(this->_M_impl._M_end_of_storage
706 - this->_M_impl._M_finish) >= __n)
708#if __cplusplus < 201103L
709 value_type __x_copy = __x;
711 _Temporary_value __tmp(
this, __x);
712 value_type& __x_copy = __tmp._M_val();
714 const size_type __elems_after =
end() - __position;
715 pointer __old_finish(this->_M_impl._M_finish);
716 if (__elems_after > __n)
718 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
719 std::__uninitialized_move_a(__old_finish - __n,
722 _M_get_Tp_allocator());
723 this->_M_impl._M_finish += __n;
724 _GLIBCXX_ASAN_ANNOTATE_GREW(__n);
725 _GLIBCXX_MOVE_BACKWARD3(__position.base(),
726 __old_finish - __n, __old_finish);
727 std::fill(__position.base(), __position.base() + __n,
732 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
733 this->_M_impl._M_finish =
734 std::__uninitialized_fill_n_a(__old_finish,
737 _M_get_Tp_allocator());
738 _GLIBCXX_ASAN_ANNOTATE_GREW(__n - __elems_after);
739 std::__uninitialized_move_a(__position.base(), __old_finish,
740 this->_M_impl._M_finish,
741 _M_get_Tp_allocator());
742 this->_M_impl._M_finish += __elems_after;
743 _GLIBCXX_ASAN_ANNOTATE_GREW(__elems_after);
744 std::fill(__position.base(), __old_finish, __x_copy);
751 pointer __old_start = this->_M_impl._M_start;
752 pointer __old_finish = this->_M_impl._M_finish;
753 const pointer __pos = __position.base();
755 const size_type __len =
756 _M_check_len(__n,
"vector::_M_fill_insert");
757 const size_type __elems_before = __pos - __old_start;
758 pointer __new_start(this->_M_allocate(__len));
759 pointer __new_finish(__new_start);
763 std::__uninitialized_fill_n_a(__new_start + __elems_before,
765 _M_get_Tp_allocator());
766 __new_finish = pointer();
769 = std::__uninitialized_move_if_noexcept_a
770 (__old_start, __pos, __new_start, _M_get_Tp_allocator());
775 = std::__uninitialized_move_if_noexcept_a
776 (__pos, __old_finish, __new_finish, _M_get_Tp_allocator());
782 __new_start + __elems_before + __n,
783 _M_get_Tp_allocator());
786 _M_get_Tp_allocator());
787 _M_deallocate(__new_start, __len);
788 __throw_exception_again;
790 std::_Destroy(__old_start, __old_finish, _M_get_Tp_allocator());
791 _GLIBCXX_ASAN_ANNOTATE_REINIT;
792 _M_deallocate(__old_start,
793 this->_M_impl._M_end_of_storage - __old_start);
794 this->_M_impl._M_start = __new_start;
795 this->_M_impl._M_finish = __new_finish;
796 this->_M_impl._M_end_of_storage = __new_start + __len;
801#if __cplusplus >= 201103L
802 template<
typename _Tp,
typename _Alloc>
805 vector<_Tp, _Alloc>::
806 _M_default_append(size_type __n)
810 const size_type __size =
size();
811 size_type __navail = size_type(this->_M_impl._M_end_of_storage
812 - this->_M_impl._M_finish);
814 if (__size > max_size() || __navail > max_size() - __size)
815 __builtin_unreachable();
819 if (!this->_M_impl._M_finish)
820 __builtin_unreachable();
822 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
823 this->_M_impl._M_finish =
824 std::__uninitialized_default_n_a(this->_M_impl._M_finish,
825 __n, _M_get_Tp_allocator());
826 _GLIBCXX_ASAN_ANNOTATE_GREW(__n);
832 pointer __old_start = this->_M_impl._M_start;
833 pointer __old_finish = this->_M_impl._M_finish;
835 const size_type __len =
836 _M_check_len(__n,
"vector::_M_default_append");
837 pointer __new_start(this->_M_allocate(__len));
844 _Tp_alloc_type& _M_alloc;
847 _Guard(pointer __s, size_type __l, _Tp_alloc_type& __a)
848 : _M_storage(__s), _M_len(__l), _M_alloc(__a)
860 _Guard(
const _Guard&);
864 _Guard __guard(__new_start, __len, _M_impl);
866 std::__uninitialized_default_n_a(__new_start + __size, __n,
867 _M_get_Tp_allocator());
869 if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
871 _S_relocate(__old_start, __old_finish,
872 __new_start, _M_get_Tp_allocator());
879 pointer _M_first, _M_last;
880 _Tp_alloc_type& _M_alloc;
883 _Guard_elts(pointer __first, size_type __n,
885 : _M_first(__first), _M_last(__first + __n), _M_alloc(__a)
893 _Guard_elts(
const _Guard_elts&);
895 _Guard_elts __guard_elts(__new_start + __size, __n, _M_impl);
897 std::__uninitialized_move_if_noexcept_a(
898 __old_start, __old_finish, __new_start,
899 _M_get_Tp_allocator());
901 __guard_elts._M_first = __old_start;
902 __guard_elts._M_last = __old_finish;
904 _GLIBCXX_ASAN_ANNOTATE_REINIT;
905 __guard._M_storage = __old_start;
906 __guard._M_len = this->_M_impl._M_end_of_storage - __old_start;
911 this->_M_impl._M_start = __new_start;
912 this->_M_impl._M_finish = __new_start + __size + __n;
913 this->_M_impl._M_end_of_storage = __new_start + __len;
918 template<
typename _Tp,
typename _Alloc>
921 vector<_Tp, _Alloc>::
924 if (capacity() ==
size())
926 _GLIBCXX_ASAN_ANNOTATE_REINIT;
927 return std::__shrink_to_fit_aux<vector>::_S_do_it(*
this);
931 template<
typename _Tp,
typename _Alloc>
932 template<
typename _InputIterator>
935 vector<_Tp, _Alloc>::
936 _M_range_insert(iterator __pos, _InputIterator __first,
941 for (; __first != __last; ++__first)
942 insert(
end(), *__first);
944 else if (__first != __last)
946 vector __tmp(__first, __last, _M_get_Tp_allocator());
948 _GLIBCXX_MAKE_MOVE_ITERATOR(__tmp.begin()),
949 _GLIBCXX_MAKE_MOVE_ITERATOR(__tmp.end()));
953 template<
typename _Tp,
typename _Alloc>
954 template<
typename _ForwardIterator>
957 vector<_Tp, _Alloc>::
958 _M_range_insert(iterator __position, _ForwardIterator __first,
961 if (__first != __last)
964 if (size_type(this->_M_impl._M_end_of_storage
965 - this->_M_impl._M_finish) >= __n)
967 const size_type __elems_after =
end() - __position;
968 pointer __old_finish(this->_M_impl._M_finish);
969 if (__elems_after > __n)
971 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
972 std::__uninitialized_move_a(this->_M_impl._M_finish - __n,
973 this->_M_impl._M_finish,
974 this->_M_impl._M_finish,
975 _M_get_Tp_allocator());
976 this->_M_impl._M_finish += __n;
977 _GLIBCXX_ASAN_ANNOTATE_GREW(__n);
978 _GLIBCXX_MOVE_BACKWARD3(__position.base(),
979 __old_finish - __n, __old_finish);
980 std::copy(__first, __last, __position);
984 _ForwardIterator __mid = __first;
986 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
987 std::__uninitialized_copy_a(__mid, __last,
988 this->_M_impl._M_finish,
989 _M_get_Tp_allocator());
990 this->_M_impl._M_finish += __n - __elems_after;
991 _GLIBCXX_ASAN_ANNOTATE_GREW(__n - __elems_after);
992 std::__uninitialized_move_a(__position.base(),
994 this->_M_impl._M_finish,
995 _M_get_Tp_allocator());
996 this->_M_impl._M_finish += __elems_after;
997 _GLIBCXX_ASAN_ANNOTATE_GREW(__elems_after);
998 std::copy(__first, __mid, __position);
1006 pointer __old_start = this->_M_impl._M_start;
1007 pointer __old_finish = this->_M_impl._M_finish;
1008 if ((__old_finish - __old_start) < 0)
1009 __builtin_unreachable();
1011 const size_type __len =
1012 _M_check_len(__n,
"vector::_M_range_insert");
1013#if __cplusplus < 201103L
1014 if (__len < (__n + (__old_finish - __old_start)))
1015 __builtin_unreachable();
1018 pointer __new_start(this->_M_allocate(__len));
1019 pointer __new_finish(__new_start);
1023 = std::__uninitialized_move_if_noexcept_a
1024 (__old_start, __position.base(),
1025 __new_start, _M_get_Tp_allocator());
1027 = std::__uninitialized_copy_a(__first, __last,
1029 _M_get_Tp_allocator());
1031 = std::__uninitialized_move_if_noexcept_a
1032 (__position.base(), __old_finish,
1033 __new_finish, _M_get_Tp_allocator());
1038 _M_get_Tp_allocator());
1039 _M_deallocate(__new_start, __len);
1040 __throw_exception_again;
1043 _M_get_Tp_allocator());
1044 _GLIBCXX_ASAN_ANNOTATE_REINIT;
1045 _M_deallocate(__old_start,
1046 this->_M_impl._M_end_of_storage - __old_start);
1047 this->_M_impl._M_start = __new_start;
1048 this->_M_impl._M_finish = __new_finish;
1049 this->_M_impl._M_end_of_storage = __new_start + __len;
1056 template<
typename _Alloc>
1057 _GLIBCXX20_CONSTEXPR
1059 vector<bool, _Alloc>::
1060 _M_reallocate(size_type __n)
1062 const iterator __begin =
begin(), __end =
end();
1063 if (size_type(__end - __begin) > __n)
1064 __builtin_unreachable();
1065 _Bit_pointer __q = this->_M_allocate(__n);
1067 iterator __finish(_M_copy_aligned(__begin, __end, __start));
1068 this->_M_deallocate();
1069 this->_M_impl._M_start = __start;
1070 this->_M_impl._M_finish = __finish;
1071 this->_M_impl._M_end_of_storage = __q + _S_nword(__n);
1074 template<
typename _Alloc>
1075 _GLIBCXX20_CONSTEXPR
1077 vector<bool, _Alloc>::
1078 _M_fill_insert(iterator __position, size_type __n,
bool __x)
1082 if (capacity() -
size() >= __n)
1084 std::copy_backward(__position,
end(),
1085 this->_M_impl._M_finish + difference_type(__n));
1086 std::fill(__position, __position + difference_type(__n), __x);
1087 this->_M_impl._M_finish += difference_type(__n);
1091 const size_type __len =
1092 _M_check_len(__n,
"vector<bool>::_M_fill_insert");
1093 iterator __begin =
begin(), __end =
end();
1094 _Bit_pointer __q = this->_M_allocate(__len);
1096 iterator __i = _M_copy_aligned(__begin, __position, __start);
1097 std::fill(__i, __i + difference_type(__n), __x);
1098 iterator __finish = std::copy(__position, __end,
1099 __i + difference_type(__n));
1100 this->_M_deallocate();
1101 this->_M_impl._M_end_of_storage = __q + _S_nword(__len);
1102 this->_M_impl._M_start = __start;
1103 this->_M_impl._M_finish = __finish;
1107 template<
typename _Alloc>
1108 template<
typename _ForwardIterator>
1109 _GLIBCXX20_CONSTEXPR
1111 vector<bool, _Alloc>::
1112 _M_insert_range(iterator __position, _ForwardIterator __first,
1115 if (__first != __last)
1118 if (capacity() -
size() >= __n)
1120 std::copy_backward(__position,
end(),
1121 this->_M_impl._M_finish
1122 + difference_type(__n));
1123 std::copy(__first, __last, __position);
1124 this->_M_impl._M_finish += difference_type(__n);
1128 const size_type __len =
1129 _M_check_len(__n,
"vector<bool>::_M_insert_range");
1131 _Bit_pointer __q = this->_M_allocate(__len);
1133 iterator __i = _M_copy_aligned(__begin, __position, __start);
1134 __i = std::copy(__first, __last, __i);
1135 iterator __finish = std::copy(__position, __end, __i);
1136 this->_M_deallocate();
1137 this->_M_impl._M_end_of_storage = __q + _S_nword(__len);
1138 this->_M_impl._M_start = __start;
1139 this->_M_impl._M_finish = __finish;
1144 template<
typename _Alloc>
1145 _GLIBCXX20_CONSTEXPR
1147 vector<bool, _Alloc>::
1148 _M_insert_aux(iterator __position,
bool __x)
1150 if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_addr())
1152 std::copy_backward(__position, this->_M_impl._M_finish,
1153 this->_M_impl._M_finish + 1);
1155 ++this->_M_impl._M_finish;
1159 const size_type __len =
1160 _M_check_len(size_type(1),
"vector<bool>::_M_insert_aux");
1161 _Bit_pointer __q = this->_M_allocate(__len);
1163 iterator __i = _M_copy_aligned(
begin(), __position, __start);
1165 iterator __finish = std::copy(__position,
end(), __i);
1166 this->_M_deallocate();
1167 this->_M_impl._M_end_of_storage = __q + _S_nword(__len);
1168 this->_M_impl._M_start = __start;
1169 this->_M_impl._M_finish = __finish;
1173 template<
typename _Alloc>
1174 _GLIBCXX20_CONSTEXPR
1175 typename vector<bool, _Alloc>::iterator
1176 vector<bool, _Alloc>::
1177 _M_erase(iterator __position)
1179 if (__position + 1 !=
end())
1180 std::copy(__position + 1,
end(), __position);
1181 --this->_M_impl._M_finish;
1185 template<
typename _Alloc>
1186 _GLIBCXX20_CONSTEXPR
1187 typename vector<bool, _Alloc>::iterator
1188 vector<bool, _Alloc>::
1189 _M_erase(iterator __first, iterator __last)
1191 if (__first != __last)
1192 _M_erase_at_end(std::copy(__last,
end(), __first));
1196#if __cplusplus >= 201103L
1197 template<
typename _Alloc>
1198 _GLIBCXX20_CONSTEXPR
1200 vector<bool, _Alloc>::
1203 if (capacity() -
size() <
int(_S_word_bit))
1207 if (size_type __n =
size())
1211 this->_M_deallocate();
1212 this->_M_impl._M_reset();
1221_GLIBCXX_END_NAMESPACE_CONTAINER
1222_GLIBCXX_END_NAMESPACE_VERSION
1225#if __cplusplus >= 201103L
1227namespace std _GLIBCXX_VISIBILITY(default)
1229_GLIBCXX_BEGIN_NAMESPACE_VERSION
1231 template<
typename _Alloc>
1233 hash<_GLIBCXX_STD_C::vector<bool, _Alloc>>
::
1234 operator()(
const _GLIBCXX_STD_C::vector<bool, _Alloc>& __b)
const noexcept
1237 const size_t __words = __b.size() / _S_word_bit;
1240 const size_t __clength = __words *
sizeof(_Bit_type);
1241 __hash = std::_Hash_impl::hash(__b._M_impl._M_start._M_p, __clength);
1244 const size_t __extrabits = __b.size() % _S_word_bit;
1247 _Bit_type __hiword = *__b._M_impl._M_finish._M_p;
1248 __hiword &= ~((~static_cast<_Bit_type>(0)) << __extrabits);
1250 const size_t __clength
1251 = (__extrabits + __CHAR_BIT__ - 1) / __CHAR_BIT__;
1253 __hash = std::_Hash_impl::hash(&__hiword, __clength, __hash);
1255 __hash = std::_Hash_impl::hash(&__hiword, __clength);
1261_GLIBCXX_END_NAMESPACE_VERSION
1266#undef _GLIBCXX_ASAN_ANNOTATE_REINIT
1267#undef _GLIBCXX_ASAN_ANNOTATE_GROW
1268#undef _GLIBCXX_ASAN_ANNOTATE_GREW
1269#undef _GLIBCXX_ASAN_ANNOTATE_SHRINK
strong_ordering operator(const error_code &__lhs, const error_code &__rhs) noexcept
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.
constexpr _Tp && forward(typename std::remove_reference< _Tp >::type &__t) noexcept
Forward an lvalue.
_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)
static constexpr void deallocate(_Alloc &__a, pointer __p, size_type __n)
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.