1 // vector<bool> specialization -*- C++ -*-
3 // Copyright (C) 2001-2015 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>
63 namespace std _GLIBCXX_VISIBILITY(default)
65 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
67 typedef unsigned long _Bit_type;
68 enum { _S_word_bit = int(__CHAR_BIT__ * sizeof(_Bit_type)) };
75 _Bit_reference(_Bit_type * __x, _Bit_type __y)
76 : _M_p(__x), _M_mask(__y) { }
78 _Bit_reference() _GLIBCXX_NOEXCEPT : _M_p(0), _M_mask(0) { }
80 operator bool() const _GLIBCXX_NOEXCEPT
81 { return !!(*_M_p & _M_mask); }
84 operator=(bool __x) _GLIBCXX_NOEXCEPT
94 operator=(const _Bit_reference& __x) _GLIBCXX_NOEXCEPT
95 { return *this = bool(__x); }
98 operator==(const _Bit_reference& __x) const
99 { return bool(*this) == bool(__x); }
102 operator<(const _Bit_reference& __x) const
103 { return !bool(*this) && bool(__x); }
106 flip() _GLIBCXX_NOEXCEPT
107 { *_M_p ^= _M_mask; }
110 #if __cplusplus >= 201103L
112 swap(_Bit_reference __x, _Bit_reference __y) noexcept
120 swap(_Bit_reference __x, bool& __y) noexcept
128 swap(bool& __x, _Bit_reference __y) noexcept
136 struct _Bit_iterator_base
137 : public std::iterator<std::random_access_iterator_tag, bool>
140 unsigned int _M_offset;
142 _Bit_iterator_base(_Bit_type * __x, unsigned int __y)
143 : _M_p(__x), _M_offset(__y) { }
148 if (_M_offset++ == int(_S_word_bit) - 1)
158 if (_M_offset-- == 0)
160 _M_offset = int(_S_word_bit) - 1;
166 _M_incr(ptrdiff_t __i)
168 difference_type __n = __i + _M_offset;
169 _M_p += __n / int(_S_word_bit);
170 __n = __n % int(_S_word_bit);
173 __n += int(_S_word_bit);
176 _M_offset = static_cast<unsigned int>(__n);
180 operator==(const _Bit_iterator_base& __i) const
181 { return _M_p == __i._M_p && _M_offset == __i._M_offset; }
184 operator<(const _Bit_iterator_base& __i) const
186 return _M_p < __i._M_p
187 || (_M_p == __i._M_p && _M_offset < __i._M_offset);
191 operator!=(const _Bit_iterator_base& __i) const
192 { return !(*this == __i); }
195 operator>(const _Bit_iterator_base& __i) const
196 { return __i < *this; }
199 operator<=(const _Bit_iterator_base& __i) const
200 { return !(__i < *this); }
203 operator>=(const _Bit_iterator_base& __i) const
204 { return !(*this < __i); }
208 operator-(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)
210 return (int(_S_word_bit) * (__x._M_p - __y._M_p)
211 + __x._M_offset - __y._M_offset);
214 struct _Bit_iterator : public _Bit_iterator_base
216 typedef _Bit_reference reference;
217 typedef _Bit_reference* pointer;
218 typedef _Bit_iterator iterator;
220 _Bit_iterator() : _Bit_iterator_base(0, 0) { }
222 _Bit_iterator(_Bit_type * __x, unsigned int __y)
223 : _Bit_iterator_base(__x, __y) { }
226 _M_const_cast() const
231 { return reference(_M_p, 1UL << _M_offset); }
243 iterator __tmp = *this;
258 iterator __tmp = *this;
264 operator+=(difference_type __i)
271 operator-=(difference_type __i)
278 operator+(difference_type __i) const
280 iterator __tmp = *this;
285 operator-(difference_type __i) const
287 iterator __tmp = *this;
292 operator[](difference_type __i) const
293 { return *(*this + __i); }
297 operator+(ptrdiff_t __n, const _Bit_iterator& __x)
298 { return __x + __n; }
300 struct _Bit_const_iterator : public _Bit_iterator_base
302 typedef bool reference;
303 typedef bool const_reference;
304 typedef const bool* pointer;
305 typedef _Bit_const_iterator const_iterator;
307 _Bit_const_iterator() : _Bit_iterator_base(0, 0) { }
309 _Bit_const_iterator(_Bit_type * __x, unsigned int __y)
310 : _Bit_iterator_base(__x, __y) { }
312 _Bit_const_iterator(const _Bit_iterator& __x)
313 : _Bit_iterator_base(__x._M_p, __x._M_offset) { }
316 _M_const_cast() const
317 { return _Bit_iterator(_M_p, _M_offset); }
321 { return _Bit_reference(_M_p, 1UL << _M_offset); }
333 const_iterator __tmp = *this;
348 const_iterator __tmp = *this;
354 operator+=(difference_type __i)
361 operator-=(difference_type __i)
368 operator+(difference_type __i) const
370 const_iterator __tmp = *this;
375 operator-(difference_type __i) const
377 const_iterator __tmp = *this;
382 operator[](difference_type __i) const
383 { return *(*this + __i); }
386 inline _Bit_const_iterator
387 operator+(ptrdiff_t __n, const _Bit_const_iterator& __x)
388 { return __x + __n; }
391 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
393 for (; __first != __last; ++__first)
398 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)
400 if (__first._M_p != __last._M_p)
402 std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
403 __fill_bvector(__first, _Bit_iterator(__first._M_p + 1, 0), __x);
404 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x);
407 __fill_bvector(__first, __last, __x);
410 template<typename _Alloc>
413 typedef typename __gnu_cxx::__alloc_traits<_Alloc>::template
414 rebind<_Bit_type>::other _Bit_alloc_type;
415 typedef typename __gnu_cxx::__alloc_traits<_Bit_alloc_type>
417 typedef typename _Bit_alloc_traits::pointer _Bit_pointer;
420 : public _Bit_alloc_type
422 _Bit_iterator _M_start;
423 _Bit_iterator _M_finish;
424 _Bit_pointer _M_end_of_storage;
427 : _Bit_alloc_type(), _M_start(), _M_finish(), _M_end_of_storage()
430 _Bvector_impl(const _Bit_alloc_type& __a)
431 : _Bit_alloc_type(__a), _M_start(), _M_finish(), _M_end_of_storage()
434 #if __cplusplus >= 201103L
435 _Bvector_impl(_Bit_alloc_type&& __a)
436 : _Bit_alloc_type(std::move(__a)), _M_start(), _M_finish(),
442 _M_end_addr() const _GLIBCXX_NOEXCEPT
444 if (_M_end_of_storage)
445 return std::__addressof(_M_end_of_storage[-1]) + 1;
451 typedef _Alloc allocator_type;
454 _M_get_Bit_allocator() _GLIBCXX_NOEXCEPT
455 { return *static_cast<_Bit_alloc_type*>(&this->_M_impl); }
457 const _Bit_alloc_type&
458 _M_get_Bit_allocator() const _GLIBCXX_NOEXCEPT
459 { return *static_cast<const _Bit_alloc_type*>(&this->_M_impl); }
462 get_allocator() const _GLIBCXX_NOEXCEPT
463 { return allocator_type(_M_get_Bit_allocator()); }
468 _Bvector_base(const allocator_type& __a)
471 #if __cplusplus >= 201103L
472 _Bvector_base(_Bvector_base&& __x) noexcept
473 : _M_impl(std::move(__x._M_get_Bit_allocator()))
475 this->_M_impl._M_start = __x._M_impl._M_start;
476 this->_M_impl._M_finish = __x._M_impl._M_finish;
477 this->_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage;
478 __x._M_impl._M_start = _Bit_iterator();
479 __x._M_impl._M_finish = _Bit_iterator();
480 __x._M_impl._M_end_of_storage = nullptr;
485 { this->_M_deallocate(); }
488 _Bvector_impl _M_impl;
491 _M_allocate(size_t __n)
492 { return _Bit_alloc_traits::allocate(_M_impl, _S_nword(__n)); }
497 if (_M_impl._M_start._M_p)
499 const size_t __n = _M_impl._M_end_addr() - _M_impl._M_start._M_p;
500 _Bit_alloc_traits::deallocate(_M_impl,
501 _M_impl._M_end_of_storage - __n,
508 { return (__n + int(_S_word_bit) - 1) / int(_S_word_bit); }
511 _GLIBCXX_END_NAMESPACE_CONTAINER
514 // Declare a partial specialization of vector<T, Alloc>.
515 #include <bits/stl_vector.h>
517 namespace std _GLIBCXX_VISIBILITY(default)
519 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
522 * @brief A specialization of vector for booleans which offers fixed time
523 * access to individual elements in any order.
527 * @tparam _Alloc Allocator type.
529 * Note that vector<bool> does not actually meet the requirements for being
530 * a container. This is because the reference and pointer types are not
531 * really references and pointers to bool. See DR96 for details. @see
532 * vector for function documentation.
534 * In some terminology a %vector can be described as a dynamic
535 * C-style array, it offers fast and efficient access to individual
536 * elements in any order and saves the user from worrying about
537 * memory and size allocation. Subscripting ( @c [] ) access is
538 * also provided as with C-style arrays.
540 template<typename _Alloc>
541 class vector<bool, _Alloc> : protected _Bvector_base<_Alloc>
543 typedef _Bvector_base<_Alloc> _Base;
544 typedef typename _Base::_Bit_pointer _Bit_pointer;
545 typedef typename _Base::_Bit_alloc_traits _Bit_alloc_traits;
547 #if __cplusplus >= 201103L
548 template<typename> friend struct hash;
552 typedef bool value_type;
553 typedef size_t size_type;
554 typedef ptrdiff_t difference_type;
555 typedef _Bit_reference reference;
556 typedef bool const_reference;
557 typedef _Bit_reference* pointer;
558 typedef const bool* const_pointer;
559 typedef _Bit_iterator iterator;
560 typedef _Bit_const_iterator const_iterator;
561 typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
562 typedef std::reverse_iterator<iterator> reverse_iterator;
563 typedef _Alloc allocator_type;
565 allocator_type get_allocator() const
566 { return _Base::get_allocator(); }
569 using _Base::_M_allocate;
570 using _Base::_M_deallocate;
571 using _Base::_S_nword;
572 using _Base::_M_get_Bit_allocator;
579 vector(const allocator_type& __a)
582 #if __cplusplus >= 201103L
584 vector(size_type __n, const allocator_type& __a = allocator_type())
585 : vector(__n, false, __a)
588 vector(size_type __n, const bool& __value,
589 const allocator_type& __a = allocator_type())
593 std::fill(this->_M_impl._M_start._M_p, this->_M_impl._M_end_addr(),
598 vector(size_type __n, const bool& __value = bool(),
599 const allocator_type& __a = allocator_type())
603 std::fill(this->_M_impl._M_start._M_p, this->_M_impl._M_end_addr(),
608 vector(const vector& __x)
609 : _Base(_Bit_alloc_traits::_S_select_on_copy(__x._M_get_Bit_allocator()))
611 _M_initialize(__x.size());
612 _M_copy_aligned(__x.begin(), __x.end(), this->_M_impl._M_start);
615 #if __cplusplus >= 201103L
616 vector(vector&& __x) noexcept
617 : _Base(std::move(__x)) { }
619 vector(vector&& __x, const allocator_type& __a)
620 noexcept(_Bit_alloc_traits::_S_always_equal())
623 if (__x.get_allocator() == __a)
625 this->_M_impl._M_start = __x._M_impl._M_start;
626 this->_M_impl._M_finish = __x._M_impl._M_finish;
627 this->_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage;
628 __x._M_impl._M_start = _Bit_iterator();
629 __x._M_impl._M_finish = _Bit_iterator();
630 __x._M_impl._M_end_of_storage = nullptr;
634 _M_initialize(__x.size());
635 _M_copy_aligned(__x.begin(), __x.end(), begin());
640 vector(const vector& __x, const allocator_type& __a)
643 _M_initialize(__x.size());
644 _M_copy_aligned(__x.begin(), __x.end(), this->_M_impl._M_start);
647 vector(initializer_list<bool> __l,
648 const allocator_type& __a = allocator_type())
651 _M_initialize_range(__l.begin(), __l.end(),
652 random_access_iterator_tag());
656 #if __cplusplus >= 201103L
657 template<typename _InputIterator,
658 typename = std::_RequireInputIter<_InputIterator>>
659 vector(_InputIterator __first, _InputIterator __last,
660 const allocator_type& __a = allocator_type())
662 { _M_initialize_dispatch(__first, __last, __false_type()); }
664 template<typename _InputIterator>
665 vector(_InputIterator __first, _InputIterator __last,
666 const allocator_type& __a = allocator_type())
669 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
670 _M_initialize_dispatch(__first, __last, _Integral());
674 ~vector() _GLIBCXX_NOEXCEPT { }
677 operator=(const vector& __x)
681 #if __cplusplus >= 201103L
682 if (_Bit_alloc_traits::_S_propagate_on_copy_assign())
684 if (this->_M_get_Bit_allocator() != __x._M_get_Bit_allocator())
686 this->_M_deallocate();
687 std::__alloc_on_copy(_M_get_Bit_allocator(),
688 __x._M_get_Bit_allocator());
689 _M_initialize(__x.size());
692 std::__alloc_on_copy(_M_get_Bit_allocator(),
693 __x._M_get_Bit_allocator());
696 if (__x.size() > capacity())
698 this->_M_deallocate();
699 _M_initialize(__x.size());
701 this->_M_impl._M_finish = _M_copy_aligned(__x.begin(), __x.end(),
706 #if __cplusplus >= 201103L
708 operator=(vector&& __x) noexcept(_Bit_alloc_traits::_S_nothrow_move())
710 if (_Bit_alloc_traits::_S_propagate_on_move_assign()
711 || this->_M_get_Bit_allocator() == __x._M_get_Bit_allocator())
713 this->_M_deallocate();
714 this->_M_impl._M_start = __x._M_impl._M_start;
715 this->_M_impl._M_finish = __x._M_impl._M_finish;
716 this->_M_impl._M_end_of_storage = __x._M_impl._M_end_of_storage;
717 __x._M_impl._M_start = _Bit_iterator();
718 __x._M_impl._M_finish = _Bit_iterator();
719 __x._M_impl._M_end_of_storage = nullptr;
720 std::__alloc_on_move(_M_get_Bit_allocator(),
721 __x._M_get_Bit_allocator());
725 if (__x.size() > capacity())
727 this->_M_deallocate();
728 _M_initialize(__x.size());
730 this->_M_impl._M_finish = _M_copy_aligned(__x.begin(), __x.end(),
738 operator=(initializer_list<bool> __l)
740 this->assign (__l.begin(), __l.end());
745 // assign(), a generalized assignment member function. Two
746 // versions: one that takes a count, and one that takes a range.
747 // The range version is a member template, so we dispatch on whether
748 // or not the type is an integer.
750 assign(size_type __n, const bool& __x)
751 { _M_fill_assign(__n, __x); }
753 #if __cplusplus >= 201103L
754 template<typename _InputIterator,
755 typename = std::_RequireInputIter<_InputIterator>>
757 assign(_InputIterator __first, _InputIterator __last)
758 { _M_assign_dispatch(__first, __last, __false_type()); }
760 template<typename _InputIterator>
762 assign(_InputIterator __first, _InputIterator __last)
764 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
765 _M_assign_dispatch(__first, __last, _Integral());
769 #if __cplusplus >= 201103L
771 assign(initializer_list<bool> __l)
772 { this->assign(__l.begin(), __l.end()); }
776 begin() _GLIBCXX_NOEXCEPT
777 { return this->_M_impl._M_start; }
780 begin() const _GLIBCXX_NOEXCEPT
781 { return this->_M_impl._M_start; }
784 end() _GLIBCXX_NOEXCEPT
785 { return this->_M_impl._M_finish; }
788 end() const _GLIBCXX_NOEXCEPT
789 { return this->_M_impl._M_finish; }
792 rbegin() _GLIBCXX_NOEXCEPT
793 { return reverse_iterator(end()); }
795 const_reverse_iterator
796 rbegin() const _GLIBCXX_NOEXCEPT
797 { return const_reverse_iterator(end()); }
800 rend() _GLIBCXX_NOEXCEPT
801 { return reverse_iterator(begin()); }
803 const_reverse_iterator
804 rend() const _GLIBCXX_NOEXCEPT
805 { return const_reverse_iterator(begin()); }
807 #if __cplusplus >= 201103L
809 cbegin() const noexcept
810 { return this->_M_impl._M_start; }
813 cend() const noexcept
814 { return this->_M_impl._M_finish; }
816 const_reverse_iterator
817 crbegin() const noexcept
818 { return const_reverse_iterator(end()); }
820 const_reverse_iterator
821 crend() const noexcept
822 { return const_reverse_iterator(begin()); }
826 size() const _GLIBCXX_NOEXCEPT
827 { return size_type(end() - begin()); }
830 max_size() const _GLIBCXX_NOEXCEPT
832 const size_type __isize =
833 __gnu_cxx::__numeric_traits<difference_type>::__max
834 - int(_S_word_bit) + 1;
835 const size_type __asize
836 = _Bit_alloc_traits::max_size(_M_get_Bit_allocator());
837 return (__asize <= __isize / int(_S_word_bit)
838 ? __asize * int(_S_word_bit) : __isize);
842 capacity() const _GLIBCXX_NOEXCEPT
843 { return size_type(const_iterator(this->_M_impl._M_end_addr(), 0)
847 empty() const _GLIBCXX_NOEXCEPT
848 { return begin() == end(); }
851 operator[](size_type __n)
853 return *iterator(this->_M_impl._M_start._M_p
854 + __n / int(_S_word_bit), __n % int(_S_word_bit));
858 operator[](size_type __n) const
860 return *const_iterator(this->_M_impl._M_start._M_p
861 + __n / int(_S_word_bit), __n % int(_S_word_bit));
866 _M_range_check(size_type __n) const
868 if (__n >= this->size())
869 __throw_out_of_range_fmt(__N("vector<bool>::_M_range_check: __n "
870 "(which is %zu) >= this->size() "
878 { _M_range_check(__n); return (*this)[__n]; }
881 at(size_type __n) const
882 { _M_range_check(__n); return (*this)[__n]; }
885 reserve(size_type __n)
887 if (__n > max_size())
888 __throw_length_error(__N("vector::reserve"));
889 if (capacity() < __n)
903 { return *(end() - 1); }
907 { return *(end() - 1); }
909 // _GLIBCXX_RESOLVE_LIB_DEFECTS
910 // DR 464. Suggestion for new member functions in standard containers.
911 // N.B. DR 464 says nothing about vector<bool> but we need something
912 // here due to the way we are implementing DR 464 in the debug-mode
915 data() _GLIBCXX_NOEXCEPT { }
920 if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_addr())
921 *this->_M_impl._M_finish++ = __x;
923 _M_insert_aux(end(), __x);
928 #if __cplusplus >= 201103L
929 noexcept(_Bit_alloc_traits::_S_nothrow_swap())
932 std::swap(this->_M_impl._M_start, __x._M_impl._M_start);
933 std::swap(this->_M_impl._M_finish, __x._M_impl._M_finish);
934 std::swap(this->_M_impl._M_end_of_storage,
935 __x._M_impl._M_end_of_storage);
936 _Bit_alloc_traits::_S_on_swap(_M_get_Bit_allocator(),
937 __x._M_get_Bit_allocator());
940 // [23.2.5]/1, third-to-last entry in synopsis listing
942 swap(reference __x, reference __y) _GLIBCXX_NOEXCEPT
950 #if __cplusplus >= 201103L
951 insert(const_iterator __position, const bool& __x = bool())
953 insert(iterator __position, const bool& __x = bool())
956 const difference_type __n = __position - begin();
957 if (this->_M_impl._M_finish._M_p != this->_M_impl._M_end_addr()
958 && __position == end())
959 *this->_M_impl._M_finish++ = __x;
961 _M_insert_aux(__position._M_const_cast(), __x);
962 return begin() + __n;
965 #if __cplusplus >= 201103L
966 template<typename _InputIterator,
967 typename = std::_RequireInputIter<_InputIterator>>
969 insert(const_iterator __position,
970 _InputIterator __first, _InputIterator __last)
972 difference_type __offset = __position - cbegin();
973 _M_insert_dispatch(__position._M_const_cast(),
974 __first, __last, __false_type());
975 return begin() + __offset;
978 template<typename _InputIterator>
980 insert(iterator __position,
981 _InputIterator __first, _InputIterator __last)
983 typedef typename std::__is_integer<_InputIterator>::__type _Integral;
984 _M_insert_dispatch(__position, __first, __last, _Integral());
988 #if __cplusplus >= 201103L
990 insert(const_iterator __position, size_type __n, const bool& __x)
992 difference_type __offset = __position - cbegin();
993 _M_fill_insert(__position._M_const_cast(), __n, __x);
994 return begin() + __offset;
998 insert(iterator __position, size_type __n, const bool& __x)
999 { _M_fill_insert(__position, __n, __x); }
1002 #if __cplusplus >= 201103L
1004 insert(const_iterator __p, initializer_list<bool> __l)
1005 { return this->insert(__p, __l.begin(), __l.end()); }
1010 { --this->_M_impl._M_finish; }
1013 #if __cplusplus >= 201103L
1014 erase(const_iterator __position)
1016 erase(iterator __position)
1018 { return _M_erase(__position._M_const_cast()); }
1021 #if __cplusplus >= 201103L
1022 erase(const_iterator __first, const_iterator __last)
1024 erase(iterator __first, iterator __last)
1026 { return _M_erase(__first._M_const_cast(), __last._M_const_cast()); }
1029 resize(size_type __new_size, bool __x = bool())
1031 if (__new_size < size())
1032 _M_erase_at_end(begin() + difference_type(__new_size));
1034 insert(end(), __new_size - size(), __x);
1037 #if __cplusplus >= 201103L
1040 { _M_shrink_to_fit(); }
1044 flip() _GLIBCXX_NOEXCEPT
1046 _Bit_type * const __end = this->_M_impl._M_end_addr();
1047 for (_Bit_type * __p = this->_M_impl._M_start._M_p; __p != __end; ++__p)
1052 clear() _GLIBCXX_NOEXCEPT
1053 { _M_erase_at_end(begin()); }
1055 #if __cplusplus >= 201103L
1056 template<typename... _Args>
1058 emplace_back(_Args&&... __args)
1059 { push_back(bool(__args...)); }
1061 template<typename... _Args>
1063 emplace(const_iterator __pos, _Args&&... __args)
1064 { return insert(__pos, bool(__args...)); }
1068 // Precondition: __first._M_offset == 0 && __result._M_offset == 0.
1070 _M_copy_aligned(const_iterator __first, const_iterator __last,
1073 _Bit_type* __q = std::copy(__first._M_p, __last._M_p, __result._M_p);
1074 return std::copy(const_iterator(__last._M_p, 0), __last,
1079 _M_initialize(size_type __n)
1081 _Bit_pointer __q = this->_M_allocate(__n);
1082 this->_M_impl._M_end_of_storage = __q + _S_nword(__n);
1083 this->_M_impl._M_start = iterator(std::__addressof(*__q), 0);
1084 this->_M_impl._M_finish = this->_M_impl._M_start + difference_type(__n);
1088 _M_reallocate(size_type __n);
1090 #if __cplusplus >= 201103L
1095 // Check whether it's an integral type. If so, it's not an iterator.
1097 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1098 // 438. Ambiguity in the "do the right thing" clause
1099 template<typename _Integer>
1101 _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type)
1103 _M_initialize(static_cast<size_type>(__n));
1104 std::fill(this->_M_impl._M_start._M_p,
1105 this->_M_impl._M_end_addr(), __x ? ~0 : 0);
1108 template<typename _InputIterator>
1110 _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
1112 { _M_initialize_range(__first, __last,
1113 std::__iterator_category(__first)); }
1115 template<typename _InputIterator>
1117 _M_initialize_range(_InputIterator __first, _InputIterator __last,
1118 std::input_iterator_tag)
1120 for (; __first != __last; ++__first)
1121 push_back(*__first);
1124 template<typename _ForwardIterator>
1126 _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last,
1127 std::forward_iterator_tag)
1129 const size_type __n = std::distance(__first, __last);
1131 std::copy(__first, __last, this->_M_impl._M_start);
1134 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1135 // 438. Ambiguity in the "do the right thing" clause
1136 template<typename _Integer>
1138 _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
1139 { _M_fill_assign(__n, __val); }
1141 template<class _InputIterator>
1143 _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
1145 { _M_assign_aux(__first, __last, std::__iterator_category(__first)); }
1148 _M_fill_assign(size_t __n, bool __x)
1152 std::fill(this->_M_impl._M_start._M_p,
1153 this->_M_impl._M_end_addr(), __x ? ~0 : 0);
1154 insert(end(), __n - size(), __x);
1158 _M_erase_at_end(begin() + __n);
1159 std::fill(this->_M_impl._M_start._M_p,
1160 this->_M_impl._M_end_addr(), __x ? ~0 : 0);
1164 template<typename _InputIterator>
1166 _M_assign_aux(_InputIterator __first, _InputIterator __last,
1167 std::input_iterator_tag)
1169 iterator __cur = begin();
1170 for (; __first != __last && __cur != end(); ++__cur, ++__first)
1172 if (__first == __last)
1173 _M_erase_at_end(__cur);
1175 insert(end(), __first, __last);
1178 template<typename _ForwardIterator>
1180 _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
1181 std::forward_iterator_tag)
1183 const size_type __len = std::distance(__first, __last);
1185 _M_erase_at_end(std::copy(__first, __last, begin()));
1188 _ForwardIterator __mid = __first;
1189 std::advance(__mid, size());
1190 std::copy(__first, __mid, begin());
1191 insert(end(), __mid, __last);
1195 // Check whether it's an integral type. If so, it's not an iterator.
1197 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1198 // 438. Ambiguity in the "do the right thing" clause
1199 template<typename _Integer>
1201 _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
1203 { _M_fill_insert(__pos, __n, __x); }
1205 template<typename _InputIterator>
1207 _M_insert_dispatch(iterator __pos,
1208 _InputIterator __first, _InputIterator __last,
1210 { _M_insert_range(__pos, __first, __last,
1211 std::__iterator_category(__first)); }
1214 _M_fill_insert(iterator __position, size_type __n, bool __x);
1216 template<typename _InputIterator>
1218 _M_insert_range(iterator __pos, _InputIterator __first,
1219 _InputIterator __last, std::input_iterator_tag)
1221 for (; __first != __last; ++__first)
1223 __pos = insert(__pos, *__first);
1228 template<typename _ForwardIterator>
1230 _M_insert_range(iterator __position, _ForwardIterator __first,
1231 _ForwardIterator __last, std::forward_iterator_tag);
1234 _M_insert_aux(iterator __position, bool __x);
1237 _M_check_len(size_type __n, const char* __s) const
1239 if (max_size() - size() < __n)
1240 __throw_length_error(__N(__s));
1242 const size_type __len = size() + std::max(size(), __n);
1243 return (__len < size() || __len > max_size()) ? max_size() : __len;
1247 _M_erase_at_end(iterator __pos)
1248 { this->_M_impl._M_finish = __pos; }
1251 _M_erase(iterator __pos);
1254 _M_erase(iterator __first, iterator __last);
1257 _GLIBCXX_END_NAMESPACE_CONTAINER
1260 #if __cplusplus >= 201103L
1262 #include <bits/functional_hash.h>
1264 namespace std _GLIBCXX_VISIBILITY(default)
1266 _GLIBCXX_BEGIN_NAMESPACE_VERSION
1269 /// std::hash specialization for vector<bool>.
1270 template<typename _Alloc>
1271 struct hash<_GLIBCXX_STD_C::vector<bool, _Alloc>>
1272 : public __hash_base<size_t, _GLIBCXX_STD_C::vector<bool, _Alloc>>
1275 operator()(const _GLIBCXX_STD_C::vector<bool, _Alloc>&) const noexcept;
1278 _GLIBCXX_END_NAMESPACE_VERSION