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
67 vector<_Tp, _Alloc>::
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
111 vector<_Tp, _Alloc>::
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
133 vector<_Tp, _Alloc>::
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
181 vector<_Tp, _Alloc>::
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>&
210 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,
301 std::input_iterator_tag)
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,
320 std::forward_iterator_tag)
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 // RAII guard for allocated storage.
471 struct _Guard
472 {
473 pointer _M_storage; // Storage to deallocate
474 size_type _M_len;
475 _Tp_alloc_type& _M_alloc;
476
477 _GLIBCXX20_CONSTEXPR
478 _Guard(pointer __s, size_type __l, _Tp_alloc_type& __a)
479 : _M_storage(__s), _M_len(__l), _M_alloc(__a)
480 { }
481
482 _GLIBCXX20_CONSTEXPR
483 ~_Guard()
484 {
485 if (_M_storage)
486 __gnu_cxx::__alloc_traits<_Tp_alloc_type>::
487 deallocate(_M_alloc, _M_storage, _M_len);
488 }
489
490 private:
491 _Guard(const _Guard&);
492 };
493
494 {
495 _Guard __guard(__new_start, __len, _M_impl);
496
497 // The order of the three operations is dictated by the C++11
498 // case, where the moves could alter a new element belonging
499 // to the existing vector. This is an issue only for callers
500 // taking the element by lvalue ref (see last bullet of C++11
501 // [res.on.arguments]).
502
503 // If this throws, the existing elements are unchanged.
504#if __cplusplus >= 201103L
505 _Alloc_traits::construct(this->_M_impl,
506 std::__to_address(__new_start + __elems_before),
507 std::forward<_Args>(__args)...);
508#else
509 _Alloc_traits::construct(this->_M_impl,
510 __new_start + __elems_before,
511 __x);
512#endif
513
514#if __cplusplus >= 201103L
515 if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
516 {
517 // Relocation cannot throw.
518 __new_finish = _S_relocate(__old_start, __position.base(),
519 __new_start, _M_get_Tp_allocator());
520 ++__new_finish;
521 __new_finish = _S_relocate(__position.base(), __old_finish,
522 __new_finish, _M_get_Tp_allocator());
523 }
524 else
525#endif
526 {
527 // RAII type to destroy initialized elements.
528 struct _Guard_elts
529 {
530 pointer _M_first, _M_last; // Elements to destroy
531 _Tp_alloc_type& _M_alloc;
532
533 _GLIBCXX20_CONSTEXPR
534 _Guard_elts(pointer __elt, _Tp_alloc_type& __a)
535 : _M_first(__elt), _M_last(__elt + 1), _M_alloc(__a)
536 { }
537
538 _GLIBCXX20_CONSTEXPR
539 ~_Guard_elts()
540 { std::_Destroy(_M_first, _M_last, _M_alloc); }
541
542 private:
543 _Guard_elts(const _Guard_elts&);
544 };
545
546 // Guard the new element so it will be destroyed if anything throws.
547 _Guard_elts __guard_elts(__new_start + __elems_before, _M_impl);
548
549 __new_finish = std::__uninitialized_move_if_noexcept_a(
550 __old_start, __position.base(),
551 __new_start, _M_get_Tp_allocator());
552
553 ++__new_finish;
554 // Guard everything before the new element too.
555 __guard_elts._M_first = __new_start;
556
557 __new_finish = std::__uninitialized_move_if_noexcept_a(
558 __position.base(), __old_finish,
559 __new_finish, _M_get_Tp_allocator());
560
561 // New storage has been fully initialized, destroy the old elements.
562 __guard_elts._M_first = __old_start;
563 __guard_elts._M_last = __old_finish;
564 }
565 __guard._M_storage = __old_start;
566 __guard._M_len = this->_M_impl._M_end_of_storage - __old_start;
567 }
568 // deallocate should be called before assignments to _M_impl,
569 // to avoid call-clobbering
570
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;
574 }
575
576#if __cplusplus >= 201103L
577 template<typename _Tp, typename _Alloc>
578 template<typename... _Args>
579 _GLIBCXX20_CONSTEXPR
580 void
581 vector<_Tp, _Alloc>::
582 _M_realloc_append(_Args&&... __args)
583#else
584 template<typename _Tp, typename _Alloc>
585 void
586 vector<_Tp, _Alloc>::
587 _M_realloc_append(const _Tp& __x)
588#endif
589 {
590 const size_type __len = _M_check_len(1u, "vector::_M_realloc_append");
591 if (__len <= 0)
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);
598
599 // RAII guard for allocated storage.
600 struct _Guard
601 {
602 pointer _M_storage; // Storage to deallocate
603 size_type _M_len;
604 _Tp_alloc_type& _M_alloc;
605
606 _GLIBCXX20_CONSTEXPR
607 _Guard(pointer __s, size_type __l, _Tp_alloc_type& __a)
608 : _M_storage(__s), _M_len(__l), _M_alloc(__a)
609 { }
610
611 _GLIBCXX20_CONSTEXPR
612 ~_Guard()
613 {
614 if (_M_storage)
615 __gnu_cxx::__alloc_traits<_Tp_alloc_type>::
616 deallocate(_M_alloc, _M_storage, _M_len);
617 }
618
619 private:
620 _Guard(const _Guard&);
621 };
622
623 {
624 _Guard __guard(__new_start, __len, _M_impl);
625
626 // The order of the three operations is dictated by the C++11
627 // case, where the moves could alter a new element belonging
628 // to the existing vector. This is an issue only for callers
629 // taking the element by lvalue ref (see last bullet of C++11
630 // [res.on.arguments]).
631
632 // If this throws, the existing elements are unchanged.
633#if __cplusplus >= 201103L
634 _Alloc_traits::construct(this->_M_impl,
635 std::__to_address(__new_start + __elems),
636 std::forward<_Args>(__args)...);
637#else
638 _Alloc_traits::construct(this->_M_impl,
639 __new_start + __elems,
640 __x);
641#endif
642
643#if __cplusplus >= 201103L
644 if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
645 {
646 // Relocation cannot throw.
647 __new_finish = _S_relocate(__old_start, __old_finish,
648 __new_start, _M_get_Tp_allocator());
649 ++__new_finish;
650 }
651 else
652#endif
653 {
654 // RAII type to destroy initialized elements.
655 struct _Guard_elts
656 {
657 pointer _M_first, _M_last; // Elements to destroy
658 _Tp_alloc_type& _M_alloc;
659
660 _GLIBCXX20_CONSTEXPR
661 _Guard_elts(pointer __elt, _Tp_alloc_type& __a)
662 : _M_first(__elt), _M_last(__elt + 1), _M_alloc(__a)
663 { }
664
665 _GLIBCXX20_CONSTEXPR
666 ~_Guard_elts()
667 { std::_Destroy(_M_first, _M_last, _M_alloc); }
668
669 private:
670 _Guard_elts(const _Guard_elts&);
671 };
672
673 // Guard the new element so it will be destroyed if anything throws.
674 _Guard_elts __guard_elts(__new_start + __elems, _M_impl);
675
676 __new_finish = std::__uninitialized_move_if_noexcept_a(
677 __old_start, __old_finish,
678 __new_start, _M_get_Tp_allocator());
679
680 ++__new_finish;
681
682 // New storage has been fully initialized, destroy the old elements.
683 __guard_elts._M_first = __old_start;
684 __guard_elts._M_last = __old_finish;
685 }
686 __guard._M_storage = __old_start;
687 __guard._M_len = this->_M_impl._M_end_of_storage - __old_start;
688 }
689 // deallocate should be called before assignments to _M_impl,
690 // to avoid call-clobbering
691
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;
695 }
696
697 template<typename _Tp, typename _Alloc>
698 _GLIBCXX20_CONSTEXPR
699 void
700 vector<_Tp, _Alloc>::
701 _M_fill_insert(iterator __position, size_type __n, const value_type& __x)
702 {
703 if (__n != 0)
704 {
705 if (__position.base() == this->_M_impl._M_finish)
706 _M_fill_append(__n, __x);
707 else if (size_type(this->_M_impl._M_end_of_storage
708 - this->_M_impl._M_finish) >= __n)
709 {
710#if __cplusplus < 201103L
711 value_type __x_copy = __x;
712#else
713 _Temporary_value __tmp(this, __x);
714 value_type& __x_copy = __tmp._M_val();
715#endif
716 const size_type __elems_after = end() - __position;
717 pointer __old_finish(this->_M_impl._M_finish);
718 if (__elems_after > __n)
719 {
720 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
721 std::__uninitialized_move_a(__old_finish - __n,
722 __old_finish,
723 __old_finish,
724 _M_get_Tp_allocator());
725 this->_M_impl._M_finish += __n;
726 _GLIBCXX_ASAN_ANNOTATE_GREW(__n);
727 _GLIBCXX_MOVE_BACKWARD3(__position.base(),
728 __old_finish - __n, __old_finish);
729 std::fill(__position.base(), __position.base() + __n,
730 __x_copy);
731 }
732 else
733 {
734 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
735 this->_M_impl._M_finish =
736 std::__uninitialized_fill_n_a(__old_finish,
737 __n - __elems_after,
738 __x_copy,
739 _M_get_Tp_allocator());
740 _GLIBCXX_ASAN_ANNOTATE_GREW(__n - __elems_after);
741 std::__uninitialized_move_a(__position.base(), __old_finish,
742 this->_M_impl._M_finish,
743 _M_get_Tp_allocator());
744 this->_M_impl._M_finish += __elems_after;
745 _GLIBCXX_ASAN_ANNOTATE_GREW(__elems_after);
746 std::fill(__position.base(), __old_finish, __x_copy);
747 }
748 }
749 else
750 {
751 // Make local copies of these members because the compiler thinks
752 // the allocator can alter them if 'this' is globally reachable.
753 pointer __old_start = this->_M_impl._M_start;
754 pointer __old_finish = this->_M_impl._M_finish;
755 const pointer __pos = __position.base();
756
757 const size_type __len =
758 _M_check_len(__n, "vector::_M_fill_insert");
759 const size_type __elems_before = __pos - __old_start;
760 pointer __new_start(this->_M_allocate(__len));
761 pointer __new_finish(__new_start);
762 __try
763 {
764 // See _M_realloc_insert above.
765 std::__uninitialized_fill_n_a(__new_start + __elems_before,
766 __n, __x,
767 _M_get_Tp_allocator());
768 __new_finish = pointer();
769
770 __new_finish
771 = std::__uninitialized_move_if_noexcept_a
772 (__old_start, __pos, __new_start, _M_get_Tp_allocator());
773
774 __new_finish += __n;
775
776 __new_finish
777 = std::__uninitialized_move_if_noexcept_a
778 (__pos, __old_finish, __new_finish, _M_get_Tp_allocator());
779 }
780 __catch(...)
781 {
782 if (!__new_finish)
783 std::_Destroy(__new_start + __elems_before,
784 __new_start + __elems_before + __n,
785 _M_get_Tp_allocator());
786 else
787 std::_Destroy(__new_start, __new_finish,
788 _M_get_Tp_allocator());
789 _M_deallocate(__new_start, __len);
790 __throw_exception_again;
791 }
792 std::_Destroy(__old_start, __old_finish, _M_get_Tp_allocator());
793 _GLIBCXX_ASAN_ANNOTATE_REINIT;
794 _M_deallocate(__old_start,
795 this->_M_impl._M_end_of_storage - __old_start);
796 this->_M_impl._M_start = __new_start;
797 this->_M_impl._M_finish = __new_finish;
798 this->_M_impl._M_end_of_storage = __new_start + __len;
799 }
800 }
801 }
802
803 template<typename _Tp, typename _Alloc>
804 _GLIBCXX20_CONSTEXPR
805 void
806 vector<_Tp, _Alloc>::
807 _M_fill_append(size_type __n, const value_type& __x)
808 {
809 if (size_type(this->_M_impl._M_end_of_storage
810 - this->_M_impl._M_finish) >= __n)
811 {
812 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
813 this->_M_impl._M_finish =
814 std::__uninitialized_fill_n_a(this->_M_impl._M_finish, __n, __x,
815 _M_get_Tp_allocator());
816 _GLIBCXX_ASAN_ANNOTATE_GREW(__n);
817 }
818 else
819 {
820 // Make local copies of these members because the compiler thinks
821 // the allocator can alter them if 'this' is globally reachable.
822 pointer __old_start = this->_M_impl._M_start;
823 pointer __old_finish = this->_M_impl._M_finish;
824 const size_type __old_size = __old_finish - __old_start;
825
826 const size_type __len =
827 _M_check_len(__n, "vector::_M_fill_append");
828 pointer __new_start(this->_M_allocate(__len));
829 pointer __new_finish(__new_start + __old_size);
830 __try
831 {
832 // See _M_realloc_insert above.
833 __new_finish = std::__uninitialized_fill_n_a(
834 __new_finish, __n, __x,
835 _M_get_Tp_allocator());
836 std::__uninitialized_move_if_noexcept_a(
837 __old_start, __old_finish, __new_start,
838 _M_get_Tp_allocator());
839 }
840 __catch(...)
841 {
842 std::_Destroy(__new_start + __old_size, __new_finish,
843 _M_get_Tp_allocator());
844 _M_deallocate(__new_start, __len);
845 __throw_exception_again;
846 }
847 std::_Destroy(__old_start, __old_finish, _M_get_Tp_allocator());
848 _GLIBCXX_ASAN_ANNOTATE_REINIT;
849 _M_deallocate(__old_start,
850 this->_M_impl._M_end_of_storage - __old_start);
851 this->_M_impl._M_start = __new_start;
852 this->_M_impl._M_finish = __new_finish;
853 this->_M_impl._M_end_of_storage = __new_start + __len;
854 }
855 }
856
857#if __cplusplus >= 201103L
858 template<typename _Tp, typename _Alloc>
859 _GLIBCXX20_CONSTEXPR
860 void
861 vector<_Tp, _Alloc>::
862 _M_default_append(size_type __n)
863 {
864 if (__n != 0)
865 {
866 const size_type __size = size();
867 size_type __navail = size_type(this->_M_impl._M_end_of_storage
868 - this->_M_impl._M_finish);
869
870 if (__size > max_size() || __navail > max_size() - __size)
871 __builtin_unreachable();
872
873 if (__navail >= __n)
874 {
875 if (!this->_M_impl._M_finish)
876 __builtin_unreachable();
877
878 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
879 this->_M_impl._M_finish =
880 std::__uninitialized_default_n_a(this->_M_impl._M_finish,
881 __n, _M_get_Tp_allocator());
882 _GLIBCXX_ASAN_ANNOTATE_GREW(__n);
883 }
884 else
885 {
886 // Make local copies of these members because the compiler thinks
887 // the allocator can alter them if 'this' is globally reachable.
888 pointer __old_start = this->_M_impl._M_start;
889 pointer __old_finish = this->_M_impl._M_finish;
890
891 const size_type __len =
892 _M_check_len(__n, "vector::_M_default_append");
893 pointer __new_start(this->_M_allocate(__len));
894
895 // RAII guard for allocated storage.
896 struct _Guard
897 {
898 pointer _M_storage; // Storage to deallocate
899 size_type _M_len;
900 _Tp_alloc_type& _M_alloc;
901
902 _GLIBCXX20_CONSTEXPR
903 _Guard(pointer __s, size_type __l, _Tp_alloc_type& __a)
904 : _M_storage(__s), _M_len(__l), _M_alloc(__a)
905 { }
906
907 _GLIBCXX20_CONSTEXPR
908 ~_Guard()
909 {
910 if (_M_storage)
911 __gnu_cxx::__alloc_traits<_Tp_alloc_type>::
912 deallocate(_M_alloc, _M_storage, _M_len);
913 }
914
915 private:
916 _Guard(const _Guard&);
917 };
918
919 {
920 _Guard __guard(__new_start, __len, _M_impl);
921
922 std::__uninitialized_default_n_a(__new_start + __size, __n,
923 _M_get_Tp_allocator());
924
925 if _GLIBCXX17_CONSTEXPR (_S_use_relocate())
926 {
927 _S_relocate(__old_start, __old_finish,
928 __new_start, _M_get_Tp_allocator());
929 }
930 else
931 {
932 // RAII type to destroy initialized elements.
933 struct _Guard_elts
934 {
935 pointer _M_first, _M_last; // Elements to destroy
936 _Tp_alloc_type& _M_alloc;
937
938 _GLIBCXX20_CONSTEXPR
939 _Guard_elts(pointer __first, size_type __n,
940 _Tp_alloc_type& __a)
941 : _M_first(__first), _M_last(__first + __n), _M_alloc(__a)
942 { }
943
944 _GLIBCXX20_CONSTEXPR
945 ~_Guard_elts()
946 { std::_Destroy(_M_first, _M_last, _M_alloc); }
947
948 private:
949 _Guard_elts(const _Guard_elts&);
950 };
951 _Guard_elts __guard_elts(__new_start + __size, __n, _M_impl);
952
953 std::__uninitialized_move_if_noexcept_a(
954 __old_start, __old_finish, __new_start,
955 _M_get_Tp_allocator());
956
957 __guard_elts._M_first = __old_start;
958 __guard_elts._M_last = __old_finish;
959 }
960 _GLIBCXX_ASAN_ANNOTATE_REINIT;
961 __guard._M_storage = __old_start;
962 __guard._M_len = this->_M_impl._M_end_of_storage - __old_start;
963 }
964 // deallocate should be called before assignments to _M_impl,
965 // to avoid call-clobbering
966
967 this->_M_impl._M_start = __new_start;
968 this->_M_impl._M_finish = __new_start + __size + __n;
969 this->_M_impl._M_end_of_storage = __new_start + __len;
970 }
971 }
972 }
973
974 template<typename _Tp, typename _Alloc>
975 _GLIBCXX20_CONSTEXPR
976 bool
977 vector<_Tp, _Alloc>::
978 _M_shrink_to_fit()
979 {
980 if (capacity() == size())
981 return false;
982 _GLIBCXX_ASAN_ANNOTATE_REINIT;
983 return std::__shrink_to_fit_aux<vector>::_S_do_it(*this);
984 }
985#endif
986
987 template<typename _Tp, typename _Alloc>
988 template<typename _InputIterator>
989 _GLIBCXX20_CONSTEXPR
990 void
991 vector<_Tp, _Alloc>::
992 _M_range_insert(iterator __pos, _InputIterator __first,
993 _InputIterator __last, std::input_iterator_tag)
994 {
995 if (__pos == end())
996 {
997 for (; __first != __last; ++__first)
998 insert(end(), *__first);
999 }
1000 else if (__first != __last)
1001 {
1002 vector __tmp(__first, __last, _M_get_Tp_allocator());
1003 insert(__pos,
1004 _GLIBCXX_MAKE_MOVE_ITERATOR(__tmp.begin()),
1005 _GLIBCXX_MAKE_MOVE_ITERATOR(__tmp.end()));
1006 }
1007 }
1008
1009 template<typename _Tp, typename _Alloc>
1010 template<typename _ForwardIterator>
1011 _GLIBCXX20_CONSTEXPR
1012 void
1013 vector<_Tp, _Alloc>::
1014 _M_range_insert(iterator __position, _ForwardIterator __first,
1015 _ForwardIterator __last, std::forward_iterator_tag)
1016 {
1017 if (__first != __last)
1018 {
1019 const size_type __n = std::distance(__first, __last);
1020 if (size_type(this->_M_impl._M_end_of_storage
1021 - this->_M_impl._M_finish) >= __n)
1022 {
1023 const size_type __elems_after = end() - __position;
1024 pointer __old_finish(this->_M_impl._M_finish);
1025 if (__elems_after > __n)
1026 {
1027 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
1028 std::__uninitialized_move_a(this->_M_impl._M_finish - __n,
1029 this->_M_impl._M_finish,
1030 this->_M_impl._M_finish,
1031 _M_get_Tp_allocator());
1032 this->_M_impl._M_finish += __n;
1033 _GLIBCXX_ASAN_ANNOTATE_GREW(__n);
1034 _GLIBCXX_MOVE_BACKWARD3(__position.base(),
1035 __old_finish - __n, __old_finish);
1036 std::copy(__first, __last, __position);
1037 }
1038 else
1039 {
1040 _ForwardIterator __mid = __first;
1041 std::advance(__mid, __elems_after);
1042 _GLIBCXX_ASAN_ANNOTATE_GROW(__n);
1043 std::__uninitialized_copy_a(__mid, __last,
1044 this->_M_impl._M_finish,
1045 _M_get_Tp_allocator());
1046 this->_M_impl._M_finish += __n - __elems_after;
1047 _GLIBCXX_ASAN_ANNOTATE_GREW(__n - __elems_after);
1048 std::__uninitialized_move_a(__position.base(),
1049 __old_finish,
1050 this->_M_impl._M_finish,
1051 _M_get_Tp_allocator());
1052 this->_M_impl._M_finish += __elems_after;
1053 _GLIBCXX_ASAN_ANNOTATE_GREW(__elems_after);
1054 std::copy(__first, __mid, __position);
1055 }
1056 }
1057 else
1058 {
1059 // Make local copies of these members because the compiler
1060 // thinks the allocator can alter them if 'this' is globally
1061 // reachable.
1062 pointer __old_start = this->_M_impl._M_start;
1063 pointer __old_finish = this->_M_impl._M_finish;
1064 if ((__old_finish - __old_start) < 0)
1065 __builtin_unreachable();
1066
1067 const size_type __len =
1068 _M_check_len(__n, "vector::_M_range_insert");
1069#if __cplusplus < 201103L
1070 if (__len < (__n + (__old_finish - __old_start)))
1071 __builtin_unreachable();
1072#endif
1073
1074 pointer __new_start(this->_M_allocate(__len));
1075 pointer __new_finish(__new_start);
1076 __try
1077 {
1078 __new_finish
1079 = std::__uninitialized_move_if_noexcept_a
1080 (__old_start, __position.base(),
1081 __new_start, _M_get_Tp_allocator());
1082 __new_finish
1083 = std::__uninitialized_copy_a(__first, __last,
1084 __new_finish,
1085 _M_get_Tp_allocator());
1086 __new_finish
1087 = std::__uninitialized_move_if_noexcept_a
1088 (__position.base(), __old_finish,
1089 __new_finish, _M_get_Tp_allocator());
1090 }
1091 __catch(...)
1092 {
1093 std::_Destroy(__new_start, __new_finish,
1094 _M_get_Tp_allocator());
1095 _M_deallocate(__new_start, __len);
1096 __throw_exception_again;
1097 }
1098 std::_Destroy(__old_start, __old_finish,
1099 _M_get_Tp_allocator());
1100 _GLIBCXX_ASAN_ANNOTATE_REINIT;
1101 _M_deallocate(__old_start,
1102 this->_M_impl._M_end_of_storage - __old_start);
1103 this->_M_impl._M_start = __new_start;
1104 this->_M_impl._M_finish = __new_finish;
1105 this->_M_impl._M_end_of_storage = __new_start + __len;
1106 }
1107 }
1108 }
1109
1110
1111 // vector<bool>
1112 template<typename _Alloc>
1113 _GLIBCXX20_CONSTEXPR
1114 void
1115 vector<bool, _Alloc>::
1116 _M_reallocate(size_type __n)
1117 {
1118 const iterator __begin = begin(), __end = end();
1119 if (size_type(__end - __begin) > __n)
1120 __builtin_unreachable();
1121 _Bit_pointer __q = this->_M_allocate(__n);
1122 iterator __start(std::__addressof(*__q), 0);
1123 iterator __finish(_M_copy_aligned(__begin, __end, __start));
1124 this->_M_deallocate();
1125 this->_M_impl._M_start = __start;
1126 this->_M_impl._M_finish = __finish;
1127 this->_M_impl._M_end_of_storage = __q + _S_nword(__n);
1128 }
1129
1130 template<typename _Alloc>
1131 _GLIBCXX20_CONSTEXPR
1132 void
1133 vector<bool, _Alloc>::
1134 _M_fill_insert(iterator __position, size_type __n, bool __x)
1135 {
1136 if (__n == 0)
1137 return;
1138 if (capacity() - size() >= __n)
1139 {
1140 std::copy_backward(__position, end(),
1141 this->_M_impl._M_finish + difference_type(__n));
1142 std::fill(__position, __position + difference_type(__n), __x);
1143 this->_M_impl._M_finish += difference_type(__n);
1144 }
1145 else
1146 {
1147 const size_type __len =
1148 _M_check_len(__n, "vector<bool>::_M_fill_insert");
1149 iterator __begin = begin(), __end = end();
1150 _Bit_pointer __q = this->_M_allocate(__len);
1151 iterator __start(std::__addressof(*__q), 0);
1152 iterator __i = _M_copy_aligned(__begin, __position, __start);
1153 std::fill(__i, __i + difference_type(__n), __x);
1154 iterator __finish = std::copy(__position, __end,
1155 __i + difference_type(__n));
1156 this->_M_deallocate();
1157 this->_M_impl._M_end_of_storage = __q + _S_nword(__len);
1158 this->_M_impl._M_start = __start;
1159 this->_M_impl._M_finish = __finish;
1160 }
1161 }
1162
1163 template<typename _Alloc>
1164 template<typename _ForwardIterator>
1165 _GLIBCXX20_CONSTEXPR
1166 void
1167 vector<bool, _Alloc>::
1168 _M_insert_range(iterator __position, _ForwardIterator __first,
1169 _ForwardIterator __last, std::forward_iterator_tag)
1170 {
1171 if (__first != __last)
1172 {
1173 size_type __n = std::distance(__first, __last);
1174 if (capacity() - size() >= __n)
1175 {
1176 std::copy_backward(__position, end(),
1177 this->_M_impl._M_finish
1178 + difference_type(__n));
1179 std::copy(__first, __last, __position);
1180 this->_M_impl._M_finish += difference_type(__n);
1181 }
1182 else
1183 {
1184 const size_type __len =
1185 _M_check_len(__n, "vector<bool>::_M_insert_range");
1186 const iterator __begin = begin(), __end = end();
1187 _Bit_pointer __q = this->_M_allocate(__len);
1188 iterator __start(std::__addressof(*__q), 0);
1189 iterator __i = _M_copy_aligned(__begin, __position, __start);
1190 __i = std::copy(__first, __last, __i);
1191 iterator __finish = std::copy(__position, __end, __i);
1192 this->_M_deallocate();
1193 this->_M_impl._M_end_of_storage = __q + _S_nword(__len);
1194 this->_M_impl._M_start = __start;
1195 this->_M_impl._M_finish = __finish;
1196 }
1197 }
1198 }
1199
1200 template<typename _Alloc>
1201 _GLIBCXX20_CONSTEXPR
1202 void
1203 vector<bool, _Alloc>::
1204 _M_insert_aux(iterator __position, bool __x)
1205 {
1206 if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_addr())
1207 {
1208 std::copy_backward(__position, this->_M_impl._M_finish,
1209 this->_M_impl._M_finish + 1);
1210 *__position = __x;
1211 ++this->_M_impl._M_finish;
1212 }
1213 else
1214 {
1215 const size_type __len =
1216 _M_check_len(size_type(1), "vector<bool>::_M_insert_aux");
1217 _Bit_pointer __q = this->_M_allocate(__len);
1218 iterator __start(std::__addressof(*__q), 0);
1219 iterator __i = _M_copy_aligned(begin(), __position, __start);
1220 *__i++ = __x;
1221 iterator __finish = std::copy(__position, end(), __i);
1222 this->_M_deallocate();
1223 this->_M_impl._M_end_of_storage = __q + _S_nword(__len);
1224 this->_M_impl._M_start = __start;
1225 this->_M_impl._M_finish = __finish;
1226 }
1227 }
1228
1229 template<typename _Alloc>
1230 _GLIBCXX20_CONSTEXPR
1231 typename vector<bool, _Alloc>::iterator
1232 vector<bool, _Alloc>::
1233 _M_erase(iterator __position)
1234 {
1235 if (__position + 1 != end())
1236 std::copy(__position + 1, end(), __position);
1237 --this->_M_impl._M_finish;
1238 return __position;
1239 }
1240
1241 template<typename _Alloc>
1242 _GLIBCXX20_CONSTEXPR
1243 typename vector<bool, _Alloc>::iterator
1244 vector<bool, _Alloc>::
1245 _M_erase(iterator __first, iterator __last)
1246 {
1247 if (__first != __last)
1248 _M_erase_at_end(std::copy(__last, end(), __first));
1249 return __first;
1250 }
1251
1252#if __cplusplus >= 201103L
1253 template<typename _Alloc>
1254 _GLIBCXX20_CONSTEXPR
1255 bool
1256 vector<bool, _Alloc>::
1257 _M_shrink_to_fit()
1258 {
1259 if (capacity() - size() < int(_S_word_bit))
1260 return false;
1261 __try
1262 {
1263 if (size_type __n = size())
1264 _M_reallocate(__n);
1265 else
1266 {
1267 this->_M_deallocate();
1268 this->_M_impl._M_reset();
1269 }
1270 return true;
1271 }
1272 __catch(...)
1273 { return false; }
1274 }
1275#endif
1276
1277_GLIBCXX_END_NAMESPACE_CONTAINER
1278_GLIBCXX_END_NAMESPACE_VERSION
1279} // namespace std
1280
1281#if __cplusplus >= 201103L
1282
1283namespace std _GLIBCXX_VISIBILITY(default)
1284{
1285_GLIBCXX_BEGIN_NAMESPACE_VERSION
1286
1287 template<typename _Alloc>
1288 size_t
1289 hash<_GLIBCXX_STD_C::vector<bool, _Alloc>>::
1290 operator()(const _GLIBCXX_STD_C::vector<bool, _Alloc>& __b) const noexcept
1291 {
1292 size_t __hash = 0;
1293 const size_t __words = __b.size() / _S_word_bit;
1294 if (__words)
1295 {
1296 const size_t __clength = __words * sizeof(_Bit_type);
1297 __hash = std::_Hash_impl::hash(__b._M_impl._M_start._M_p, __clength);
1298 }
1299
1300 const size_t __extrabits = __b.size() % _S_word_bit;
1301 if (__extrabits)
1302 {
1303 _Bit_type __hiword = *__b._M_impl._M_finish._M_p;
1304 __hiword &= ~((~static_cast<_Bit_type>(0)) << __extrabits);
1305
1306 const size_t __clength
1307 = (__extrabits + __CHAR_BIT__ - 1) / __CHAR_BIT__;
1308 if (__words)
1309 __hash = std::_Hash_impl::hash(&__hiword, __clength, __hash);
1310 else
1311 __hash = std::_Hash_impl::hash(&__hiword, __clength);
1312 }
1313
1314 return __hash;
1315 }
1316
1317_GLIBCXX_END_NAMESPACE_VERSION
1318} // namespace std
1319
1320#endif // C++11
1321
1322#undef _GLIBCXX_ASAN_ANNOTATE_REINIT
1323#undef _GLIBCXX_ASAN_ANNOTATE_GROW
1324#undef _GLIBCXX_ASAN_ANNOTATE_GREW
1325#undef _GLIBCXX_ASAN_ANNOTATE_SHRINK
1326
1327#endif /* _VECTOR_TCC */
std::move
constexpr std::remove_reference< _Tp >::type && move(_Tp &&__t) noexcept
Convert a value to an rvalue.
Definition move.h:137
std::__addressof
constexpr _Tp * __addressof(_Tp &__r) noexcept
Same as C++11 std::addressof.
Definition move.h:51
std::forward
constexpr _Tp && forward(typename std::remove_reference< _Tp >::type &__t) noexcept
Forward an lvalue.
Definition move.h:71
std::end
_Tp * end(valarray< _Tp > &__va) noexcept
Return an iterator pointing to one past the last element of the valarray.
Definition valarray:1249
std::begin
_Tp * begin(valarray< _Tp > &__va) noexcept
Return an iterator pointing to the first element of the valarray.
Definition valarray:1227
std::__iterator_category
constexpr iterator_traits< _Iter >::iterator_category __iterator_category(const _Iter &)
Definition stl_iterator_base_types.h:239
std
ISO C++ entities toplevel namespace is std.
std::distance
constexpr iterator_traits< _InputIterator >::difference_type distance(_InputIterator __first, _InputIterator __last)
A generalization of pointer arithmetic.
Definition stl_iterator_base_funcs.h:148
std::cend
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.
Definition range_access.h:138
std::size
constexpr auto size(const _Container &__cont) noexcept(noexcept(__cont.size())) -> decltype(__cont.size())
Return the size of a container.
Definition range_access.h:262
std::advance
constexpr void advance(_InputIterator &__i, _Distance __n)
A generalization of pointer arithmetic.
Definition stl_iterator_base_funcs.h:220
std::cbegin
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.
Definition range_access.h:126
std::_Destroy
constexpr void _Destroy(_ForwardIterator __first, _ForwardIterator __last)
Definition stl_construct.h:182
std::hash
Primary class template hash.
Definition functional_hash.h:103
std::iterator
Common iterator class.
Definition stl_iterator_base_types.h:128
std::vector
A standard container which offers fixed time access to individual elements in any order.
Definition stl_vector.h:432
std::vector::insert
constexpr iterator insert(const_iterator __position, const value_type &__x)
Inserts given value into vector before specified iterator.
Definition vector.tcc:135
std::vector::end
constexpr iterator end() noexcept
Definition stl_vector.h:906
std::vector::vector
vector()=default
Creates a vector with no elements.
std::vector::begin
constexpr iterator begin() noexcept
Definition stl_vector.h:886
std::vector::capacity
constexpr size_type capacity() const noexcept
Definition stl_vector.h:1091
std::vector::reserve
constexpr void reserve(size_type __n)
Attempt to preallocate enough memory for specified number of elements.
Definition vector.tcc:68
std::vector::_M_allocate_and_copy
constexpr pointer _M_allocate_and_copy(size_type __n, _ForwardIterator __first, _ForwardIterator __last)
Definition stl_vector.h:1631
std::vector::clear
constexpr void clear() noexcept
Definition stl_vector.h:1620
std::vector::size
constexpr size_type size() const noexcept
Definition stl_vector.h:1005
std::vector::operator=
constexpr vector & operator=(const vector &__x)
Vector assignment operator.
Definition vector.tcc:211
std::vector::max_size
constexpr size_type max_size() const noexcept
Definition stl_vector.h:1011
__gnu_cxx::__alloc_traits::deallocate
static constexpr void deallocate(_Alloc &__a, pointer __p, size_type __n)
Deallocate memory.
Definition bits/alloc_traits.h:357