1 // vector<bool> specialization -*- C++ -*-
3 // Copyright (C) 2001-2018 Free Software Foundation, Inc.
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)
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.
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.
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/>.
28 * Hewlett-Packard Company
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.
39 * Copyright (c) 1996-1999
40 * Silicon Graphics Computer Systems, Inc.
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.
51 /** @file bits/stl_bvector.h
52 * This is an internal header file, included by other library headers.
53 * Do not attempt to use it directly. @headername{vector}
56 #ifndef _STL_BVECTOR_H
57 #define _STL_BVECTOR_H 1
59 #if __cplusplus >= 201103L
60 #include <initializer_list>
61 #include <bits/functional_hash.h>
64 namespace std _GLIBCXX_VISIBILITY(default)
66 _GLIBCXX_BEGIN_NAMESPACE_VERSION
67 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
69 typedef unsigned long _Bit_type;
70 enum { _S_word_bit = int(__CHAR_BIT__ * sizeof(_Bit_type)) };
77 _Bit_reference(_Bit_type * __x, _Bit_type __y)
78 : _M_p(__x), _M_mask(__y) { }
80 _Bit_reference() _GLIBCXX_NOEXCEPT : _M_p(0), _M_mask(0) { }
82 operator bool() const _GLIBCXX_NOEXCEPT
83 { return !!(*_M_p & _M_mask); }
86 operator=(bool __x) _GLIBCXX_NOEXCEPT
96 operator=(const _Bit_reference& __x) _GLIBCXX_NOEXCEPT
97 { return *this = bool(__x); }
100 operator==(const _Bit_reference& __x) const
101 { return bool(*this) == bool(__x); }
104 operator<(const _Bit_reference& __x) const
105 { return !bool(*this) && bool(__x); }
108 flip() _GLIBCXX_NOEXCEPT
109 { *_M_p ^= _M_mask; }
112 #if __cplusplus >= 201103L
114 swap(_Bit_reference __x, _Bit_reference __y) noexcept
122 swap(_Bit_reference __x, bool& __y) noexcept
130 swap(bool& __x, _Bit_reference __y) noexcept
138 struct _Bit_iterator_base
139 : public std::iterator<std::random_access_iterator_tag, bool>
142 unsigned int _M_offset;
144 _Bit_iterator_base(_Bit_type * __x, unsigned int __y)
145 : _M_p(__x), _M_offset(__y) { }
150 if (_M_offset++ == int(_S_word_bit) - 1)
160 if (_M_offset-- == 0)
162 _M_offset = int(_S_word_bit) - 1;
168 _M_incr(ptrdiff_t __i)
170 difference_type __n = __i + _M_offset;
171 _M_p += __n / int(_S_word_bit);
172 __n = __n % int(_S_word_bit);
175 __n += int(_S_word_bit);
178 _M_offset = static_cast<unsigned int>(__n);
182 operator==(const _Bit_iterator_base& __i) const
183 { return _M_p == __i._M_p && _M_offset == __i._M_offset; }
186 operator<(const _Bit_iterator_base& __i) const
188 return _M_p < __i._M_p
189 || (_M_p == __i._M_p && _M_offset < __i._M_offset);
193 operator!=(const _Bit_iterator_base& __i) const
194 { return !(*this == __i); }
197 operator>(const _Bit_iterator_base& __i) const
198 { return __i < *this; }
201 operator<=(const _Bit_iterator_base& __i) const
202 { return !(__i < *this); }
205 operator>=(const _Bit_iterator_base& __i) const
206 { return !(*this < __i); }
210 operator-(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)
212 return (int(_S_word_bit) * (__x._M_p - __y._M_p)
213 + __x._M_offset - __y._M_offset);
216 struct _Bit_iterator : public _Bit_iterator_base
218 typedef _Bit_reference reference;
219 typedef _Bit_reference* pointer;
220 typedef _Bit_iterator iterator;
222 _Bit_iterator() : _Bit_iterator_base(0, 0) { }
224 _Bit_iterator(_Bit_type * __x, unsigned int __y)
225 : _Bit_iterator_base(__x, __y) { }
228 _M_const_cast() const
233 { return reference(_M_p, 1UL << _M_offset); }
245 iterator __tmp = *this;
260 iterator __tmp = *this;
266 operator+=(difference_type __i)
273 operator-=(difference_type __i)
280 operator+(difference_type __i) const
282 iterator __tmp = *this;
287 operator-(difference_type __i) const
289 iterator __tmp = *this;
294 operator[](difference_type __i) const
295 { return *(*this + __i); }
299 operator+(ptrdiff_t __n, const _Bit_iterator& __x)
300 { return __x + __n; }
302 struct _Bit_const_iterator : public _Bit_iterator_base
304 typedef bool reference;
305 typedef bool const_reference;
306 typedef const bool* pointer;
307 typedef _Bit_const_iterator const_iterator;
309 _Bit_const_iterator() : _Bit_iterator_base(0, 0) { }
311 _Bit_const_iterator(_Bit_type * __x, unsigned int __y)
312 : _Bit_iterator_base(__x, __y) { }
314 _Bit_const_iterator(const _Bit_iterator& __x)
315 : _Bit_iterator_base(__x._M_p, __x._M_offset) { }
318 _M_const_cast() const
319 { return _Bit_iterator(_M_p, _M_offset); }
323 { return _Bit_reference(_M_p, 1UL << _M_offset); }
335 const_iterator __tmp = *this;
350 const_iterator __tmp = *this;
356 operator+=(difference_type __i)
363 operator-=(difference_type __i)
370 operator+(difference_type __i) const
372 const_iterator __tmp = *this;
377 operator-(difference_type __i) const
379 const_iterator __tmp = *this;
384 operator[](difference_type __i) const
385 { return *(*this + __i); }
388 inline _Bit_const_iterator
389 operator+(ptrdiff_t __n, const _Bit_const_iterator& __x)
390 { return __x + __n; }
393 __fill_bvector(_Bit_type * __v,
394 unsigned int __first, unsigned int __last, bool __x)
396 const _Bit_type __fmask = ~0ul << __first;
397 const _Bit_type __lmask = ~0ul >> (_S_word_bit - __last);
398 const _Bit_type __mask = __fmask & __lmask;
407 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)
409 if (__first._M_p != __last._M_p)
411 _Bit_type* __first_p = __first._M_p;
412 if (__first._M_offset != 0)
413 __fill_bvector(__first_p++, __first._M_offset, _S_word_bit, __x);
415 __builtin_memset(__first_p, __x ? ~0 : 0,
416 (__last._M_p - __first_p) * sizeof(_Bit_type));
418 if (__last._M_offset != 0)
419 __fill_bvector(__last._M_p, 0, __last._M_offset, __x);
421 else if (__first._M_offset != __last._M_offset)
422 __fill_bvector(__first._M_p, __first._M_offset, __last._M_offset, __x);
425 template<typename _Alloc>
428 typedef typename __gnu_cxx::__alloc_traits<_Alloc>::template
429 rebind<_Bit_type>::other _Bit_alloc_type;
430 typedef typename __gnu_cxx::__alloc_traits<_Bit_alloc_type>
432 typedef typename _Bit_alloc_traits::pointer _Bit_pointer;
434 struct _Bvector_impl_data
436 _Bit_iterator _M_start;
437 _Bit_iterator _M_finish;
438 _Bit_pointer _M_end_of_storage;
440 _Bvector_impl_data() _GLIBCXX_NOEXCEPT
441 : _M_start(), _M_finish(), _M_end_of_storage()
444 #if __cplusplus >= 201103L
445 _Bvector_impl_data(_Bvector_impl_data&& __x) noexcept
446 : _M_start(__x._M_start), _M_finish(__x._M_finish)
447 , _M_end_of_storage(__x._M_end_of_storage)
451 _M_move_data(_Bvector_impl_data&& __x) noexcept
453 this->_M_start = __x._M_start;
454 this->_M_finish = __x._M_finish;
455 this->_M_end_of_storage = __x._M_end_of_storage;
461 _M_reset() _GLIBCXX_NOEXCEPT
463 _M_start = _M_finish = _Bit_iterator();
464 _M_end_of_storage = _Bit_pointer();
469 : public _Bit_alloc_type, public _Bvector_impl_data
472 _Bvector_impl() _GLIBCXX_NOEXCEPT_IF(
473 is_nothrow_default_constructible<_Bit_alloc_type>::value)
477 _Bvector_impl(const _Bit_alloc_type& __a) _GLIBCXX_NOEXCEPT
478 : _Bit_alloc_type(__a)
481 #if __cplusplus >= 201103L
482 _Bvector_impl(_Bvector_impl&&) = default;
486 _M_end_addr() const _GLIBCXX_NOEXCEPT
488 if (this->_M_end_of_storage)
489 return std::__addressof(this->_M_end_of_storage[-1]) + 1;
495 typedef _Alloc allocator_type;
498 _M_get_Bit_allocator() _GLIBCXX_NOEXCEPT
499 { return this->_M_impl; }
501 const _Bit_alloc_type&
502 _M_get_Bit_allocator() const _GLIBCXX_NOEXCEPT
503 { return this->_M_impl; }
506 get_allocator() const _GLIBCXX_NOEXCEPT
507 { return allocator_type(_M_get_Bit_allocator()); }
509 #if __cplusplus >= 201103L
510 _Bvector_base() = default;
515 _Bvector_base(const allocator_type& __a)
518 #if __cplusplus >= 201103L
519 _Bvector_base(_Bvector_base&&) = default;
523 { this->_M_deallocate(); }
526 _Bvector_impl _M_impl;
529 _M_allocate(size_t __n)
530 { return _Bit_alloc_traits::allocate(_M_impl, _S_nword(__n)); }
535 if (_M_impl._M_start._M_p)
537 const size_t __n = _M_impl._M_end_addr() - _M_impl._M_start._M_p;
538 _Bit_alloc_traits::deallocate(_M_impl,
539 _M_impl._M_end_of_storage - __n,
545 #if __cplusplus >= 201103L
547 _M_move_data(_Bvector_base&& __x) noexcept
548 { _M_impl._M_move_data(std::move(__x._M_impl)); }
553 { return (__n + int(_S_word_bit) - 1) / int(_S_word_bit); }
556 _GLIBCXX_END_NAMESPACE_CONTAINER
557 _GLIBCXX_END_NAMESPACE_VERSION
560 // Declare a partial specialization of vector<T, Alloc>.
561 #include <bits/stl_vector.h>
563 namespace std _GLIBCXX_VISIBILITY(default)
565 _GLIBCXX_BEGIN_NAMESPACE_VERSION
566 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
569 * @brief A specialization of vector for booleans which offers fixed time
570 * access to individual elements in any order.
574 * @tparam _Alloc Allocator type.
576 * Note that vector<bool> does not actually meet the requirements for being
577 * a container. This is because the reference and pointer types are not
578 * really references and pointers to bool. See DR96 for details. @see
579 * vector for function documentation.
581 * In some terminology a %vector can be described as a dynamic
582 * C-style array, it offers fast and efficient access to individual
583 * elements in any order and saves the user from worrying about
584 * memory and size allocation. Subscripting ( @c [] ) access is
585 * also provided as with C-style arrays.
587 template<typename _Alloc>
588 class vector<bool, _Alloc> : protected _Bvector_base<_Alloc>
590 typedef _Bvector_base<_Alloc> _Base;
591 typedef typename _Base::_Bit_pointer _Bit_pointer;
592 typedef typename _Base::_Bit_alloc_traits _Bit_alloc_traits;
594 #if __cplusplus >= 201103L
595 friend struct std::hash<vector>;
599 typedef bool value_type;
600 typedef size_t size_type;
601 typedef ptrdiff_t difference_type;
602 typedef _Bit_reference reference;
603 typedef bool const_reference;
604 typedef _Bit_reference* pointer;
605 typedef const bool* const_pointer;
606 typedef _Bit_iterator iterator;
607 typedef _Bit_const_iterator const_iterator;
608 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
609 typedef std::reverse_iterator<iterator> reverse_iterator;
610 typedef _Alloc allocator_type;
613 get_allocator() const
614 { return _Base::get_allocator(); }
617 using _Base::_M_allocate;
618 using _Base::_M_deallocate;
619 using _Base::_S_nword;
620 using _Base::_M_get_Bit_allocator;
623 #if __cplusplus >= 201103L
630 vector(const allocator_type& __a)
633 #if __cplusplus >= 201103L
635 vector(size_type __n, const allocator_type& __a = allocator_type())
636 : vector(__n, false, __a)
639 vector(size_type __n, const bool& __value,
640 const allocator_type& __a = allocator_type())
643 vector(size_type __n, const bool& __value = bool(),
644 const allocator_type& __a = allocator_type())
649 _M_initialize_value(__value);
652 vector(const vector& __x)
653 : _Base(_Bit_alloc_traits::_S_select_on_copy(__x._M_get_Bit_allocator()))
655 _M_initialize(__x.size());
656 _M_copy_aligned(__x.begin(), __x.end(), this->_M_impl._M_start);
659 #if __cplusplus >= 201103L
660 vector(vector&&) = default;
662 vector(vector&& __x, const allocator_type& __a)
663 noexcept(_Bit_alloc_traits::_S_always_equal())
666 if (__x.get_allocator() == __a)
667 this->_M_move_data(std::move(__x));
670 _M_initialize(__x.size());
671 _M_copy_aligned(__x.begin(), __x.end(), begin());
676 vector(const vector& __x, const allocator_type& __a)
679 _M_initialize(__x.size());
680 _M_copy_aligned(__x.begin(), __x.end(), this->_M_impl._M_start);
683 vector(initializer_list<bool> __l,
684 const allocator_type& __a = allocator_type())
687 _M_initialize_range(__l.begin(), __l.end(),
688 random_access_iterator_tag());
692 #if __cplusplus >= 201103L
693 template<typename _InputIterator,
694 typename = std::_RequireInputIter<_InputIterator>>
695 vector(_InputIterator __first, _InputIterator __last,
696 const allocator_type& __a = allocator_type())
698 { _M_initialize_dispatch(__first, __last, __false_type()); }
700 template<typename _InputIterator>
701 vector(_InputIterator __first, _InputIterator __last,
702 const allocator_type& __a = allocator_type())
705 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
706 _M_initialize_dispatch(__first, __last, _Integral());
710 ~vector() _GLIBCXX_NOEXCEPT { }
713 operator=(const vector& __x)
717 #if __cplusplus >= 201103L
718 if (_Bit_alloc_traits::_S_propagate_on_copy_assign())
720 if (this->_M_get_Bit_allocator() != __x._M_get_Bit_allocator())
722 this->_M_deallocate();
723 std::__alloc_on_copy(_M_get_Bit_allocator(),
724 __x._M_get_Bit_allocator());
725 _M_initialize(__x.size());
728 std::__alloc_on_copy(_M_get_Bit_allocator(),
729 __x._M_get_Bit_allocator());
732 if (__x.size() > capacity())
734 this->_M_deallocate();
735 _M_initialize(__x.size());
737 this->_M_impl._M_finish = _M_copy_aligned(__x.begin(), __x.end(),
742 #if __cplusplus >= 201103L
744 operator=(vector&& __x) noexcept(_Bit_alloc_traits::_S_nothrow_move())
746 if (_Bit_alloc_traits::_S_propagate_on_move_assign()
747 || this->_M_get_Bit_allocator() == __x._M_get_Bit_allocator())
749 this->_M_deallocate();
750 this->_M_move_data(std::move(__x));
751 std::__alloc_on_move(_M_get_Bit_allocator(),
752 __x._M_get_Bit_allocator());
756 if (__x.size() > capacity())
758 this->_M_deallocate();
759 _M_initialize(__x.size());
761 this->_M_impl._M_finish = _M_copy_aligned(__x.begin(), __x.end(),
769 operator=(initializer_list<bool> __l)
771 this->assign (__l.begin(), __l.end());
776 // assign(), a generalized assignment member function. Two
777 // versions: one that takes a count, and one that takes a range.
778 // The range version is a member template, so we dispatch on whether
779 // or not the type is an integer.
781 assign(size_type __n, const bool& __x)
782 { _M_fill_assign(__n, __x); }
784 #if __cplusplus >= 201103L
785 template<typename _InputIterator,
786 typename = std::_RequireInputIter<_InputIterator>>
788 assign(_InputIterator __first, _InputIterator __last)
789 { _M_assign_aux(__first, __last, std::__iterator_category(__first)); }
791 template<typename _InputIterator>
793 assign(_InputIterator __first, _InputIterator __last)
795 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
796 _M_assign_dispatch(__first, __last, _Integral());
800 #if __cplusplus >= 201103L
802 assign(initializer_list<bool> __l)
803 { _M_assign_aux(__l.begin(), __l.end(), random_access_iterator_tag()); }
807 begin() _GLIBCXX_NOEXCEPT
808 { return this->_M_impl._M_start; }
811 begin() const _GLIBCXX_NOEXCEPT
812 { return this->_M_impl._M_start; }
815 end() _GLIBCXX_NOEXCEPT
816 { return this->_M_impl._M_finish; }
819 end() const _GLIBCXX_NOEXCEPT
820 { return this->_M_impl._M_finish; }
823 rbegin() _GLIBCXX_NOEXCEPT
824 { return reverse_iterator(end()); }
826 const_reverse_iterator
827 rbegin() const _GLIBCXX_NOEXCEPT
828 { return const_reverse_iterator(end()); }
831 rend() _GLIBCXX_NOEXCEPT
832 { return reverse_iterator(begin()); }
834 const_reverse_iterator
835 rend() const _GLIBCXX_NOEXCEPT
836 { return const_reverse_iterator(begin()); }
838 #if __cplusplus >= 201103L
840 cbegin() const noexcept
841 { return this->_M_impl._M_start; }
844 cend() const noexcept
845 { return this->_M_impl._M_finish; }
847 const_reverse_iterator
848 crbegin() const noexcept
849 { return const_reverse_iterator(end()); }
851 const_reverse_iterator
852 crend() const noexcept
853 { return const_reverse_iterator(begin()); }
857 size() const _GLIBCXX_NOEXCEPT
858 { return size_type(end() - begin()); }
861 max_size() const _GLIBCXX_NOEXCEPT
863 const size_type __isize =
864 __gnu_cxx::__numeric_traits<difference_type>::__max
865 - int(_S_word_bit) + 1;
866 const size_type __asize
867 = _Bit_alloc_traits::max_size(_M_get_Bit_allocator());
868 return (__asize <= __isize / int(_S_word_bit)
869 ? __asize * int(_S_word_bit) : __isize);
873 capacity() const _GLIBCXX_NOEXCEPT
874 { return size_type(const_iterator(this->_M_impl._M_end_addr(), 0)
878 empty() const _GLIBCXX_NOEXCEPT
879 { return begin() == end(); }
882 operator[](size_type __n)
884 return *iterator(this->_M_impl._M_start._M_p
885 + __n / int(_S_word_bit), __n % int(_S_word_bit));
889 operator[](size_type __n) const
891 return *const_iterator(this->_M_impl._M_start._M_p
892 + __n / int(_S_word_bit), __n % int(_S_word_bit));
897 _M_range_check(size_type __n) const
899 if (__n >= this->size())
900 __throw_out_of_range_fmt(__N("vector<bool>::_M_range_check: __n "
901 "(which is %zu) >= this->size() "
909 { _M_range_check(__n); return (*this)[__n]; }
912 at(size_type __n) const
913 { _M_range_check(__n); return (*this)[__n]; }
916 reserve(size_type __n)
918 if (__n > max_size())
919 __throw_length_error(__N("vector::reserve"));
920 if (capacity() < __n)
934 { return *(end() - 1); }
938 { return *(end() - 1); }
940 // _GLIBCXX_RESOLVE_LIB_DEFECTS
941 // DR 464. Suggestion for new member functions in standard containers.
942 // N.B. DR 464 says nothing about vector<bool> but we need something
943 // here due to the way we are implementing DR 464 in the debug-mode
946 data() _GLIBCXX_NOEXCEPT { }
951 if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_addr())
952 *this->_M_impl._M_finish++ = __x;
954 _M_insert_aux(end(), __x);
958 swap(vector& __x) _GLIBCXX_NOEXCEPT
960 std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
961 std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
962 std::swap(this->_M_impl._M_end_of_storage,
963 __x._M_impl._M_end_of_storage);
964 _Bit_alloc_traits::_S_on_swap(_M_get_Bit_allocator(),
965 __x._M_get_Bit_allocator());
968 // [23.2.5]/1, third-to-last entry in synopsis listing
970 swap(reference __x, reference __y) _GLIBCXX_NOEXCEPT
978 #if __cplusplus >= 201103L
979 insert(const_iterator __position, const bool& __x = bool())
981 insert(iterator __position, const bool& __x = bool())
984 const difference_type __n = __position - begin();
985 if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_addr()
986 && __position == end())
987 *this->_M_impl._M_finish++ = __x;
989 _M_insert_aux(__position._M_const_cast(), __x);
990 return begin() + __n;
993 #if __cplusplus >= 201103L
994 template<typename _InputIterator,
995 typename = std::_RequireInputIter<_InputIterator>>
997 insert(const_iterator __position,
998 _InputIterator __first, _InputIterator __last)
1000 difference_type __offset = __position - cbegin();
1001 _M_insert_dispatch(__position._M_const_cast(),
1002 __first, __last, __false_type());
1003 return begin() + __offset;
1006 template<typename _InputIterator>
1008 insert(iterator __position,
1009 _InputIterator __first, _InputIterator __last)
1011 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
1012 _M_insert_dispatch(__position, __first, __last, _Integral());
1016 #if __cplusplus >= 201103L
1018 insert(const_iterator __position, size_type __n, const bool& __x)
1020 difference_type __offset = __position - cbegin();
1021 _M_fill_insert(__position._M_const_cast(), __n, __x);
1022 return begin() + __offset;
1026 insert(iterator __position, size_type __n, const bool& __x)
1027 { _M_fill_insert(__position, __n, __x); }
1030 #if __cplusplus >= 201103L
1032 insert(const_iterator __p, initializer_list<bool> __l)
1033 { return this->insert(__p, __l.begin(), __l.end()); }
1038 { --this->_M_impl._M_finish; }
1041 #if __cplusplus >= 201103L
1042 erase(const_iterator __position)
1044 erase(iterator __position)
1046 { return _M_erase(__position._M_const_cast()); }
1049 #if __cplusplus >= 201103L
1050 erase(const_iterator __first, const_iterator __last)
1052 erase(iterator __first, iterator __last)
1054 { return _M_erase(__first._M_const_cast(), __last._M_const_cast()); }
1057 resize(size_type __new_size, bool __x = bool())
1059 if (__new_size < size())
1060 _M_erase_at_end(begin() + difference_type(__new_size));
1062 insert(end(), __new_size - size(), __x);
1065 #if __cplusplus >= 201103L
1068 { _M_shrink_to_fit(); }
1072 flip() _GLIBCXX_NOEXCEPT
1074 _Bit_type * const __end = this->_M_impl._M_end_addr();
1075 for (_Bit_type * __p = this->_M_impl._M_start._M_p; __p != __end; ++__p)
1080 clear() _GLIBCXX_NOEXCEPT
1081 { _M_erase_at_end(begin()); }
1083 #if __cplusplus >= 201103L
1084 template<typename... _Args>
1085 #if __cplusplus > 201402L
1090 emplace_back(_Args&&... __args)
1092 push_back(bool(__args...));
1093 #if __cplusplus > 201402L
1098 template<typename... _Args>
1100 emplace(const_iterator __pos, _Args&&... __args)
1101 { return insert(__pos, bool(__args...)); }
1105 // Precondition: __first._M_offset == 0 && __result._M_offset == 0.
1107 _M_copy_aligned(const_iterator __first, const_iterator __last,
1110 _Bit_type* __q = std::copy(__first._M_p, __last._M_p, __result._M_p);
1111 return std::copy(const_iterator(__last._M_p, 0), __last,
1116 _M_initialize(size_type __n)
1120 _Bit_pointer __q = this->_M_allocate(__n);
1121 this->_M_impl._M_end_of_storage = __q + _S_nword(__n);
1122 this->_M_impl._M_start = iterator(std::__addressof(*__q), 0);
1126 this->_M_impl._M_end_of_storage = _Bit_pointer();
1127 this->_M_impl._M_start = iterator(0, 0);
1129 this->_M_impl._M_finish = this->_M_impl._M_start + difference_type(__n);
1134 _M_initialize_value(bool __x)
1136 if (_Bit_type* __p = this->_M_impl._M_start._M_p)
1137 __builtin_memset(__p, __x ? ~0 : 0,
1138 (this->_M_impl._M_end_addr() - __p)
1139 * sizeof(_Bit_type));
1143 _M_reallocate(size_type __n);
1145 #if __cplusplus >= 201103L
1150 // Check whether it's an integral type. If so, it's not an iterator.
1152 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1153 // 438. Ambiguity in the "do the right thing" clause
1154 template<typename _Integer>
1156 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)
1158 _M_initialize(static_cast<size_type>(__n));
1159 _M_initialize_value(__x);
1162 template<typename _InputIterator>
1164 _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
1166 { _M_initialize_range(__first, __last,
1167 std::__iterator_category(__first)); }
1169 template<typename _InputIterator>
1171 _M_initialize_range(_InputIterator __first, _InputIterator __last,
1172 std::input_iterator_tag)
1174 for (; __first != __last; ++__first)
1175 push_back(*__first);
1178 template<typename _ForwardIterator>
1180 _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last,
1181 std::forward_iterator_tag)
1183 const size_type __n = std::distance(__first, __last);
1185 std::copy(__first, __last, this->_M_impl._M_start);
1188 #if __cplusplus < 201103L
1189 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1190 // 438. Ambiguity in the "do the right thing" clause
1191 template<typename _Integer>
1193 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
1194 { _M_fill_assign(__n, __val); }
1196 template<class _InputIterator>
1198 _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
1200 { _M_assign_aux(__first, __last, std::__iterator_category(__first)); }
1204 _M_fill_assign(size_t __n, bool __x)
1208 _M_initialize_value(__x);
1209 insert(end(), __n - size(), __x);
1213 _M_erase_at_end(begin() + __n);
1214 _M_initialize_value(__x);
1218 template<typename _InputIterator>
1220 _M_assign_aux(_InputIterator __first, _InputIterator __last,
1221 std::input_iterator_tag)
1223 iterator __cur = begin();
1224 for (; __first != __last && __cur != end(); ++__cur, ++__first)
1226 if (__first == __last)
1227 _M_erase_at_end(__cur);
1229 insert(end(), __first, __last);
1232 template<typename _ForwardIterator>
1234 _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
1235 std::forward_iterator_tag)
1237 const size_type __len = std::distance(__first, __last);
1239 _M_erase_at_end(std::copy(__first, __last, begin()));
1242 _ForwardIterator __mid = __first;
1243 std::advance(__mid, size());
1244 std::copy(__first, __mid, begin());
1245 insert(end(), __mid, __last);
1249 // Check whether it's an integral type. If so, it's not an iterator.
1251 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1252 // 438. Ambiguity in the "do the right thing" clause
1253 template<typename _Integer>
1255 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
1257 { _M_fill_insert(__pos, __n, __x); }
1259 template<typename _InputIterator>
1261 _M_insert_dispatch(iterator __pos,
1262 _InputIterator __first, _InputIterator __last,
1264 { _M_insert_range(__pos, __first, __last,
1265 std::__iterator_category(__first)); }
1268 _M_fill_insert(iterator __position, size_type __n, bool __x);
1270 template<typename _InputIterator>
1272 _M_insert_range(iterator __pos, _InputIterator __first,
1273 _InputIterator __last, std::input_iterator_tag)
1275 for (; __first != __last; ++__first)
1277 __pos = insert(__pos, *__first);
1282 template<typename _ForwardIterator>
1284 _M_insert_range(iterator __position, _ForwardIterator __first,
1285 _ForwardIterator __last, std::forward_iterator_tag);
1288 _M_insert_aux(iterator __position, bool __x);
1291 _M_check_len(size_type __n, const char* __s) const
1293 if (max_size() - size() < __n)
1294 __throw_length_error(__N(__s));
1296 const size_type __len = size() + std::max(size(), __n);
1297 return (__len < size() || __len > max_size()) ? max_size() : __len;
1301 _M_erase_at_end(iterator __pos)
1302 { this->_M_impl._M_finish = __pos; }
1305 _M_erase(iterator __pos);
1308 _M_erase(iterator __first, iterator __last);
1311 _GLIBCXX_END_NAMESPACE_CONTAINER
1312 _GLIBCXX_END_NAMESPACE_VERSION
1315 #if __cplusplus >= 201103L
1317 namespace std _GLIBCXX_VISIBILITY(default)
1319 _GLIBCXX_BEGIN_NAMESPACE_VERSION
1322 /// std::hash specialization for vector<bool>.
1323 template<typename _Alloc>
1324 struct hash<_GLIBCXX_STD_C::vector<bool, _Alloc>>
1325 : public __hash_base<size_t, _GLIBCXX_STD_C::vector<bool, _Alloc>>
1328 operator()(const _GLIBCXX_STD_C::vector<bool, _Alloc>&) const noexcept;
1331 _GLIBCXX_END_NAMESPACE_VERSION