2 //===------------------------------ vector --------------------------------===//
4 // The LLVM Compiler Infrastructure
6 // This file is dual licensed under the MIT and the University of Illinois Open
7 // Source Licenses. See LICENSE.TXT for details.
9 //===----------------------------------------------------------------------===//
11 #ifndef _LIBCPP_VECTOR
12 #define _LIBCPP_VECTOR
20 template <class T, class Allocator = allocator<T> >
25 typedef Allocator allocator_type;
26 typedef typename allocator_type::reference reference;
27 typedef typename allocator_type::const_reference const_reference;
28 typedef implementation-defined iterator;
29 typedef implementation-defined const_iterator;
30 typedef typename allocator_type::size_type size_type;
31 typedef typename allocator_type::difference_type difference_type;
32 typedef typename allocator_type::pointer pointer;
33 typedef typename allocator_type::const_pointer const_pointer;
34 typedef std::reverse_iterator<iterator> reverse_iterator;
35 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
38 noexcept(is_nothrow_default_constructible<allocator_type>::value);
39 explicit vector(const allocator_type&);
40 explicit vector(size_type n);
41 vector(size_type n, const value_type& value, const allocator_type& = allocator_type());
42 template <class InputIterator>
43 vector(InputIterator first, InputIterator last, const allocator_type& = allocator_type());
44 vector(const vector& x);
46 noexcept(is_nothrow_move_constructible<allocator_type>::value);
47 vector(initializer_list<value_type> il);
48 vector(initializer_list<value_type> il, const allocator_type& a);
50 vector& operator=(const vector& x);
51 vector& operator=(vector&& x)
53 allocator_type::propagate_on_container_move_assignment::value &&
54 is_nothrow_move_assignable<allocator_type>::value);
55 vector& operator=(initializer_list<value_type> il);
56 template <class InputIterator>
57 void assign(InputIterator first, InputIterator last);
58 void assign(size_type n, const value_type& u);
59 void assign(initializer_list<value_type> il);
61 allocator_type get_allocator() const noexcept;
63 iterator begin() noexcept;
64 const_iterator begin() const noexcept;
65 iterator end() noexcept;
66 const_iterator end() const noexcept;
68 reverse_iterator rbegin() noexcept;
69 const_reverse_iterator rbegin() const noexcept;
70 reverse_iterator rend() noexcept;
71 const_reverse_iterator rend() const noexcept;
73 const_iterator cbegin() const noexcept;
74 const_iterator cend() const noexcept;
75 const_reverse_iterator crbegin() const noexcept;
76 const_reverse_iterator crend() const noexcept;
78 size_type size() const noexcept;
79 size_type max_size() const noexcept;
80 size_type capacity() const noexcept;
81 bool empty() const noexcept;
82 void reserve(size_type n);
83 void shrink_to_fit() noexcept;
85 reference operator[](size_type n);
86 const_reference operator[](size_type n) const;
87 reference at(size_type n);
88 const_reference at(size_type n) const;
91 const_reference front() const;
93 const_reference back() const;
95 value_type* data() noexcept;
96 const value_type* data() const noexcept;
98 void push_back(const value_type& x);
99 void push_back(value_type&& x);
100 template <class... Args>
101 void emplace_back(Args&&... args);
104 template <class... Args> iterator emplace(const_iterator position, Args&&... args);
105 iterator insert(const_iterator position, const value_type& x);
106 iterator insert(const_iterator position, value_type&& x);
107 iterator insert(const_iterator position, size_type n, const value_type& x);
108 template <class InputIterator>
109 iterator insert(const_iterator position, InputIterator first, InputIterator last);
110 iterator insert(const_iterator position, initializer_list<value_type> il);
112 iterator erase(const_iterator position);
113 iterator erase(const_iterator first, const_iterator last);
115 void clear() noexcept;
117 void resize(size_type sz);
118 void resize(size_type sz, const value_type& c);
121 noexcept(!allocator_type::propagate_on_container_swap::value ||
122 __is_nothrow_swappable<allocator_type>::value);
124 bool __invariants() const;
127 template <class Allocator = allocator<T> >
128 class vector<bool, Allocator>
131 typedef bool value_type;
132 typedef Allocator allocator_type;
133 typedef implementation-defined iterator;
134 typedef implementation-defined const_iterator;
135 typedef typename allocator_type::size_type size_type;
136 typedef typename allocator_type::difference_type difference_type;
137 typedef iterator pointer;
138 typedef const_iterator const_pointer;
139 typedef std::reverse_iterator<iterator> reverse_iterator;
140 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
145 reference(const reference&) noexcept;
146 operator bool() const noexcept;
147 reference& operator=(const bool x) noexcept;
148 reference& operator=(const reference& x) noexcept;
149 iterator operator&() const noexcept;
150 void flip() noexcept;
153 class const_reference
156 const_reference(const reference&) noexcept;
157 operator bool() const noexcept;
158 const_iterator operator&() const noexcept;
162 noexcept(is_nothrow_default_constructible<allocator_type>::value);
163 explicit vector(const allocator_type&);
164 explicit vector(size_type n, const value_type& value = value_type(), const allocator_type& = allocator_type());
165 template <class InputIterator>
166 vector(InputIterator first, InputIterator last, const allocator_type& = allocator_type());
167 vector(const vector& x);
169 noexcept(is_nothrow_move_constructible<allocator_type>::value);
170 vector(initializer_list<value_type> il);
171 vector(initializer_list<value_type> il, const allocator_type& a);
173 vector& operator=(const vector& x);
174 vector& operator=(vector&& x)
176 allocator_type::propagate_on_container_move_assignment::value &&
177 is_nothrow_move_assignable<allocator_type>::value);
178 vector& operator=(initializer_list<value_type> il);
179 template <class InputIterator>
180 void assign(InputIterator first, InputIterator last);
181 void assign(size_type n, const value_type& u);
182 void assign(initializer_list<value_type> il);
184 allocator_type get_allocator() const noexcept;
186 iterator begin() noexcept;
187 const_iterator begin() const noexcept;
188 iterator end() noexcept;
189 const_iterator end() const noexcept;
191 reverse_iterator rbegin() noexcept;
192 const_reverse_iterator rbegin() const noexcept;
193 reverse_iterator rend() noexcept;
194 const_reverse_iterator rend() const noexcept;
196 const_iterator cbegin() const noexcept;
197 const_iterator cend() const noexcept;
198 const_reverse_iterator crbegin() const noexcept;
199 const_reverse_iterator crend() const noexcept;
201 size_type size() const noexcept;
202 size_type max_size() const noexcept;
203 size_type capacity() const noexcept;
204 bool empty() const noexcept;
205 void reserve(size_type n);
206 void shrink_to_fit() noexcept;
208 reference operator[](size_type n);
209 const_reference operator[](size_type n) const;
210 reference at(size_type n);
211 const_reference at(size_type n) const;
214 const_reference front() const;
216 const_reference back() const;
218 void push_back(const value_type& x);
221 iterator insert(const_iterator position, const value_type& x);
222 iterator insert(const_iterator position, size_type n, const value_type& x);
223 template <class InputIterator>
224 iterator insert(const_iterator position, InputIterator first, InputIterator last);
225 iterator insert(const_iterator position, initializer_list<value_type> il);
227 iterator erase(const_iterator position);
228 iterator erase(const_iterator first, const_iterator last);
230 void clear() noexcept;
232 void resize(size_type sz);
233 void resize(size_type sz, value_type x);
236 noexcept(!allocator_type::propagate_on_container_swap::value ||
237 __is_nothrow_swappable<allocator_type>::value);
238 void flip() noexcept;
240 bool __invariants() const;
243 template <class Allocator> struct hash<std::vector<bool, Allocator>>;
245 template <class T, class Allocator> bool operator==(const vector<T,Allocator>& x, const vector<T,Allocator>& y);
246 template <class T, class Allocator> bool operator< (const vector<T,Allocator>& x, const vector<T,Allocator>& y);
247 template <class T, class Allocator> bool operator!=(const vector<T,Allocator>& x, const vector<T,Allocator>& y);
248 template <class T, class Allocator> bool operator> (const vector<T,Allocator>& x, const vector<T,Allocator>& y);
249 template <class T, class Allocator> bool operator>=(const vector<T,Allocator>& x, const vector<T,Allocator>& y);
250 template <class T, class Allocator> bool operator<=(const vector<T,Allocator>& x, const vector<T,Allocator>& y);
252 template <class T, class Allocator>
253 void swap(vector<T,Allocator>& x, vector<T,Allocator>& y)
254 noexcept(noexcept(x.swap(y)));
261 #include <__bit_reference>
262 #include <type_traits>
265 #include <initializer_list>
270 #include <__split_buffer>
271 #include <__functional_base>
273 #include <__undef_min_max>
275 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
276 #pragma GCC system_header
279 _LIBCPP_BEGIN_NAMESPACE_STD
282 class __vector_base_common
285 _LIBCPP_ALWAYS_INLINE __vector_base_common() {}
286 void __throw_length_error() const;
287 void __throw_out_of_range() const;
292 __vector_base_common<__b>::__throw_length_error() const
294 #ifndef _LIBCPP_NO_EXCEPTIONS
295 throw length_error("vector");
297 assert(!"vector length_error");
303 __vector_base_common<__b>::__throw_out_of_range() const
305 #ifndef _LIBCPP_NO_EXCEPTIONS
306 throw out_of_range("vector");
308 assert(!"vector out_of_range");
313 #pragma warning( push )
314 #pragma warning( disable: 4231 )
316 extern template class __vector_base_common<true>;
318 #pragma warning( pop )
321 template <class _Tp, class _Allocator>
323 : protected __vector_base_common<true>
326 typedef _Tp value_type;
327 typedef _Allocator allocator_type;
328 typedef allocator_traits<allocator_type> __alloc_traits;
329 typedef value_type& reference;
330 typedef const value_type& const_reference;
331 typedef typename __alloc_traits::size_type size_type;
332 typedef typename __alloc_traits::difference_type difference_type;
333 typedef typename __alloc_traits::pointer pointer;
334 typedef typename __alloc_traits::const_pointer const_pointer;
335 typedef pointer iterator;
336 typedef const_pointer const_iterator;
340 __compressed_pair<pointer, allocator_type> __end_cap_;
342 _LIBCPP_INLINE_VISIBILITY
343 allocator_type& __alloc() _NOEXCEPT
344 {return __end_cap_.second();}
345 _LIBCPP_INLINE_VISIBILITY
346 const allocator_type& __alloc() const _NOEXCEPT
347 {return __end_cap_.second();}
348 _LIBCPP_INLINE_VISIBILITY
349 pointer& __end_cap() _NOEXCEPT
350 {return __end_cap_.first();}
351 _LIBCPP_INLINE_VISIBILITY
352 const pointer& __end_cap() const _NOEXCEPT
353 {return __end_cap_.first();}
355 _LIBCPP_INLINE_VISIBILITY
357 _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value);
358 _LIBCPP_INLINE_VISIBILITY __vector_base(const allocator_type& __a);
361 _LIBCPP_INLINE_VISIBILITY
362 void clear() _NOEXCEPT {__destruct_at_end(__begin_);}
363 _LIBCPP_INLINE_VISIBILITY
364 size_type capacity() const _NOEXCEPT
365 {return static_cast<size_type>(__end_cap() - __begin_);}
367 _LIBCPP_INLINE_VISIBILITY
368 void __destruct_at_end(const_pointer __new_last) _NOEXCEPT
369 {__destruct_at_end(__new_last, false_type());}
370 _LIBCPP_INLINE_VISIBILITY
371 void __destruct_at_end(const_pointer __new_last, false_type) _NOEXCEPT;
372 _LIBCPP_INLINE_VISIBILITY
373 void __destruct_at_end(const_pointer __new_last, true_type) _NOEXCEPT;
375 _LIBCPP_INLINE_VISIBILITY
376 void __copy_assign_alloc(const __vector_base& __c)
377 {__copy_assign_alloc(__c, integral_constant<bool,
378 __alloc_traits::propagate_on_container_copy_assignment::value>());}
380 _LIBCPP_INLINE_VISIBILITY
381 void __move_assign_alloc(__vector_base& __c)
383 !__alloc_traits::propagate_on_container_move_assignment::value ||
384 is_nothrow_move_assignable<allocator_type>::value)
385 {__move_assign_alloc(__c, integral_constant<bool,
386 __alloc_traits::propagate_on_container_move_assignment::value>());}
388 _LIBCPP_INLINE_VISIBILITY
389 static void __swap_alloc(allocator_type& __x, allocator_type& __y)
391 !__alloc_traits::propagate_on_container_swap::value ||
392 __is_nothrow_swappable<allocator_type>::value)
393 {__swap_alloc(__x, __y, integral_constant<bool,
394 __alloc_traits::propagate_on_container_swap::value>());}
396 _LIBCPP_INLINE_VISIBILITY
397 void __copy_assign_alloc(const __vector_base& __c, true_type)
399 if (__alloc() != __c.__alloc())
402 __alloc_traits::deallocate(__alloc(), __begin_, capacity());
403 __begin_ = __end_ = __end_cap() = nullptr;
405 __alloc() = __c.__alloc();
408 _LIBCPP_INLINE_VISIBILITY
409 void __copy_assign_alloc(const __vector_base&, false_type)
412 _LIBCPP_INLINE_VISIBILITY
413 void __move_assign_alloc(__vector_base& __c, true_type)
414 _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
416 __alloc() = _VSTD::move(__c.__alloc());
419 _LIBCPP_INLINE_VISIBILITY
420 void __move_assign_alloc(__vector_base&, false_type)
424 _LIBCPP_INLINE_VISIBILITY
425 static void __swap_alloc(allocator_type& __x, allocator_type& __y, true_type)
426 _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
431 _LIBCPP_INLINE_VISIBILITY
432 static void __swap_alloc(allocator_type&, allocator_type&, false_type)
437 template <class _Tp, class _Allocator>
438 _LIBCPP_INLINE_VISIBILITY inline
440 __vector_base<_Tp, _Allocator>::__destruct_at_end(const_pointer __new_last, false_type) _NOEXCEPT
442 while (__new_last != __end_)
443 __alloc_traits::destroy(__alloc(), const_cast<pointer>(--__end_));
446 template <class _Tp, class _Allocator>
447 _LIBCPP_INLINE_VISIBILITY inline
449 __vector_base<_Tp, _Allocator>::__destruct_at_end(const_pointer __new_last, true_type) _NOEXCEPT
451 __end_ = const_cast<pointer>(__new_last);
454 template <class _Tp, class _Allocator>
455 _LIBCPP_INLINE_VISIBILITY inline
456 __vector_base<_Tp, _Allocator>::__vector_base()
457 _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value)
464 template <class _Tp, class _Allocator>
465 _LIBCPP_INLINE_VISIBILITY inline
466 __vector_base<_Tp, _Allocator>::__vector_base(const allocator_type& __a)
473 template <class _Tp, class _Allocator>
474 __vector_base<_Tp, _Allocator>::~__vector_base()
479 __alloc_traits::deallocate(__alloc(), __begin_, capacity());
483 template <class _Tp, class _Allocator = allocator<_Tp> >
484 class _LIBCPP_VISIBLE vector
485 : private __vector_base<_Tp, _Allocator>
488 typedef __vector_base<_Tp, _Allocator> __base;
490 typedef vector __self;
491 typedef _Tp value_type;
492 typedef _Allocator allocator_type;
493 typedef typename __base::__alloc_traits __alloc_traits;
494 typedef typename __base::reference reference;
495 typedef typename __base::const_reference const_reference;
496 typedef typename __base::size_type size_type;
497 typedef typename __base::difference_type difference_type;
498 typedef typename __base::pointer pointer;
499 typedef typename __base::const_pointer const_pointer;
500 typedef __wrap_iter<pointer> iterator;
501 typedef __wrap_iter<const_pointer> const_iterator;
502 typedef _VSTD::reverse_iterator<iterator> reverse_iterator;
503 typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
505 _LIBCPP_INLINE_VISIBILITY
507 _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value)
509 #if _LIBCPP_DEBUG_LEVEL >= 2
510 __get_db()->__insert_c(this);
513 _LIBCPP_INLINE_VISIBILITY explicit vector(const allocator_type& __a)
516 #if _LIBCPP_DEBUG_LEVEL >= 2
517 __get_db()->__insert_c(this);
520 explicit vector(size_type __n);
521 vector(size_type __n, const_reference __x);
522 vector(size_type __n, const_reference __x, const allocator_type& __a);
523 template <class _InputIterator>
524 vector(_InputIterator __first, _InputIterator __last,
525 typename enable_if<__is_input_iterator <_InputIterator>::value &&
526 !__is_forward_iterator<_InputIterator>::value>::type* = 0);
527 template <class _InputIterator>
528 vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a,
529 typename enable_if<__is_input_iterator <_InputIterator>::value &&
530 !__is_forward_iterator<_InputIterator>::value>::type* = 0);
531 template <class _ForwardIterator>
532 vector(_ForwardIterator __first, _ForwardIterator __last,
533 typename enable_if<__is_forward_iterator<_ForwardIterator>::value>::type* = 0);
534 template <class _ForwardIterator>
535 vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a,
536 typename enable_if<__is_forward_iterator<_ForwardIterator>::value>::type* = 0);
537 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
538 _LIBCPP_INLINE_VISIBILITY
539 vector(initializer_list<value_type> __il);
540 _LIBCPP_INLINE_VISIBILITY
541 vector(initializer_list<value_type> __il, const allocator_type& __a);
542 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
543 #if _LIBCPP_DEBUG_LEVEL >= 2
544 _LIBCPP_INLINE_VISIBILITY
547 __get_db()->__erase_c(this);
551 vector(const vector& __x);
552 vector(const vector& __x, const allocator_type& __a);
553 _LIBCPP_INLINE_VISIBILITY
554 vector& operator=(const vector& __x);
555 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
556 _LIBCPP_INLINE_VISIBILITY
558 _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value);
559 _LIBCPP_INLINE_VISIBILITY
560 vector(vector&& __x, const allocator_type& __a);
561 _LIBCPP_INLINE_VISIBILITY
562 vector& operator=(vector&& __x)
564 __alloc_traits::propagate_on_container_move_assignment::value &&
565 is_nothrow_move_assignable<allocator_type>::value);
566 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
567 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
568 _LIBCPP_INLINE_VISIBILITY
569 vector& operator=(initializer_list<value_type> __il)
570 {assign(__il.begin(), __il.end()); return *this;}
571 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
573 template <class _InputIterator>
576 __is_input_iterator <_InputIterator>::value &&
577 !__is_forward_iterator<_InputIterator>::value,
580 assign(_InputIterator __first, _InputIterator __last);
581 template <class _ForwardIterator>
584 __is_forward_iterator<_ForwardIterator>::value,
587 assign(_ForwardIterator __first, _ForwardIterator __last);
589 void assign(size_type __n, const_reference __u);
590 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
591 _LIBCPP_INLINE_VISIBILITY
592 void assign(initializer_list<value_type> __il)
593 {assign(__il.begin(), __il.end());}
594 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
596 _LIBCPP_INLINE_VISIBILITY
597 allocator_type get_allocator() const _NOEXCEPT
598 {return this->__alloc();}
600 _LIBCPP_INLINE_VISIBILITY iterator begin() _NOEXCEPT;
601 _LIBCPP_INLINE_VISIBILITY const_iterator begin() const _NOEXCEPT;
602 _LIBCPP_INLINE_VISIBILITY iterator end() _NOEXCEPT;
603 _LIBCPP_INLINE_VISIBILITY const_iterator end() const _NOEXCEPT;
605 _LIBCPP_INLINE_VISIBILITY
606 reverse_iterator rbegin() _NOEXCEPT
607 {return reverse_iterator(end());}
608 _LIBCPP_INLINE_VISIBILITY
609 const_reverse_iterator rbegin() const _NOEXCEPT
610 {return const_reverse_iterator(end());}
611 _LIBCPP_INLINE_VISIBILITY
612 reverse_iterator rend() _NOEXCEPT
613 {return reverse_iterator(begin());}
614 _LIBCPP_INLINE_VISIBILITY
615 const_reverse_iterator rend() const _NOEXCEPT
616 {return const_reverse_iterator(begin());}
618 _LIBCPP_INLINE_VISIBILITY
619 const_iterator cbegin() const _NOEXCEPT
621 _LIBCPP_INLINE_VISIBILITY
622 const_iterator cend() const _NOEXCEPT
624 _LIBCPP_INLINE_VISIBILITY
625 const_reverse_iterator crbegin() const _NOEXCEPT
627 _LIBCPP_INLINE_VISIBILITY
628 const_reverse_iterator crend() const _NOEXCEPT
631 _LIBCPP_INLINE_VISIBILITY
632 size_type size() const _NOEXCEPT
633 {return static_cast<size_type>(this->__end_ - this->__begin_);}
634 _LIBCPP_INLINE_VISIBILITY
635 size_type capacity() const _NOEXCEPT
636 {return __base::capacity();}
637 _LIBCPP_INLINE_VISIBILITY
638 bool empty() const _NOEXCEPT
639 {return this->__begin_ == this->__end_;}
640 size_type max_size() const _NOEXCEPT;
641 void reserve(size_type __n);
642 void shrink_to_fit() _NOEXCEPT;
644 _LIBCPP_INLINE_VISIBILITY reference operator[](size_type __n);
645 _LIBCPP_INLINE_VISIBILITY const_reference operator[](size_type __n) const;
646 reference at(size_type __n);
647 const_reference at(size_type __n) const;
649 _LIBCPP_INLINE_VISIBILITY reference front()
651 _LIBCPP_ASSERT(!empty(), "front() called for empty vector");
652 return *this->__begin_;
654 _LIBCPP_INLINE_VISIBILITY const_reference front() const
656 _LIBCPP_ASSERT(!empty(), "front() called for empty vector");
657 return *this->__begin_;
659 _LIBCPP_INLINE_VISIBILITY reference back()
661 _LIBCPP_ASSERT(!empty(), "back() called for empty vector");
662 return *(this->__end_ - 1);
664 _LIBCPP_INLINE_VISIBILITY const_reference back() const
666 _LIBCPP_ASSERT(!empty(), "back() called for empty vector");
667 return *(this->__end_ - 1);
670 _LIBCPP_INLINE_VISIBILITY
671 value_type* data() _NOEXCEPT
672 {return _VSTD::__to_raw_pointer(this->__begin_);}
673 _LIBCPP_INLINE_VISIBILITY
674 const value_type* data() const _NOEXCEPT
675 {return _VSTD::__to_raw_pointer(this->__begin_);}
677 _LIBCPP_INLINE_VISIBILITY void push_back(const_reference __x);
678 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
679 _LIBCPP_INLINE_VISIBILITY void push_back(value_type&& __x);
680 #ifndef _LIBCPP_HAS_NO_VARIADICS
681 template <class... _Args>
682 void emplace_back(_Args&&... __args);
683 #endif // _LIBCPP_HAS_NO_VARIADICS
684 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
687 iterator insert(const_iterator __position, const_reference __x);
688 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
689 iterator insert(const_iterator __position, value_type&& __x);
690 #ifndef _LIBCPP_HAS_NO_VARIADICS
691 template <class... _Args>
692 iterator emplace(const_iterator __position, _Args&&... __args);
693 #endif // _LIBCPP_HAS_NO_VARIADICS
694 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
695 iterator insert(const_iterator __position, size_type __n, const_reference __x);
696 template <class _InputIterator>
699 __is_input_iterator <_InputIterator>::value &&
700 !__is_forward_iterator<_InputIterator>::value,
703 insert(const_iterator __position, _InputIterator __first, _InputIterator __last);
704 template <class _ForwardIterator>
707 __is_forward_iterator<_ForwardIterator>::value,
710 insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last);
711 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
712 _LIBCPP_INLINE_VISIBILITY
713 iterator insert(const_iterator __position, initializer_list<value_type> __il)
714 {return insert(__position, __il.begin(), __il.end());}
715 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
717 _LIBCPP_INLINE_VISIBILITY iterator erase(const_iterator __position);
718 iterator erase(const_iterator __first, const_iterator __last);
720 _LIBCPP_INLINE_VISIBILITY
721 void clear() _NOEXCEPT
724 __invalidate_all_iterators();
727 void resize(size_type __sz);
728 void resize(size_type __sz, const_reference __x);
731 _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value ||
732 __is_nothrow_swappable<allocator_type>::value);
734 bool __invariants() const;
736 #if _LIBCPP_DEBUG_LEVEL >= 2
738 bool __dereferenceable(const const_iterator* __i) const;
739 bool __decrementable(const const_iterator* __i) const;
740 bool __addable(const const_iterator* __i, ptrdiff_t __n) const;
741 bool __subscriptable(const const_iterator* __i, ptrdiff_t __n) const;
743 #endif // _LIBCPP_DEBUG_LEVEL >= 2
746 _LIBCPP_INLINE_VISIBILITY void __invalidate_all_iterators();
747 void allocate(size_type __n);
748 void deallocate() _NOEXCEPT;
749 _LIBCPP_INLINE_VISIBILITY size_type __recommend(size_type __new_size) const;
750 void __construct_at_end(size_type __n);
751 void __construct_at_end(size_type __n, const_reference __x);
752 template <class _ForwardIterator>
755 __is_forward_iterator<_ForwardIterator>::value,
758 __construct_at_end(_ForwardIterator __first, _ForwardIterator __last);
759 void __move_construct_at_end(pointer __first, pointer __last);
760 void __append(size_type __n);
761 void __append(size_type __n, const_reference __x);
762 _LIBCPP_INLINE_VISIBILITY
763 iterator __make_iter(pointer __p) _NOEXCEPT;
764 _LIBCPP_INLINE_VISIBILITY
765 const_iterator __make_iter(const_pointer __p) const _NOEXCEPT;
766 void __swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v);
767 pointer __swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v, pointer __p);
768 void __move_range(pointer __from_s, pointer __from_e, pointer __to);
769 void __move_assign(vector& __c, true_type)
770 _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value);
771 void __move_assign(vector& __c, false_type);
772 _LIBCPP_INLINE_VISIBILITY
773 void __destruct_at_end(const_pointer __new_last) _NOEXCEPT
775 #if _LIBCPP_DEBUG_LEVEL >= 2
776 __c_node* __c = __get_db()->__find_c_and_lock(this);
777 for (__i_node** __p = __c->end_; __p != __c->beg_; )
780 const_iterator* __i = static_cast<const_iterator*>((*__p)->__i_);
781 if (__i->base() > __new_last)
783 (*__p)->__c_ = nullptr;
784 if (--__c->end_ != __p)
785 memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
788 __get_db()->unlock();
790 __base::__destruct_at_end(__new_last);
794 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
795 __push_back_slow_path(_Up&& __x);
797 __push_back_slow_path(_Up& __x);
799 #if !defined(_LIBCPP_HAS_NO_VARIADICS) && !defined(_LIBCPP_HAS_NO_RVALUE_REFERENCES)
800 template <class... _Args>
802 __emplace_back_slow_path(_Args&&... __args);
806 template <class _Tp, class _Allocator>
808 vector<_Tp, _Allocator>::__swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v)
810 __alloc_traits::__construct_backward(this->__alloc(), this->__begin_, this->__end_, __v.__begin_);
811 _VSTD::swap(this->__begin_, __v.__begin_);
812 _VSTD::swap(this->__end_, __v.__end_);
813 _VSTD::swap(this->__end_cap(), __v.__end_cap());
814 __v.__first_ = __v.__begin_;
815 __invalidate_all_iterators();
818 template <class _Tp, class _Allocator>
819 typename vector<_Tp, _Allocator>::pointer
820 vector<_Tp, _Allocator>::__swap_out_circular_buffer(__split_buffer<value_type, allocator_type&>& __v, pointer __p)
822 pointer __r = __v.__begin_;
823 __alloc_traits::__construct_backward(this->__alloc(), this->__begin_, __p, __v.__begin_);
824 __alloc_traits::__construct_forward(this->__alloc(), __p, this->__end_, __v.__end_);
825 _VSTD::swap(this->__begin_, __v.__begin_);
826 _VSTD::swap(this->__end_, __v.__end_);
827 _VSTD::swap(this->__end_cap(), __v.__end_cap());
828 __v.__first_ = __v.__begin_;
829 __invalidate_all_iterators();
833 // Allocate space for __n objects
834 // throws length_error if __n > max_size()
835 // throws (probably bad_alloc) if memory run out
836 // Precondition: __begin_ == __end_ == __end_cap() == 0
837 // Precondition: __n > 0
838 // Postcondition: capacity() == __n
839 // Postcondition: size() == 0
840 template <class _Tp, class _Allocator>
842 vector<_Tp, _Allocator>::allocate(size_type __n)
844 if (__n > max_size())
845 this->__throw_length_error();
846 this->__begin_ = this->__end_ = __alloc_traits::allocate(this->__alloc(), __n);
847 this->__end_cap() = this->__begin_ + __n;
850 template <class _Tp, class _Allocator>
852 vector<_Tp, _Allocator>::deallocate() _NOEXCEPT
854 if (this->__begin_ != 0)
857 __alloc_traits::deallocate(this->__alloc(), this->__begin_, capacity());
858 this->__begin_ = this->__end_ = this->__end_cap() = 0;
862 template <class _Tp, class _Allocator>
863 typename vector<_Tp, _Allocator>::size_type
864 vector<_Tp, _Allocator>::max_size() const _NOEXCEPT
866 return _VSTD::min<size_type>(__alloc_traits::max_size(this->__alloc()), numeric_limits<size_type>::max() / 2); // end() >= begin(), always
869 // Precondition: __new_size > capacity()
870 template <class _Tp, class _Allocator>
871 _LIBCPP_INLINE_VISIBILITY inline
872 typename vector<_Tp, _Allocator>::size_type
873 vector<_Tp, _Allocator>::__recommend(size_type __new_size) const
875 const size_type __ms = max_size();
876 if (__new_size > __ms)
877 this->__throw_length_error();
878 const size_type __cap = capacity();
879 if (__cap >= __ms / 2)
881 return _VSTD::max<size_type>(2*__cap, __new_size);
884 // Default constructs __n objects starting at __end_
885 // throws if construction throws
886 // Precondition: __n > 0
887 // Precondition: size() + __n <= capacity()
888 // Postcondition: size() == size() + __n
889 template <class _Tp, class _Allocator>
891 vector<_Tp, _Allocator>::__construct_at_end(size_type __n)
893 allocator_type& __a = this->__alloc();
896 __alloc_traits::construct(__a, _VSTD::__to_raw_pointer(this->__end_));
902 // Copy constructs __n objects starting at __end_ from __x
903 // throws if construction throws
904 // Precondition: __n > 0
905 // Precondition: size() + __n <= capacity()
906 // Postcondition: size() == old size() + __n
907 // Postcondition: [i] == __x for all i in [size() - __n, __n)
908 template <class _Tp, class _Allocator>
909 _LIBCPP_INLINE_VISIBILITY inline
911 vector<_Tp, _Allocator>::__construct_at_end(size_type __n, const_reference __x)
913 allocator_type& __a = this->__alloc();
916 __alloc_traits::construct(__a, _VSTD::__to_raw_pointer(this->__end_), __x);
922 template <class _Tp, class _Allocator>
923 template <class _ForwardIterator>
926 __is_forward_iterator<_ForwardIterator>::value,
929 vector<_Tp, _Allocator>::__construct_at_end(_ForwardIterator __first, _ForwardIterator __last)
931 allocator_type& __a = this->__alloc();
932 for (; __first != __last; ++__first)
934 __alloc_traits::construct(__a, _VSTD::__to_raw_pointer(this->__end_), *__first);
939 template <class _Tp, class _Allocator>
941 vector<_Tp, _Allocator>::__move_construct_at_end(pointer __first, pointer __last)
943 allocator_type& __a = this->__alloc();
944 for (; __first != __last; ++__first)
946 __alloc_traits::construct(__a, _VSTD::__to_raw_pointer(this->__end_),
947 _VSTD::move(*__first));
952 // Default constructs __n objects starting at __end_
953 // throws if construction throws
954 // Postcondition: size() == size() + __n
955 // Exception safety: strong.
956 template <class _Tp, class _Allocator>
958 vector<_Tp, _Allocator>::__append(size_type __n)
960 if (static_cast<size_type>(this->__end_cap() - this->__end_) >= __n)
961 this->__construct_at_end(__n);
964 allocator_type& __a = this->__alloc();
965 __split_buffer<value_type, allocator_type&> __v(__recommend(size() + __n), size(), __a);
966 __v.__construct_at_end(__n);
967 __swap_out_circular_buffer(__v);
971 // Default constructs __n objects starting at __end_
972 // throws if construction throws
973 // Postcondition: size() == size() + __n
974 // Exception safety: strong.
975 template <class _Tp, class _Allocator>
977 vector<_Tp, _Allocator>::__append(size_type __n, const_reference __x)
979 if (static_cast<size_type>(this->__end_cap() - this->__end_) >= __n)
980 this->__construct_at_end(__n, __x);
983 allocator_type& __a = this->__alloc();
984 __split_buffer<value_type, allocator_type&> __v(__recommend(size() + __n), size(), __a);
985 __v.__construct_at_end(__n, __x);
986 __swap_out_circular_buffer(__v);
990 template <class _Tp, class _Allocator>
991 vector<_Tp, _Allocator>::vector(size_type __n)
993 #if _LIBCPP_DEBUG_LEVEL >= 2
994 __get_db()->__insert_c(this);
999 __construct_at_end(__n);
1003 template <class _Tp, class _Allocator>
1004 vector<_Tp, _Allocator>::vector(size_type __n, const_reference __x)
1006 #if _LIBCPP_DEBUG_LEVEL >= 2
1007 __get_db()->__insert_c(this);
1012 __construct_at_end(__n, __x);
1016 template <class _Tp, class _Allocator>
1017 vector<_Tp, _Allocator>::vector(size_type __n, const_reference __x, const allocator_type& __a)
1020 #if _LIBCPP_DEBUG_LEVEL >= 2
1021 __get_db()->__insert_c(this);
1026 __construct_at_end(__n, __x);
1030 template <class _Tp, class _Allocator>
1031 template <class _InputIterator>
1032 vector<_Tp, _Allocator>::vector(_InputIterator __first, _InputIterator __last,
1033 typename enable_if<__is_input_iterator <_InputIterator>::value &&
1034 !__is_forward_iterator<_InputIterator>::value>::type*)
1036 #if _LIBCPP_DEBUG_LEVEL >= 2
1037 __get_db()->__insert_c(this);
1039 for (; __first != __last; ++__first)
1040 push_back(*__first);
1043 template <class _Tp, class _Allocator>
1044 template <class _InputIterator>
1045 vector<_Tp, _Allocator>::vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a,
1046 typename enable_if<__is_input_iterator <_InputIterator>::value &&
1047 !__is_forward_iterator<_InputIterator>::value>::type*)
1050 #if _LIBCPP_DEBUG_LEVEL >= 2
1051 __get_db()->__insert_c(this);
1053 for (; __first != __last; ++__first)
1054 push_back(*__first);
1057 template <class _Tp, class _Allocator>
1058 template <class _ForwardIterator>
1059 vector<_Tp, _Allocator>::vector(_ForwardIterator __first, _ForwardIterator __last,
1060 typename enable_if<__is_forward_iterator<_ForwardIterator>::value>::type*)
1062 #if _LIBCPP_DEBUG_LEVEL >= 2
1063 __get_db()->__insert_c(this);
1065 size_type __n = static_cast<size_type>(_VSTD::distance(__first, __last));
1069 __construct_at_end(__first, __last);
1073 template <class _Tp, class _Allocator>
1074 template <class _ForwardIterator>
1075 vector<_Tp, _Allocator>::vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a,
1076 typename enable_if<__is_forward_iterator<_ForwardIterator>::value>::type*)
1079 #if _LIBCPP_DEBUG_LEVEL >= 2
1080 __get_db()->__insert_c(this);
1082 size_type __n = static_cast<size_type>(_VSTD::distance(__first, __last));
1086 __construct_at_end(__first, __last);
1090 template <class _Tp, class _Allocator>
1091 vector<_Tp, _Allocator>::vector(const vector& __x)
1092 : __base(__alloc_traits::select_on_container_copy_construction(__x.__alloc()))
1094 #if _LIBCPP_DEBUG_LEVEL >= 2
1095 __get_db()->__insert_c(this);
1097 size_type __n = __x.size();
1101 __construct_at_end(__x.__begin_, __x.__end_);
1105 template <class _Tp, class _Allocator>
1106 vector<_Tp, _Allocator>::vector(const vector& __x, const allocator_type& __a)
1109 #if _LIBCPP_DEBUG_LEVEL >= 2
1110 __get_db()->__insert_c(this);
1112 size_type __n = __x.size();
1116 __construct_at_end(__x.__begin_, __x.__end_);
1120 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
1122 template <class _Tp, class _Allocator>
1123 _LIBCPP_INLINE_VISIBILITY inline
1124 vector<_Tp, _Allocator>::vector(vector&& __x)
1125 _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value)
1126 : __base(_VSTD::move(__x.__alloc()))
1128 #if _LIBCPP_DEBUG_LEVEL >= 2
1129 __get_db()->__insert_c(this);
1130 __get_db()->swap(this, &__x);
1132 this->__begin_ = __x.__begin_;
1133 this->__end_ = __x.__end_;
1134 this->__end_cap() = __x.__end_cap();
1135 __x.__begin_ = __x.__end_ = __x.__end_cap() = 0;
1138 template <class _Tp, class _Allocator>
1139 _LIBCPP_INLINE_VISIBILITY inline
1140 vector<_Tp, _Allocator>::vector(vector&& __x, const allocator_type& __a)
1143 #if _LIBCPP_DEBUG_LEVEL >= 2
1144 __get_db()->__insert_c(this);
1146 if (__a == __x.__alloc())
1148 this->__begin_ = __x.__begin_;
1149 this->__end_ = __x.__end_;
1150 this->__end_cap() = __x.__end_cap();
1151 __x.__begin_ = __x.__end_ = __x.__end_cap() = nullptr;
1152 #if _LIBCPP_DEBUG_LEVEL >= 2
1153 __get_db()->swap(this, &__x);
1158 typedef move_iterator<iterator> _Ip;
1159 assign(_Ip(__x.begin()), _Ip(__x.end()));
1163 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
1165 template <class _Tp, class _Allocator>
1166 _LIBCPP_INLINE_VISIBILITY inline
1167 vector<_Tp, _Allocator>::vector(initializer_list<value_type> __il)
1169 #if _LIBCPP_DEBUG_LEVEL >= 2
1170 __get_db()->__insert_c(this);
1172 if (__il.size() > 0)
1174 allocate(__il.size());
1175 __construct_at_end(__il.begin(), __il.end());
1179 template <class _Tp, class _Allocator>
1180 _LIBCPP_INLINE_VISIBILITY inline
1181 vector<_Tp, _Allocator>::vector(initializer_list<value_type> __il, const allocator_type& __a)
1184 #if _LIBCPP_DEBUG_LEVEL >= 2
1185 __get_db()->__insert_c(this);
1187 if (__il.size() > 0)
1189 allocate(__il.size());
1190 __construct_at_end(__il.begin(), __il.end());
1194 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
1196 template <class _Tp, class _Allocator>
1197 _LIBCPP_INLINE_VISIBILITY inline
1198 vector<_Tp, _Allocator>&
1199 vector<_Tp, _Allocator>::operator=(vector&& __x)
1201 __alloc_traits::propagate_on_container_move_assignment::value &&
1202 is_nothrow_move_assignable<allocator_type>::value)
1204 __move_assign(__x, integral_constant<bool,
1205 __alloc_traits::propagate_on_container_move_assignment::value>());
1209 template <class _Tp, class _Allocator>
1211 vector<_Tp, _Allocator>::__move_assign(vector& __c, false_type)
1213 if (__base::__alloc() != __c.__alloc())
1215 typedef move_iterator<iterator> _Ip;
1216 assign(_Ip(__c.begin()), _Ip(__c.end()));
1219 __move_assign(__c, true_type());
1222 template <class _Tp, class _Allocator>
1224 vector<_Tp, _Allocator>::__move_assign(vector& __c, true_type)
1225 _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
1228 this->__begin_ = __c.__begin_;
1229 this->__end_ = __c.__end_;
1230 this->__end_cap() = __c.__end_cap();
1231 __base::__move_assign_alloc(__c);
1232 __c.__begin_ = __c.__end_ = __c.__end_cap() = nullptr;
1233 #if _LIBCPP_DEBUG_LEVEL >= 2
1234 __get_db()->swap(this, &__c);
1238 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
1240 template <class _Tp, class _Allocator>
1241 _LIBCPP_INLINE_VISIBILITY inline
1242 vector<_Tp, _Allocator>&
1243 vector<_Tp, _Allocator>::operator=(const vector& __x)
1247 __base::__copy_assign_alloc(__x);
1248 assign(__x.__begin_, __x.__end_);
1253 template <class _Tp, class _Allocator>
1254 template <class _InputIterator>
1257 __is_input_iterator <_InputIterator>::value &&
1258 !__is_forward_iterator<_InputIterator>::value,
1261 vector<_Tp, _Allocator>::assign(_InputIterator __first, _InputIterator __last)
1264 for (; __first != __last; ++__first)
1265 push_back(*__first);
1268 template <class _Tp, class _Allocator>
1269 template <class _ForwardIterator>
1272 __is_forward_iterator<_ForwardIterator>::value,
1275 vector<_Tp, _Allocator>::assign(_ForwardIterator __first, _ForwardIterator __last)
1277 typename iterator_traits<_ForwardIterator>::difference_type __new_size = _VSTD::distance(__first, __last);
1278 if (static_cast<size_type>(__new_size) <= capacity())
1280 _ForwardIterator __mid = __last;
1281 bool __growing = false;
1282 if (static_cast<size_type>(__new_size) > size())
1286 _VSTD::advance(__mid, size());
1288 pointer __m = _VSTD::copy(__first, __mid, this->__begin_);
1290 __construct_at_end(__mid, __last);
1292 this->__destruct_at_end(__m);
1297 allocate(__recommend(static_cast<size_type>(__new_size)));
1298 __construct_at_end(__first, __last);
1302 template <class _Tp, class _Allocator>
1304 vector<_Tp, _Allocator>::assign(size_type __n, const_reference __u)
1306 if (__n <= capacity())
1308 size_type __s = size();
1309 _VSTD::fill_n(this->__begin_, _VSTD::min(__n, __s), __u);
1311 __construct_at_end(__n - __s, __u);
1313 this->__destruct_at_end(this->__begin_ + __n);
1318 allocate(__recommend(static_cast<size_type>(__n)));
1319 __construct_at_end(__n, __u);
1323 template <class _Tp, class _Allocator>
1324 _LIBCPP_INLINE_VISIBILITY inline
1325 typename vector<_Tp, _Allocator>::iterator
1326 vector<_Tp, _Allocator>::__make_iter(pointer __p) _NOEXCEPT
1328 #if _LIBCPP_DEBUG_LEVEL >= 2
1329 return iterator(this, __p);
1331 return iterator(__p);
1335 template <class _Tp, class _Allocator>
1336 _LIBCPP_INLINE_VISIBILITY inline
1337 typename vector<_Tp, _Allocator>::const_iterator
1338 vector<_Tp, _Allocator>::__make_iter(const_pointer __p) const _NOEXCEPT
1340 #if _LIBCPP_DEBUG_LEVEL >= 2
1341 return const_iterator(this, __p);
1343 return const_iterator(__p);
1347 template <class _Tp, class _Allocator>
1348 _LIBCPP_INLINE_VISIBILITY inline
1349 typename vector<_Tp, _Allocator>::iterator
1350 vector<_Tp, _Allocator>::begin() _NOEXCEPT
1352 return __make_iter(this->__begin_);
1355 template <class _Tp, class _Allocator>
1356 _LIBCPP_INLINE_VISIBILITY inline
1357 typename vector<_Tp, _Allocator>::const_iterator
1358 vector<_Tp, _Allocator>::begin() const _NOEXCEPT
1360 return __make_iter(this->__begin_);
1363 template <class _Tp, class _Allocator>
1364 _LIBCPP_INLINE_VISIBILITY inline
1365 typename vector<_Tp, _Allocator>::iterator
1366 vector<_Tp, _Allocator>::end() _NOEXCEPT
1368 return __make_iter(this->__end_);
1371 template <class _Tp, class _Allocator>
1372 _LIBCPP_INLINE_VISIBILITY inline
1373 typename vector<_Tp, _Allocator>::const_iterator
1374 vector<_Tp, _Allocator>::end() const _NOEXCEPT
1376 return __make_iter(this->__end_);
1379 template <class _Tp, class _Allocator>
1380 _LIBCPP_INLINE_VISIBILITY inline
1381 typename vector<_Tp, _Allocator>::reference
1382 vector<_Tp, _Allocator>::operator[](size_type __n)
1384 _LIBCPP_ASSERT(__n < size(), "vector[] index out of bounds");
1385 return this->__begin_[__n];
1388 template <class _Tp, class _Allocator>
1389 _LIBCPP_INLINE_VISIBILITY inline
1390 typename vector<_Tp, _Allocator>::const_reference
1391 vector<_Tp, _Allocator>::operator[](size_type __n) const
1393 _LIBCPP_ASSERT(__n < size(), "vector[] index out of bounds");
1394 return this->__begin_[__n];
1397 template <class _Tp, class _Allocator>
1398 typename vector<_Tp, _Allocator>::reference
1399 vector<_Tp, _Allocator>::at(size_type __n)
1402 this->__throw_out_of_range();
1403 return this->__begin_[__n];
1406 template <class _Tp, class _Allocator>
1407 typename vector<_Tp, _Allocator>::const_reference
1408 vector<_Tp, _Allocator>::at(size_type __n) const
1411 this->__throw_out_of_range();
1412 return this->__begin_[__n];
1415 template <class _Tp, class _Allocator>
1417 vector<_Tp, _Allocator>::reserve(size_type __n)
1419 if (__n > capacity())
1421 allocator_type& __a = this->__alloc();
1422 __split_buffer<value_type, allocator_type&> __v(__n, size(), __a);
1423 __swap_out_circular_buffer(__v);
1427 template <class _Tp, class _Allocator>
1429 vector<_Tp, _Allocator>::shrink_to_fit() _NOEXCEPT
1431 if (capacity() > size())
1433 #ifndef _LIBCPP_NO_EXCEPTIONS
1436 #endif // _LIBCPP_NO_EXCEPTIONS
1437 allocator_type& __a = this->__alloc();
1438 __split_buffer<value_type, allocator_type&> __v(size(), size(), __a);
1439 __swap_out_circular_buffer(__v);
1440 #ifndef _LIBCPP_NO_EXCEPTIONS
1445 #endif // _LIBCPP_NO_EXCEPTIONS
1449 template <class _Tp, class _Allocator>
1450 template <class _Up>
1452 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
1453 vector<_Tp, _Allocator>::__push_back_slow_path(_Up&& __x)
1455 vector<_Tp, _Allocator>::__push_back_slow_path(_Up& __x)
1458 allocator_type& __a = this->__alloc();
1459 __split_buffer<value_type, allocator_type&> __v(__recommend(size() + 1), size(), __a);
1460 // __v.push_back(_VSTD::forward<_Up>(__x));
1461 __alloc_traits::construct(__a, _VSTD::__to_raw_pointer(__v.__end_++), _VSTD::forward<_Up>(__x));
1462 __swap_out_circular_buffer(__v);
1465 template <class _Tp, class _Allocator>
1466 _LIBCPP_INLINE_VISIBILITY inline
1468 vector<_Tp, _Allocator>::push_back(const_reference __x)
1470 if (this->__end_ != this->__end_cap())
1472 __alloc_traits::construct(this->__alloc(),
1473 _VSTD::__to_raw_pointer(this->__end_), __x);
1477 __push_back_slow_path(__x);
1480 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
1482 template <class _Tp, class _Allocator>
1483 _LIBCPP_INLINE_VISIBILITY inline
1485 vector<_Tp, _Allocator>::push_back(value_type&& __x)
1487 if (this->__end_ < this->__end_cap())
1489 __alloc_traits::construct(this->__alloc(),
1490 _VSTD::__to_raw_pointer(this->__end_),
1495 __push_back_slow_path(_VSTD::move(__x));
1498 #ifndef _LIBCPP_HAS_NO_VARIADICS
1500 template <class _Tp, class _Allocator>
1501 template <class... _Args>
1503 vector<_Tp, _Allocator>::__emplace_back_slow_path(_Args&&... __args)
1505 allocator_type& __a = this->__alloc();
1506 __split_buffer<value_type, allocator_type&> __v(__recommend(size() + 1), size(), __a);
1507 // __v.emplace_back(_VSTD::forward<_Args>(__args)...);
1508 __alloc_traits::construct(__a, _VSTD::__to_raw_pointer(__v.__end_++), _VSTD::forward<_Args>(__args)...);
1509 __swap_out_circular_buffer(__v);
1512 template <class _Tp, class _Allocator>
1513 template <class... _Args>
1514 _LIBCPP_INLINE_VISIBILITY inline
1516 vector<_Tp, _Allocator>::emplace_back(_Args&&... __args)
1518 if (this->__end_ < this->__end_cap())
1520 __alloc_traits::construct(this->__alloc(),
1521 _VSTD::__to_raw_pointer(this->__end_),
1522 _VSTD::forward<_Args>(__args)...);
1526 __emplace_back_slow_path(_VSTD::forward<_Args>(__args)...);
1529 #endif // _LIBCPP_HAS_NO_VARIADICS
1530 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
1532 template <class _Tp, class _Allocator>
1533 _LIBCPP_INLINE_VISIBILITY inline
1535 vector<_Tp, _Allocator>::pop_back()
1537 _LIBCPP_ASSERT(!empty(), "vector::pop_back called for empty vector");
1538 this->__destruct_at_end(this->__end_ - 1);
1541 template <class _Tp, class _Allocator>
1542 _LIBCPP_INLINE_VISIBILITY inline
1543 typename vector<_Tp, _Allocator>::iterator
1544 vector<_Tp, _Allocator>::erase(const_iterator __position)
1546 #if _LIBCPP_DEBUG_LEVEL >= 2
1547 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__position) == this,
1548 "vector::erase(iterator) called with an iterator not"
1549 " referring to this vector");
1551 pointer __p = const_cast<pointer>(&*__position);
1552 iterator __r = __make_iter(__p);
1553 this->__destruct_at_end(_VSTD::move(__p + 1, this->__end_, __p));
1557 template <class _Tp, class _Allocator>
1558 typename vector<_Tp, _Allocator>::iterator
1559 vector<_Tp, _Allocator>::erase(const_iterator __first, const_iterator __last)
1561 #if _LIBCPP_DEBUG_LEVEL >= 2
1562 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__first) == this,
1563 "vector::erase(iterator, iterator) called with an iterator not"
1564 " referring to this vector");
1566 _LIBCPP_ASSERT(__first <= __last, "vector::erase(first, last) called with invalid range");
1567 pointer __p = this->__begin_ + (__first - begin());
1568 iterator __r = __make_iter(__p);
1569 this->__destruct_at_end(_VSTD::move(__p + (__last - __first), this->__end_, __p));
1573 template <class _Tp, class _Allocator>
1575 vector<_Tp, _Allocator>::__move_range(pointer __from_s, pointer __from_e, pointer __to)
1577 pointer __old_last = this->__end_;
1578 difference_type __n = __old_last - __to;
1579 for (pointer __i = __from_s + __n; __i < __from_e; ++__i, ++this->__end_)
1580 __alloc_traits::construct(this->__alloc(),
1581 _VSTD::__to_raw_pointer(this->__end_),
1583 _VSTD::move_backward(__from_s, __from_s + __n, __old_last);
1586 template <class _Tp, class _Allocator>
1587 typename vector<_Tp, _Allocator>::iterator
1588 vector<_Tp, _Allocator>::insert(const_iterator __position, const_reference __x)
1590 #if _LIBCPP_DEBUG_LEVEL >= 2
1591 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__position) == this,
1592 "vector::insert(iterator, x) called with an iterator not"
1593 " referring to this vector");
1595 pointer __p = this->__begin_ + (__position - begin());
1596 if (this->__end_ < this->__end_cap())
1598 if (__p == this->__end_)
1600 __alloc_traits::construct(this->__alloc(),
1601 _VSTD::__to_raw_pointer(this->__end_), __x);
1606 __move_range(__p, this->__end_, __p + 1);
1607 const_pointer __xr = pointer_traits<const_pointer>::pointer_to(__x);
1608 if (__p <= __xr && __xr < this->__end_)
1615 allocator_type& __a = this->__alloc();
1616 __split_buffer<value_type, allocator_type&> __v(__recommend(size() + 1), __p - this->__begin_, __a);
1618 __p = __swap_out_circular_buffer(__v, __p);
1620 return __make_iter(__p);
1623 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
1625 template <class _Tp, class _Allocator>
1626 typename vector<_Tp, _Allocator>::iterator
1627 vector<_Tp, _Allocator>::insert(const_iterator __position, value_type&& __x)
1629 #if _LIBCPP_DEBUG_LEVEL >= 2
1630 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__position) == this,
1631 "vector::insert(iterator, x) called with an iterator not"
1632 " referring to this vector");
1634 pointer __p = this->__begin_ + (__position - begin());
1635 if (this->__end_ < this->__end_cap())
1637 if (__p == this->__end_)
1639 __alloc_traits::construct(this->__alloc(),
1640 _VSTD::__to_raw_pointer(this->__end_),
1646 __move_range(__p, this->__end_, __p + 1);
1647 *__p = _VSTD::move(__x);
1652 allocator_type& __a = this->__alloc();
1653 __split_buffer<value_type, allocator_type&> __v(__recommend(size() + 1), __p - this->__begin_, __a);
1654 __v.push_back(_VSTD::move(__x));
1655 __p = __swap_out_circular_buffer(__v, __p);
1657 return __make_iter(__p);
1660 #ifndef _LIBCPP_HAS_NO_VARIADICS
1662 template <class _Tp, class _Allocator>
1663 template <class... _Args>
1664 typename vector<_Tp, _Allocator>::iterator
1665 vector<_Tp, _Allocator>::emplace(const_iterator __position, _Args&&... __args)
1667 #if _LIBCPP_DEBUG_LEVEL >= 2
1668 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__position) == this,
1669 "vector::emplace(iterator, x) called with an iterator not"
1670 " referring to this vector");
1672 pointer __p = this->__begin_ + (__position - begin());
1673 if (this->__end_ < this->__end_cap())
1675 if (__p == this->__end_)
1677 __alloc_traits::construct(this->__alloc(),
1678 _VSTD::__to_raw_pointer(this->__end_),
1679 _VSTD::forward<_Args>(__args)...);
1684 value_type __tmp(_VSTD::forward<_Args>(__args)...);
1685 __move_range(__p, this->__end_, __p + 1);
1686 *__p = _VSTD::move(__tmp);
1691 allocator_type& __a = this->__alloc();
1692 __split_buffer<value_type, allocator_type&> __v(__recommend(size() + 1), __p - this->__begin_, __a);
1693 __v.emplace_back(_VSTD::forward<_Args>(__args)...);
1694 __p = __swap_out_circular_buffer(__v, __p);
1696 return __make_iter(__p);
1699 #endif // _LIBCPP_HAS_NO_VARIADICS
1700 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
1702 template <class _Tp, class _Allocator>
1703 typename vector<_Tp, _Allocator>::iterator
1704 vector<_Tp, _Allocator>::insert(const_iterator __position, size_type __n, const_reference __x)
1706 #if _LIBCPP_DEBUG_LEVEL >= 2
1707 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__position) == this,
1708 "vector::insert(iterator, n, x) called with an iterator not"
1709 " referring to this vector");
1711 pointer __p = this->__begin_ + (__position - begin());
1714 if (__n <= static_cast<size_type>(this->__end_cap() - this->__end_))
1716 size_type __old_n = __n;
1717 pointer __old_last = this->__end_;
1718 if (__n > static_cast<size_type>(this->__end_ - __p))
1720 size_type __cx = __n - (this->__end_ - __p);
1721 __construct_at_end(__cx, __x);
1726 __move_range(__p, __old_last, __p + __old_n);
1727 const_pointer __xr = pointer_traits<const_pointer>::pointer_to(__x);
1728 if (__p <= __xr && __xr < this->__end_)
1730 _VSTD::fill_n(__p, __n, *__xr);
1735 allocator_type& __a = this->__alloc();
1736 __split_buffer<value_type, allocator_type&> __v(__recommend(size() + __n), __p - this->__begin_, __a);
1737 __v.__construct_at_end(__n, __x);
1738 __p = __swap_out_circular_buffer(__v, __p);
1741 return __make_iter(__p);
1744 template <class _Tp, class _Allocator>
1745 template <class _InputIterator>
1748 __is_input_iterator <_InputIterator>::value &&
1749 !__is_forward_iterator<_InputIterator>::value,
1750 typename vector<_Tp, _Allocator>::iterator
1752 vector<_Tp, _Allocator>::insert(const_iterator __position, _InputIterator __first, _InputIterator __last)
1754 #if _LIBCPP_DEBUG_LEVEL >= 2
1755 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__position) == this,
1756 "vector::insert(iterator, range) called with an iterator not"
1757 " referring to this vector");
1759 difference_type __off = __position - begin();
1760 pointer __p = this->__begin_ + __off;
1761 allocator_type& __a = this->__alloc();
1762 pointer __old_last = this->__end_;
1763 for (; this->__end_ != this->__end_cap() && __first != __last; ++__first)
1765 __alloc_traits::construct(__a, _VSTD::__to_raw_pointer(this->__end_),
1769 __split_buffer<value_type, allocator_type&> __v(__a);
1770 if (__first != __last)
1772 #ifndef _LIBCPP_NO_EXCEPTIONS
1775 #endif // _LIBCPP_NO_EXCEPTIONS
1776 __v.__construct_at_end(__first, __last);
1777 difference_type __old_size = __old_last - this->__begin_;
1778 difference_type __old_p = __p - this->__begin_;
1779 reserve(__recommend(size() + __v.size()));
1780 __p = this->__begin_ + __old_p;
1781 __old_last = this->__begin_ + __old_size;
1782 #ifndef _LIBCPP_NO_EXCEPTIONS
1786 erase(__make_iter(__old_last), end());
1789 #endif // _LIBCPP_NO_EXCEPTIONS
1791 __p = _VSTD::rotate(__p, __old_last, this->__end_);
1792 insert(__make_iter(__p), make_move_iterator(__v.begin()),
1793 make_move_iterator(__v.end()));
1794 return begin() + __off;
1797 template <class _Tp, class _Allocator>
1798 template <class _ForwardIterator>
1801 __is_forward_iterator<_ForwardIterator>::value,
1802 typename vector<_Tp, _Allocator>::iterator
1804 vector<_Tp, _Allocator>::insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last)
1806 #if _LIBCPP_DEBUG_LEVEL >= 2
1807 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__position) == this,
1808 "vector::insert(iterator, range) called with an iterator not"
1809 " referring to this vector");
1811 pointer __p = this->__begin_ + (__position - begin());
1812 difference_type __n = _VSTD::distance(__first, __last);
1815 if (__n <= this->__end_cap() - this->__end_)
1817 size_type __old_n = __n;
1818 pointer __old_last = this->__end_;
1819 _ForwardIterator __m = __last;
1820 difference_type __dx = this->__end_ - __p;
1824 _VSTD::advance(__m, this->__end_ - __p);
1825 __construct_at_end(__m, __last);
1830 __move_range(__p, __old_last, __p + __old_n);
1831 _VSTD::copy(__first, __m, __p);
1836 allocator_type& __a = this->__alloc();
1837 __split_buffer<value_type, allocator_type&> __v(__recommend(size() + __n), __p - this->__begin_, __a);
1838 __v.__construct_at_end(__first, __last);
1839 __p = __swap_out_circular_buffer(__v, __p);
1842 return __make_iter(__p);
1845 template <class _Tp, class _Allocator>
1847 vector<_Tp, _Allocator>::resize(size_type __sz)
1849 size_type __cs = size();
1851 this->__append(__sz - __cs);
1852 else if (__cs > __sz)
1853 this->__destruct_at_end(this->__begin_ + __sz);
1856 template <class _Tp, class _Allocator>
1858 vector<_Tp, _Allocator>::resize(size_type __sz, const_reference __x)
1860 size_type __cs = size();
1862 this->__append(__sz - __cs, __x);
1863 else if (__cs > __sz)
1864 this->__destruct_at_end(this->__begin_ + __sz);
1867 template <class _Tp, class _Allocator>
1869 vector<_Tp, _Allocator>::swap(vector& __x)
1870 _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value ||
1871 __is_nothrow_swappable<allocator_type>::value)
1873 _LIBCPP_ASSERT(__alloc_traits::propagate_on_container_swap::value ||
1874 this->__alloc() == __x.__alloc(),
1875 "vector::swap: Either propagate_on_container_swap must be true"
1876 " or the allocators must compare equal");
1877 _VSTD::swap(this->__begin_, __x.__begin_);
1878 _VSTD::swap(this->__end_, __x.__end_);
1879 _VSTD::swap(this->__end_cap(), __x.__end_cap());
1880 __base::__swap_alloc(this->__alloc(), __x.__alloc());
1881 #if _LIBCPP_DEBUG_LEVEL >= 2
1882 __get_db()->swap(this, &__x);
1883 #endif // _LIBCPP_DEBUG_LEVEL >= 2
1886 template <class _Tp, class _Allocator>
1888 vector<_Tp, _Allocator>::__invariants() const
1890 if (this->__begin_ == 0)
1892 if (this->__end_ != 0 || this->__end_cap() != 0)
1897 if (this->__begin_ > this->__end_)
1899 if (this->__begin_ == this->__end_cap())
1901 if (this->__end_ > this->__end_cap())
1907 #if _LIBCPP_DEBUG_LEVEL >= 2
1909 template <class _Tp, class _Allocator>
1911 vector<_Tp, _Allocator>::__dereferenceable(const const_iterator* __i) const
1913 return this->__begin_ <= __i->base() && __i->base() < this->__end_;
1916 template <class _Tp, class _Allocator>
1918 vector<_Tp, _Allocator>::__decrementable(const const_iterator* __i) const
1920 return this->__begin_ < __i->base() && __i->base() <= this->__end_;
1923 template <class _Tp, class _Allocator>
1925 vector<_Tp, _Allocator>::__addable(const const_iterator* __i, ptrdiff_t __n) const
1927 const_pointer __p = __i->base() + __n;
1928 return this->__begin_ <= __p && __p <= this->__end_;
1931 template <class _Tp, class _Allocator>
1933 vector<_Tp, _Allocator>::__subscriptable(const const_iterator* __i, ptrdiff_t __n) const
1935 const_pointer __p = __i->base() + __n;
1936 return this->__begin_ <= __p && __p < this->__end_;
1939 #endif // _LIBCPP_DEBUG_LEVEL >= 2
1941 template <class _Tp, class _Allocator>
1942 _LIBCPP_INLINE_VISIBILITY inline
1944 vector<_Tp, _Allocator>::__invalidate_all_iterators()
1946 #if _LIBCPP_DEBUG_LEVEL >= 2
1947 __get_db()->__invalidate_all(this);
1948 #endif // _LIBCPP_DEBUG_LEVEL >= 2
1953 template <class _Allocator> class vector<bool, _Allocator>;
1955 template <class _Allocator> struct hash<vector<bool, _Allocator> >;
1957 template <class _Allocator>
1958 struct __has_storage_type<vector<bool, _Allocator> >
1960 static const bool value = true;
1963 template <class _Allocator>
1964 class _LIBCPP_VISIBLE vector<bool, _Allocator>
1965 : private __vector_base_common<true>
1968 typedef vector __self;
1969 typedef bool value_type;
1970 typedef _Allocator allocator_type;
1971 typedef allocator_traits<allocator_type> __alloc_traits;
1972 typedef typename __alloc_traits::size_type size_type;
1973 typedef typename __alloc_traits::difference_type difference_type;
1974 typedef size_type __storage_type;
1975 typedef __bit_iterator<vector, false> pointer;
1976 typedef __bit_iterator<vector, true> const_pointer;
1977 #ifdef _LIBCPP_DEBUG
1978 typedef __debug_iter<vector, pointer> iterator;
1979 typedef __debug_iter<vector, const_pointer> const_iterator;
1981 friend class __debug_iter<vector, pointer>;
1982 friend class __debug_iter<vector, const_pointer>;
1984 pair<iterator*, const_iterator*> __iterator_list_;
1986 _LIBCPP_INLINE_VISIBILITY iterator*& __get_iterator_list(iterator*) {return __iterator_list_.first;}
1987 _LIBCPP_INLINE_VISIBILITY const_iterator*& __get_iterator_list(const_iterator*) {return __iterator_list_.second;}
1988 #else // _LIBCPP_DEBUG
1989 typedef pointer iterator;
1990 typedef const_pointer const_iterator;
1991 #endif // _LIBCPP_DEBUG
1992 typedef _VSTD::reverse_iterator<iterator> reverse_iterator;
1993 typedef _VSTD::reverse_iterator<const_iterator> const_reverse_iterator;
1996 typedef typename __alloc_traits::template
1997 #ifndef _LIBCPP_HAS_NO_TEMPLATE_ALIASES
1998 rebind_alloc<__storage_type>
2000 rebind_alloc<__storage_type>::other
2002 __storage_allocator;
2003 typedef allocator_traits<__storage_allocator> __storage_traits;
2004 typedef typename __storage_traits::pointer __storage_pointer;
2005 typedef typename __storage_traits::const_pointer __const_storage_pointer;
2007 __storage_pointer __begin_;
2009 __compressed_pair<size_type, __storage_allocator> __cap_alloc_;
2011 typedef __bit_reference<vector> reference;
2012 typedef __bit_const_reference<vector> const_reference;
2014 _LIBCPP_INLINE_VISIBILITY
2015 size_type& __cap() _NOEXCEPT
2016 {return __cap_alloc_.first();}
2017 _LIBCPP_INLINE_VISIBILITY
2018 const size_type& __cap() const _NOEXCEPT
2019 {return __cap_alloc_.first();}
2020 _LIBCPP_INLINE_VISIBILITY
2021 __storage_allocator& __alloc() _NOEXCEPT
2022 {return __cap_alloc_.second();}
2023 _LIBCPP_INLINE_VISIBILITY
2024 const __storage_allocator& __alloc() const _NOEXCEPT
2025 {return __cap_alloc_.second();}
2027 static const unsigned __bits_per_word = static_cast<unsigned>(sizeof(__storage_type) * CHAR_BIT);
2029 _LIBCPP_INLINE_VISIBILITY
2030 static size_type __internal_cap_to_external(size_type __n) _NOEXCEPT
2031 {return __n * __bits_per_word;}
2032 _LIBCPP_INLINE_VISIBILITY
2033 static size_type __external_cap_to_internal(size_type __n) _NOEXCEPT
2034 {return (__n - 1) / __bits_per_word + 1;}
2037 _LIBCPP_INLINE_VISIBILITY
2039 _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value);
2040 _LIBCPP_INLINE_VISIBILITY explicit vector(const allocator_type& __a);
2042 explicit vector(size_type __n);
2043 vector(size_type __n, const value_type& __v);
2044 vector(size_type __n, const value_type& __v, const allocator_type& __a);
2045 template <class _InputIterator>
2046 vector(_InputIterator __first, _InputIterator __last,
2047 typename enable_if<__is_input_iterator <_InputIterator>::value &&
2048 !__is_forward_iterator<_InputIterator>::value>::type* = 0);
2049 template <class _InputIterator>
2050 vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a,
2051 typename enable_if<__is_input_iterator <_InputIterator>::value &&
2052 !__is_forward_iterator<_InputIterator>::value>::type* = 0);
2053 template <class _ForwardIterator>
2054 vector(_ForwardIterator __first, _ForwardIterator __last,
2055 typename enable_if<__is_forward_iterator<_ForwardIterator>::value>::type* = 0);
2056 template <class _ForwardIterator>
2057 vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a,
2058 typename enable_if<__is_forward_iterator<_ForwardIterator>::value>::type* = 0);
2060 vector(const vector& __v);
2061 vector(const vector& __v, const allocator_type& __a);
2062 vector& operator=(const vector& __v);
2063 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
2064 vector(initializer_list<value_type> __il);
2065 vector(initializer_list<value_type> __il, const allocator_type& __a);
2066 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
2068 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
2069 _LIBCPP_INLINE_VISIBILITY
2070 vector(vector&& __v)
2071 _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value);
2072 vector(vector&& __v, const allocator_type& __a);
2073 _LIBCPP_INLINE_VISIBILITY
2074 vector& operator=(vector&& __v)
2076 __alloc_traits::propagate_on_container_move_assignment::value &&
2077 is_nothrow_move_assignable<allocator_type>::value);
2078 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
2079 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
2080 _LIBCPP_INLINE_VISIBILITY
2081 vector& operator=(initializer_list<value_type> __il)
2082 {assign(__il.begin(), __il.end()); return *this;}
2083 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
2085 template <class _InputIterator>
2088 __is_input_iterator<_InputIterator>::value &&
2089 !__is_forward_iterator<_InputIterator>::value,
2092 assign(_InputIterator __first, _InputIterator __last);
2093 template <class _ForwardIterator>
2096 __is_forward_iterator<_ForwardIterator>::value,
2099 assign(_ForwardIterator __first, _ForwardIterator __last);
2101 void assign(size_type __n, const value_type& __x);
2102 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
2103 _LIBCPP_INLINE_VISIBILITY
2104 void assign(initializer_list<value_type> __il)
2105 {assign(__il.begin(), __il.end());}
2106 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
2108 _LIBCPP_INLINE_VISIBILITY allocator_type get_allocator() const _NOEXCEPT
2109 {return allocator_type(this->__alloc());}
2111 size_type max_size() const _NOEXCEPT;
2112 _LIBCPP_INLINE_VISIBILITY
2113 size_type capacity() const _NOEXCEPT
2114 {return __internal_cap_to_external(__cap());}
2115 _LIBCPP_INLINE_VISIBILITY
2116 size_type size() const _NOEXCEPT
2118 _LIBCPP_INLINE_VISIBILITY
2119 bool empty() const _NOEXCEPT
2120 {return __size_ == 0;}
2121 void reserve(size_type __n);
2122 void shrink_to_fit() _NOEXCEPT;
2124 _LIBCPP_INLINE_VISIBILITY
2125 iterator begin() _NOEXCEPT
2126 {return __make_iter(0);}
2127 _LIBCPP_INLINE_VISIBILITY
2128 const_iterator begin() const _NOEXCEPT
2129 {return __make_iter(0);}
2130 _LIBCPP_INLINE_VISIBILITY
2131 iterator end() _NOEXCEPT
2132 {return __make_iter(__size_);}
2133 _LIBCPP_INLINE_VISIBILITY
2134 const_iterator end() const _NOEXCEPT
2135 {return __make_iter(__size_);}
2137 _LIBCPP_INLINE_VISIBILITY
2138 reverse_iterator rbegin() _NOEXCEPT
2139 {return reverse_iterator(end());}
2140 _LIBCPP_INLINE_VISIBILITY
2141 const_reverse_iterator rbegin() const _NOEXCEPT
2142 {return const_reverse_iterator(end());}
2143 _LIBCPP_INLINE_VISIBILITY
2144 reverse_iterator rend() _NOEXCEPT
2145 {return reverse_iterator(begin());}
2146 _LIBCPP_INLINE_VISIBILITY
2147 const_reverse_iterator rend() const _NOEXCEPT
2148 {return const_reverse_iterator(begin());}
2150 _LIBCPP_INLINE_VISIBILITY
2151 const_iterator cbegin() const _NOEXCEPT
2152 {return __make_iter(0);}
2153 _LIBCPP_INLINE_VISIBILITY
2154 const_iterator cend() const _NOEXCEPT
2155 {return __make_iter(__size_);}
2156 _LIBCPP_INLINE_VISIBILITY
2157 const_reverse_iterator crbegin() const _NOEXCEPT
2159 _LIBCPP_INLINE_VISIBILITY
2160 const_reverse_iterator crend() const _NOEXCEPT
2163 _LIBCPP_INLINE_VISIBILITY reference operator[](size_type __n) {return __make_ref(__n);}
2164 _LIBCPP_INLINE_VISIBILITY const_reference operator[](size_type __n) const {return __make_ref(__n);}
2165 reference at(size_type __n);
2166 const_reference at(size_type __n) const;
2168 _LIBCPP_INLINE_VISIBILITY reference front() {return __make_ref(0);}
2169 _LIBCPP_INLINE_VISIBILITY const_reference front() const {return __make_ref(0);}
2170 _LIBCPP_INLINE_VISIBILITY reference back() {return __make_ref(__size_ - 1);}
2171 _LIBCPP_INLINE_VISIBILITY const_reference back() const {return __make_ref(__size_ - 1);}
2173 void push_back(const value_type& __x);
2174 _LIBCPP_INLINE_VISIBILITY void pop_back() {--__size_;}
2176 iterator insert(const_iterator __position, const value_type& __x);
2177 iterator insert(const_iterator __position, size_type __n, const value_type& __x);
2178 iterator insert(const_iterator __position, size_type __n, const_reference __x);
2179 template <class _InputIterator>
2182 __is_input_iterator <_InputIterator>::value &&
2183 !__is_forward_iterator<_InputIterator>::value,
2186 insert(const_iterator __position, _InputIterator __first, _InputIterator __last);
2187 template <class _ForwardIterator>
2190 __is_forward_iterator<_ForwardIterator>::value,
2193 insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last);
2194 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
2195 _LIBCPP_INLINE_VISIBILITY
2196 iterator insert(const_iterator __position, initializer_list<value_type> __il)
2197 {return insert(__position, __il.begin(), __il.end());}
2198 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
2200 _LIBCPP_INLINE_VISIBILITY iterator erase(const_iterator __position);
2201 iterator erase(const_iterator __first, const_iterator __last);
2203 _LIBCPP_INLINE_VISIBILITY
2204 void clear() _NOEXCEPT {__size_ = 0;}
2207 _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value ||
2208 __is_nothrow_swappable<allocator_type>::value);
2210 void resize(size_type __sz, value_type __x = false);
2211 void flip() _NOEXCEPT;
2213 bool __invariants() const;
2216 _LIBCPP_INLINE_VISIBILITY void __invalidate_all_iterators();
2217 void allocate(size_type __n);
2218 void deallocate() _NOEXCEPT;
2219 _LIBCPP_INLINE_VISIBILITY
2220 static size_type __align(size_type __new_size) _NOEXCEPT
2221 {return __new_size + (__bits_per_word-1) & ~(__bits_per_word-1);};
2222 _LIBCPP_INLINE_VISIBILITY size_type __recommend(size_type __new_size) const;
2223 _LIBCPP_INLINE_VISIBILITY void __construct_at_end(size_type __n, bool __x);
2224 template <class _ForwardIterator>
2227 __is_forward_iterator<_ForwardIterator>::value,
2230 __construct_at_end(_ForwardIterator __first, _ForwardIterator __last);
2231 void __append(size_type __n, const_reference __x);
2232 _LIBCPP_INLINE_VISIBILITY
2233 reference __make_ref(size_type __pos) _NOEXCEPT
2234 {return reference(__begin_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word);}
2235 _LIBCPP_INLINE_VISIBILITY
2236 const_reference __make_ref(size_type __pos) const _NOEXCEPT
2237 {return const_reference(__begin_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word);}
2238 #ifdef _LIBCPP_DEBUG
2239 _LIBCPP_INLINE_VISIBILITY iterator __make_iter(size_type __pos)
2240 {return iterator(this, pointer(__begin_ + __pos / __bits_per_word, static_cast<unsigned>(__pos % __bits_per_word)));}
2241 _LIBCPP_INLINE_VISIBILITY const_iterator __make_iter(size_type __pos) const
2242 {return const_iterator(this, const_pointer(__begin_ + __pos / __bits_per_word, static_cast<unsigned>(__pos % __bits_per_word)));}
2243 _LIBCPP_INLINE_VISIBILITY iterator __const_iterator_cast(const_iterator __p)
2244 {return iterator(this, pointer(const_cast<__storage_pointer>(__p.base().__seg_), __p.base().__ctz_));}
2245 #else // _LIBCPP_DEBUG
2246 _LIBCPP_INLINE_VISIBILITY
2247 iterator __make_iter(size_type __pos) _NOEXCEPT
2248 {return iterator(__begin_ + __pos / __bits_per_word, static_cast<unsigned>(__pos % __bits_per_word));}
2249 _LIBCPP_INLINE_VISIBILITY
2250 const_iterator __make_iter(size_type __pos) const _NOEXCEPT
2251 {return const_iterator(__begin_ + __pos / __bits_per_word, static_cast<unsigned>(__pos % __bits_per_word));}
2252 _LIBCPP_INLINE_VISIBILITY
2253 iterator __const_iterator_cast(const_iterator __p) _NOEXCEPT
2254 {return iterator(const_cast<__storage_pointer>(__p.__seg_), __p.__ctz_);}
2255 #endif // _LIBCPP_DEBUG
2257 _LIBCPP_INLINE_VISIBILITY
2258 void __copy_assign_alloc(const vector& __v)
2259 {__copy_assign_alloc(__v, integral_constant<bool,
2260 __storage_traits::propagate_on_container_copy_assignment::value>());}
2261 _LIBCPP_INLINE_VISIBILITY
2262 void __copy_assign_alloc(const vector& __c, true_type)
2264 if (__alloc() != __c.__alloc())
2266 __alloc() = __c.__alloc();
2269 _LIBCPP_INLINE_VISIBILITY
2270 void __copy_assign_alloc(const vector&, false_type)
2273 void __move_assign(vector& __c, false_type);
2274 void __move_assign(vector& __c, true_type)
2275 _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value);
2276 _LIBCPP_INLINE_VISIBILITY
2277 void __move_assign_alloc(vector& __c)
2279 !__storage_traits::propagate_on_container_move_assignment::value ||
2280 is_nothrow_move_assignable<allocator_type>::value)
2281 {__move_assign_alloc(__c, integral_constant<bool,
2282 __storage_traits::propagate_on_container_move_assignment::value>());}
2283 _LIBCPP_INLINE_VISIBILITY
2284 void __move_assign_alloc(vector& __c, true_type)
2285 _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
2287 __alloc() = _VSTD::move(__c.__alloc());
2290 _LIBCPP_INLINE_VISIBILITY
2291 void __move_assign_alloc(vector&, false_type)
2295 _LIBCPP_INLINE_VISIBILITY
2296 static void __swap_alloc(__storage_allocator& __x, __storage_allocator& __y)
2298 !__storage_traits::propagate_on_container_swap::value ||
2299 __is_nothrow_swappable<allocator_type>::value)
2300 {__swap_alloc(__x, __y, integral_constant<bool,
2301 __storage_traits::propagate_on_container_swap::value>());}
2303 _LIBCPP_INLINE_VISIBILITY
2304 static void __swap_alloc(__storage_allocator& __x, __storage_allocator& __y, true_type)
2305 _NOEXCEPT_(__is_nothrow_swappable<allocator_type>::value)
2310 _LIBCPP_INLINE_VISIBILITY
2311 static void __swap_alloc(__storage_allocator&, __storage_allocator&, false_type)
2315 size_t __hash_code() const _NOEXCEPT;
2317 friend class __bit_reference<vector>;
2318 friend class __bit_const_reference<vector>;
2319 friend class __bit_iterator<vector, false>;
2320 friend class __bit_iterator<vector, true>;
2321 friend struct __bit_array<vector>;
2322 friend struct _LIBCPP_VISIBLE hash<vector>;
2325 template <class _Allocator>
2326 #ifndef _LIBCPP_DEBUG
2327 _LIBCPP_INLINE_VISIBILITY inline
2330 vector<bool, _Allocator>::__invalidate_all_iterators()
2332 #ifdef _LIBCPP_DEBUG
2333 iterator::__remove_all(this);
2334 const_iterator::__remove_all(this);
2335 #endif // _LIBCPP_DEBUG
2338 // Allocate space for __n objects
2339 // throws length_error if __n > max_size()
2340 // throws (probably bad_alloc) if memory run out
2341 // Precondition: __begin_ == __end_ == __cap() == 0
2342 // Precondition: __n > 0
2343 // Postcondition: capacity() == __n
2344 // Postcondition: size() == 0
2345 template <class _Allocator>
2347 vector<bool, _Allocator>::allocate(size_type __n)
2349 if (__n > max_size())
2350 this->__throw_length_error();
2351 __n = __external_cap_to_internal(__n);
2352 this->__begin_ = __storage_traits::allocate(this->__alloc(), __n);
2354 this->__cap() = __n;
2357 template <class _Allocator>
2359 vector<bool, _Allocator>::deallocate() _NOEXCEPT
2361 if (this->__begin_ != 0)
2363 __storage_traits::deallocate(this->__alloc(), this->__begin_, __cap());
2364 __invalidate_all_iterators();
2366 this->__size_ = this->__cap() = 0;
2370 template <class _Allocator>
2371 typename vector<bool, _Allocator>::size_type
2372 vector<bool, _Allocator>::max_size() const _NOEXCEPT
2374 size_type __amax = __storage_traits::max_size(__alloc());
2375 size_type __nmax = numeric_limits<size_type>::max() / 2; // end() >= begin(), always
2376 if (__nmax / __bits_per_word <= __amax)
2378 return __internal_cap_to_external(__amax);
2381 // Precondition: __new_size > capacity()
2382 template <class _Allocator>
2383 _LIBCPP_INLINE_VISIBILITY inline
2384 typename vector<bool, _Allocator>::size_type
2385 vector<bool, _Allocator>::__recommend(size_type __new_size) const
2387 const size_type __ms = max_size();
2388 if (__new_size > __ms)
2389 this->__throw_length_error();
2390 const size_type __cap = capacity();
2391 if (__cap >= __ms / 2)
2393 return _VSTD::max(2*__cap, __align(__new_size));
2396 // Default constructs __n objects starting at __end_
2397 // Precondition: __n > 0
2398 // Precondition: size() + __n <= capacity()
2399 // Postcondition: size() == size() + __n
2400 template <class _Allocator>
2401 _LIBCPP_INLINE_VISIBILITY inline
2403 vector<bool, _Allocator>::__construct_at_end(size_type __n, bool __x)
2405 size_type __old_size = this->__size_;
2406 this->__size_ += __n;
2407 _VSTD::fill_n(__make_iter(__old_size), __n, __x);
2410 template <class _Allocator>
2411 template <class _ForwardIterator>
2414 __is_forward_iterator<_ForwardIterator>::value,
2417 vector<bool, _Allocator>::__construct_at_end(_ForwardIterator __first, _ForwardIterator __last)
2419 size_type __old_size = this->__size_;
2420 this->__size_ += _VSTD::distance(__first, __last);
2421 _VSTD::copy(__first, __last, __make_iter(__old_size));
2424 template <class _Allocator>
2425 _LIBCPP_INLINE_VISIBILITY inline
2426 vector<bool, _Allocator>::vector()
2427 _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value)
2434 template <class _Allocator>
2435 _LIBCPP_INLINE_VISIBILITY inline
2436 vector<bool, _Allocator>::vector(const allocator_type& __a)
2439 __cap_alloc_(0, static_cast<__storage_allocator>(__a))
2443 template <class _Allocator>
2444 vector<bool, _Allocator>::vector(size_type __n)
2452 __construct_at_end(__n, false);
2456 template <class _Allocator>
2457 vector<bool, _Allocator>::vector(size_type __n, const value_type& __x)
2465 __construct_at_end(__n, __x);
2469 template <class _Allocator>
2470 vector<bool, _Allocator>::vector(size_type __n, const value_type& __x, const allocator_type& __a)
2473 __cap_alloc_(0, static_cast<__storage_allocator>(__a))
2478 __construct_at_end(__n, __x);
2482 template <class _Allocator>
2483 template <class _InputIterator>
2484 vector<bool, _Allocator>::vector(_InputIterator __first, _InputIterator __last,
2485 typename enable_if<__is_input_iterator <_InputIterator>::value &&
2486 !__is_forward_iterator<_InputIterator>::value>::type*)
2491 #ifndef _LIBCPP_NO_EXCEPTIONS
2494 #endif // _LIBCPP_NO_EXCEPTIONS
2495 for (; __first != __last; ++__first)
2496 push_back(*__first);
2497 #ifndef _LIBCPP_NO_EXCEPTIONS
2502 __storage_traits::deallocate(__alloc(), __begin_, __cap());
2503 __invalidate_all_iterators();
2506 #endif // _LIBCPP_NO_EXCEPTIONS
2509 template <class _Allocator>
2510 template <class _InputIterator>
2511 vector<bool, _Allocator>::vector(_InputIterator __first, _InputIterator __last, const allocator_type& __a,
2512 typename enable_if<__is_input_iterator <_InputIterator>::value &&
2513 !__is_forward_iterator<_InputIterator>::value>::type*)
2516 __cap_alloc_(0, static_cast<__storage_allocator>(__a))
2518 #ifndef _LIBCPP_NO_EXCEPTIONS
2521 #endif // _LIBCPP_NO_EXCEPTIONS
2522 for (; __first != __last; ++__first)
2523 push_back(*__first);
2524 #ifndef _LIBCPP_NO_EXCEPTIONS
2529 __storage_traits::deallocate(__alloc(), __begin_, __cap());
2530 __invalidate_all_iterators();
2533 #endif // _LIBCPP_NO_EXCEPTIONS
2536 template <class _Allocator>
2537 template <class _ForwardIterator>
2538 vector<bool, _Allocator>::vector(_ForwardIterator __first, _ForwardIterator __last,
2539 typename enable_if<__is_forward_iterator<_ForwardIterator>::value>::type*)
2544 size_type __n = static_cast<size_type>(_VSTD::distance(__first, __last));
2548 __construct_at_end(__first, __last);
2552 template <class _Allocator>
2553 template <class _ForwardIterator>
2554 vector<bool, _Allocator>::vector(_ForwardIterator __first, _ForwardIterator __last, const allocator_type& __a,
2555 typename enable_if<__is_forward_iterator<_ForwardIterator>::value>::type*)
2558 __cap_alloc_(0, static_cast<__storage_allocator>(__a))
2560 size_type __n = static_cast<size_type>(_VSTD::distance(__first, __last));
2564 __construct_at_end(__first, __last);
2568 #ifndef _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
2570 template <class _Allocator>
2571 vector<bool, _Allocator>::vector(initializer_list<value_type> __il)
2576 size_type __n = static_cast<size_type>(__il.size());
2580 __construct_at_end(__il.begin(), __il.end());
2584 template <class _Allocator>
2585 vector<bool, _Allocator>::vector(initializer_list<value_type> __il, const allocator_type& __a)
2588 __cap_alloc_(0, static_cast<__storage_allocator>(__a))
2590 size_type __n = static_cast<size_type>(__il.size());
2594 __construct_at_end(__il.begin(), __il.end());
2598 #endif // _LIBCPP_HAS_NO_GENERALIZED_INITIALIZERS
2600 template <class _Allocator>
2601 vector<bool, _Allocator>::~vector()
2604 __storage_traits::deallocate(__alloc(), __begin_, __cap());
2605 #ifdef _LIBCPP_DEBUG
2606 __invalidate_all_iterators();
2610 template <class _Allocator>
2611 vector<bool, _Allocator>::vector(const vector& __v)
2614 __cap_alloc_(0, __storage_traits::select_on_container_copy_construction(__v.__alloc()))
2618 allocate(__v.size());
2619 __construct_at_end(__v.begin(), __v.end());
2623 template <class _Allocator>
2624 vector<bool, _Allocator>::vector(const vector& __v, const allocator_type& __a)
2627 __cap_alloc_(0, __a)
2631 allocate(__v.size());
2632 __construct_at_end(__v.begin(), __v.end());
2636 template <class _Allocator>
2637 vector<bool, _Allocator>&
2638 vector<bool, _Allocator>::operator=(const vector& __v)
2642 __copy_assign_alloc(__v);
2645 if (__v.__size_ > capacity())
2648 allocate(__v.__size_);
2650 _VSTD::copy(__v.__begin_, __v.__begin_ + __external_cap_to_internal(__v.__size_), __begin_);
2652 __size_ = __v.__size_;
2657 #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES
2659 template <class _Allocator>
2660 _LIBCPP_INLINE_VISIBILITY inline
2661 vector<bool, _Allocator>::vector(vector&& __v)
2662 _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value)
2663 : __begin_(__v.__begin_),
2664 __size_(__v.__size_),
2665 __cap_alloc_(__v.__cap_alloc_)
2672 template <class _Allocator>
2673 vector<bool, _Allocator>::vector(vector&& __v, const allocator_type& __a)
2676 __cap_alloc_(0, __a)
2678 if (__a == allocator_type(__v.__alloc()))
2680 this->__begin_ = __v.__begin_;
2681 this->__size_ = __v.__size_;
2682 this->__cap() = __v.__cap();
2683 __v.__begin_ = nullptr;
2684 __v.__cap() = __v.__size_ = 0;
2686 else if (__v.size() > 0)
2688 allocate(__v.size());
2689 __construct_at_end(__v.begin(), __v.end());
2693 template <class _Allocator>
2694 _LIBCPP_INLINE_VISIBILITY inline
2695 vector<bool, _Allocator>&
2696 vector<bool, _Allocator>::operator=(vector&& __v)
2698 __alloc_traits::propagate_on_container_move_assignment::value &&
2699 is_nothrow_move_assignable<allocator_type>::value)
2701 __move_assign(__v, integral_constant<bool,
2702 __storage_traits::propagate_on_container_move_assignment::value>());
2706 template <class _Allocator>
2708 vector<bool, _Allocator>::__move_assign(vector& __c, false_type)
2710 if (__alloc() != __c.__alloc())
2711 assign(__c.begin(), __c.end());
2713 __move_assign(__c, true_type());
2716 template <class _Allocator>
2718 vector<bool, _Allocator>::__move_assign(vector& __c, true_type)
2719 _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
2722 this->__begin_ = __c.__begin_;
2723 this->__size_ = __c.__size_;
2724 this->__cap() = __c.__cap();
2725 __move_assign_alloc(__c);
2726 __c.__begin_ = nullptr;
2727 __c.__cap() = __c.__size_ = 0;
2730 #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES
2732 template <class _Allocator>
2734 vector<bool, _Allocator>::assign(size_type __n, const value_type& __x)
2739 size_type __c = capacity();
2744 vector __v(__alloc());
2745 __v.reserve(__recommend(__n));
2749 _VSTD::fill_n(begin(), __n, __x);
2753 template <class _Allocator>
2754 template <class _InputIterator>
2757 __is_input_iterator<_InputIterator>::value &&
2758 !__is_forward_iterator<_InputIterator>::value,
2761 vector<bool, _Allocator>::assign(_InputIterator __first, _InputIterator __last)
2764 for (; __first != __last; ++__first)
2765 push_back(*__first);
2768 template <class _Allocator>
2769 template <class _ForwardIterator>
2772 __is_forward_iterator<_ForwardIterator>::value,
2775 vector<bool, _Allocator>::assign(_ForwardIterator __first, _ForwardIterator __last)
2778 difference_type __n = _VSTD::distance(__first, __last);
2781 if (__n > capacity())
2786 __construct_at_end(__first, __last);
2790 template <class _Allocator>
2792 vector<bool, _Allocator>::reserve(size_type __n)
2794 if (__n > capacity())
2796 vector __v(this->__alloc());
2798 __v.__construct_at_end(this->begin(), this->end());
2800 __invalidate_all_iterators();
2804 template <class _Allocator>
2806 vector<bool, _Allocator>::shrink_to_fit() _NOEXCEPT
2808 if (__external_cap_to_internal(size()) > __cap())
2810 #ifndef _LIBCPP_NO_EXCEPTIONS
2813 #endif // _LIBCPP_NO_EXCEPTIONS
2814 vector(*this, allocator_type(__alloc())).swap(*this);
2815 #ifndef _LIBCPP_NO_EXCEPTIONS
2820 #endif // _LIBCPP_NO_EXCEPTIONS
2824 template <class _Allocator>
2825 typename vector<bool, _Allocator>::reference
2826 vector<bool, _Allocator>::at(size_type __n)
2829 this->__throw_out_of_range();
2830 return (*this)[__n];
2833 template <class _Allocator>
2834 typename vector<bool, _Allocator>::const_reference
2835 vector<bool, _Allocator>::at(size_type __n) const
2838 this->__throw_out_of_range();
2839 return (*this)[__n];
2842 template <class _Allocator>
2844 vector<bool, _Allocator>::push_back(const value_type& __x)
2846 if (this->__size_ == this->capacity())
2847 reserve(__recommend(this->__size_ + 1));
2852 template <class _Allocator>
2853 typename vector<bool, _Allocator>::iterator
2854 vector<bool, _Allocator>::insert(const_iterator __position, const value_type& __x)
2857 if (size() < capacity())
2859 const_iterator __old_end = end();
2861 _VSTD::copy_backward(__position, __old_end, end());
2862 __r = __const_iterator_cast(__position);
2866 vector __v(__alloc());
2867 __v.reserve(__recommend(__size_ + 1));
2868 __v.__size_ = __size_ + 1;
2869 __r = _VSTD::copy(cbegin(), __position, __v.begin());
2870 _VSTD::copy_backward(__position, cend(), __v.end());
2877 template <class _Allocator>
2878 typename vector<bool, _Allocator>::iterator
2879 vector<bool, _Allocator>::insert(const_iterator __position, size_type __n, const value_type& __x)
2882 size_type __c = capacity();
2883 if (__n <= __c && size() <= __c - __n)
2885 const_iterator __old_end = end();
2887 _VSTD::copy_backward(__position, __old_end, end());
2888 __r = __const_iterator_cast(__position);
2892 vector __v(__alloc());
2893 __v.reserve(__recommend(__size_ + __n));
2894 __v.__size_ = __size_ + __n;
2895 __r = _VSTD::copy(cbegin(), __position, __v.begin());
2896 _VSTD::copy_backward(__position, cend(), __v.end());
2899 _VSTD::fill_n(__r, __n, __x);
2903 template <class _Allocator>
2904 template <class _InputIterator>
2907 __is_input_iterator <_InputIterator>::value &&
2908 !__is_forward_iterator<_InputIterator>::value,
2909 typename vector<bool, _Allocator>::iterator
2911 vector<bool, _Allocator>::insert(const_iterator __position, _InputIterator __first, _InputIterator __last)
2913 difference_type __off = __position - begin();
2914 iterator __p = __const_iterator_cast(__position);
2915 iterator __old_end = end();
2916 for (; size() != capacity() && __first != __last; ++__first)
2921 vector __v(__alloc());
2922 if (__first != __last)
2924 #ifndef _LIBCPP_NO_EXCEPTIONS
2927 #endif // _LIBCPP_NO_EXCEPTIONS
2928 __v.assign(__first, __last);
2929 difference_type __old_size = static_cast<difference_type>(__old_end - begin());
2930 difference_type __old_p = __p - begin();
2931 reserve(__recommend(size() + __v.size()));
2932 __p = begin() + __old_p;
2933 __old_end = begin() + __old_size;
2934 #ifndef _LIBCPP_NO_EXCEPTIONS
2938 erase(__old_end, end());
2941 #endif // _LIBCPP_NO_EXCEPTIONS
2943 __p = _VSTD::rotate(__p, __old_end, end());
2944 insert(__p, __v.begin(), __v.end());
2945 return begin() + __off;
2948 template <class _Allocator>
2949 template <class _ForwardIterator>
2952 __is_forward_iterator<_ForwardIterator>::value,
2953 typename vector<bool, _Allocator>::iterator
2955 vector<bool, _Allocator>::insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last)
2957 difference_type __n = _VSTD::distance(__first, __last);
2959 size_type __c = capacity();
2960 if (__n <= __c && size() <= __c - __n)
2962 const_iterator __old_end = end();
2964 _VSTD::copy_backward(__position, __old_end, end());
2965 __r = __const_iterator_cast(__position);
2969 vector __v(__alloc());
2970 __v.reserve(__recommend(__size_ + __n));
2971 __v.__size_ = __size_ + __n;
2972 __r = _VSTD::copy(cbegin(), __position, __v.begin());
2973 _VSTD::copy_backward(__position, cend(), __v.end());
2976 _VSTD::copy(__first, __last, __r);
2980 template <class _Allocator>
2981 _LIBCPP_INLINE_VISIBILITY inline
2982 typename vector<bool, _Allocator>::iterator
2983 vector<bool, _Allocator>::erase(const_iterator __position)
2985 iterator __r = __const_iterator_cast(__position);
2986 _VSTD::copy(__position + 1, this->cend(), __r);
2991 template <class _Allocator>
2992 typename vector<bool, _Allocator>::iterator
2993 vector<bool, _Allocator>::erase(const_iterator __first, const_iterator __last)
2995 iterator __r = __const_iterator_cast(__first);
2996 difference_type __d = __last - __first;
2997 _VSTD::copy(__last, this->cend(), __r);
3002 template <class _Allocator>
3004 vector<bool, _Allocator>::swap(vector& __x)
3005 _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value ||
3006 __is_nothrow_swappable<allocator_type>::value)
3008 _VSTD::swap(this->__begin_, __x.__begin_);
3009 _VSTD::swap(this->__size_, __x.__size_);
3010 _VSTD::swap(this->__cap(), __x.__cap());
3011 __swap_alloc(this->__alloc(), __x.__alloc());
3012 #ifdef _LIBCPP_DEBUG
3013 iterator::swap(this, &__x);
3014 const_iterator::swap(this, &__x);
3015 #endif // _LIBCPP_DEBUG
3018 template <class _Allocator>
3020 vector<bool, _Allocator>::resize(size_type __sz, value_type __x)
3022 size_type __cs = size();
3026 size_type __c = capacity();
3027 size_type __n = __sz - __cs;
3028 if (__n <= __c && __cs <= __c - __n)
3035 vector __v(__alloc());
3036 __v.reserve(__recommend(__size_ + __n));
3037 __v.__size_ = __size_ + __n;
3038 __r = _VSTD::copy(cbegin(), cend(), __v.begin());
3041 _VSTD::fill_n(__r, __n, __x);
3047 template <class _Allocator>
3049 vector<bool, _Allocator>::flip() _NOEXCEPT
3051 // do middle whole words
3052 size_type __n = __size_;
3053 __storage_pointer __p = __begin_;
3054 for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word)
3056 // do last partial word
3059 __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
3060 __storage_type __b = *__p & __m;
3066 template <class _Allocator>
3068 vector<bool, _Allocator>::__invariants() const
3070 if (this->__begin_ == 0)
3072 if (this->__size_ != 0 || this->__cap() != 0)
3077 if (this->__cap() == 0)
3079 if (this->__size_ > this->capacity())
3085 template <class _Allocator>
3087 vector<bool, _Allocator>::__hash_code() const _NOEXCEPT
3090 // do middle whole words
3091 size_type __n = __size_;
3092 __storage_pointer __p = __begin_;
3093 for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word)
3095 // do last partial word
3098 const __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n);
3104 template <class _Allocator>
3105 struct _LIBCPP_VISIBLE hash<vector<bool, _Allocator> >
3106 : public unary_function<vector<bool, _Allocator>, size_t>
3108 _LIBCPP_INLINE_VISIBILITY
3109 size_t operator()(const vector<bool, _Allocator>& __vec) const _NOEXCEPT
3110 {return __vec.__hash_code();}
3113 template <class _Tp, class _Allocator>
3114 _LIBCPP_INLINE_VISIBILITY inline
3116 operator==(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y)
3118 const typename vector<_Tp, _Allocator>::size_type __sz = __x.size();
3119 return __sz == __y.size() && _VSTD::equal(__x.begin(), __x.end(), __y.begin());
3122 template <class _Tp, class _Allocator>
3123 _LIBCPP_INLINE_VISIBILITY inline
3125 operator!=(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y)
3127 return !(__x == __y);
3130 template <class _Tp, class _Allocator>
3131 _LIBCPP_INLINE_VISIBILITY inline
3133 operator< (const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y)
3135 return _VSTD::lexicographical_compare(__x.begin(), __x.end(), __y.begin(), __y.end());
3138 template <class _Tp, class _Allocator>
3139 _LIBCPP_INLINE_VISIBILITY inline
3141 operator> (const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y)
3146 template <class _Tp, class _Allocator>
3147 _LIBCPP_INLINE_VISIBILITY inline
3149 operator>=(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y)
3151 return !(__x < __y);
3154 template <class _Tp, class _Allocator>
3155 _LIBCPP_INLINE_VISIBILITY inline
3157 operator<=(const vector<_Tp, _Allocator>& __x, const vector<_Tp, _Allocator>& __y)
3159 return !(__y < __x);
3162 template <class _Tp, class _Allocator>
3163 _LIBCPP_INLINE_VISIBILITY inline
3165 swap(vector<_Tp, _Allocator>& __x, vector<_Tp, _Allocator>& __y)
3166 _NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
3171 _LIBCPP_END_NAMESPACE_STD
3173 #endif // _LIBCPP_VECTOR