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 #if __cplusplus >= 201103L
83 _Bit_reference(const _Bit_reference
&) = default;
86 operator bool() const _GLIBCXX_NOEXCEPT
87 { return !!(*_M_p
& _M_mask
); }
90 operator=(bool __x
) _GLIBCXX_NOEXCEPT
100 operator=(const _Bit_reference
& __x
) _GLIBCXX_NOEXCEPT
101 { return *this = bool(__x
); }
104 operator==(const _Bit_reference
& __x
) const
105 { return bool(*this) == bool(__x
); }
108 operator<(const _Bit_reference
& __x
) const
109 { return !bool(*this) && bool(__x
); }
112 flip() _GLIBCXX_NOEXCEPT
113 { *_M_p
^= _M_mask
; }
116 #if __cplusplus >= 201103L
118 swap(_Bit_reference __x
, _Bit_reference __y
) noexcept
126 swap(_Bit_reference __x
, bool& __y
) noexcept
134 swap(bool& __x
, _Bit_reference __y
) noexcept
142 struct _Bit_iterator_base
143 : public std::iterator
<std::random_access_iterator_tag
, bool>
146 unsigned int _M_offset
;
148 _Bit_iterator_base(_Bit_type
* __x
, unsigned int __y
)
149 : _M_p(__x
), _M_offset(__y
) { }
154 if (_M_offset
++ == int(_S_word_bit
) - 1)
164 if (_M_offset
-- == 0)
166 _M_offset
= int(_S_word_bit
) - 1;
172 _M_incr(ptrdiff_t __i
)
174 difference_type __n
= __i
+ _M_offset
;
175 _M_p
+= __n
/ int(_S_word_bit
);
176 __n
= __n
% int(_S_word_bit
);
179 __n
+= int(_S_word_bit
);
182 _M_offset
= static_cast<unsigned int>(__n
);
186 operator==(const _Bit_iterator_base
& __i
) const
187 { return _M_p
== __i
._M_p
&& _M_offset
== __i
._M_offset
; }
190 operator<(const _Bit_iterator_base
& __i
) const
192 return _M_p
< __i
._M_p
193 || (_M_p
== __i
._M_p
&& _M_offset
< __i
._M_offset
);
197 operator!=(const _Bit_iterator_base
& __i
) const
198 { return !(*this == __i
); }
201 operator>(const _Bit_iterator_base
& __i
) const
202 { return __i
< *this; }
205 operator<=(const _Bit_iterator_base
& __i
) const
206 { return !(__i
< *this); }
209 operator>=(const _Bit_iterator_base
& __i
) const
210 { return !(*this < __i
); }
214 operator-(const _Bit_iterator_base
& __x
, const _Bit_iterator_base
& __y
)
216 return (int(_S_word_bit
) * (__x
._M_p
- __y
._M_p
)
217 + __x
._M_offset
- __y
._M_offset
);
220 struct _Bit_iterator
: public _Bit_iterator_base
222 typedef _Bit_reference reference
;
223 typedef _Bit_reference
* pointer
;
224 typedef _Bit_iterator iterator
;
226 _Bit_iterator() : _Bit_iterator_base(0, 0) { }
228 _Bit_iterator(_Bit_type
* __x
, unsigned int __y
)
229 : _Bit_iterator_base(__x
, __y
) { }
232 _M_const_cast() const
237 { return reference(_M_p
, 1UL << _M_offset
); }
249 iterator __tmp
= *this;
264 iterator __tmp
= *this;
270 operator+=(difference_type __i
)
277 operator-=(difference_type __i
)
284 operator+(difference_type __i
) const
286 iterator __tmp
= *this;
291 operator-(difference_type __i
) const
293 iterator __tmp
= *this;
298 operator[](difference_type __i
) const
299 { return *(*this + __i
); }
303 operator+(ptrdiff_t __n
, const _Bit_iterator
& __x
)
304 { return __x
+ __n
; }
306 struct _Bit_const_iterator
: public _Bit_iterator_base
308 typedef bool reference
;
309 typedef bool const_reference
;
310 typedef const bool* pointer
;
311 typedef _Bit_const_iterator const_iterator
;
313 _Bit_const_iterator() : _Bit_iterator_base(0, 0) { }
315 _Bit_const_iterator(_Bit_type
* __x
, unsigned int __y
)
316 : _Bit_iterator_base(__x
, __y
) { }
318 _Bit_const_iterator(const _Bit_iterator
& __x
)
319 : _Bit_iterator_base(__x
._M_p
, __x
._M_offset
) { }
322 _M_const_cast() const
323 { return _Bit_iterator(_M_p
, _M_offset
); }
327 { return _Bit_reference(_M_p
, 1UL << _M_offset
); }
339 const_iterator __tmp
= *this;
354 const_iterator __tmp
= *this;
360 operator+=(difference_type __i
)
367 operator-=(difference_type __i
)
374 operator+(difference_type __i
) const
376 const_iterator __tmp
= *this;
381 operator-(difference_type __i
) const
383 const_iterator __tmp
= *this;
388 operator[](difference_type __i
) const
389 { return *(*this + __i
); }
392 inline _Bit_const_iterator
393 operator+(ptrdiff_t __n
, const _Bit_const_iterator
& __x
)
394 { return __x
+ __n
; }
397 __fill_bvector(_Bit_type
* __v
,
398 unsigned int __first
, unsigned int __last
, bool __x
)
400 const _Bit_type __fmask
= ~0ul << __first
;
401 const _Bit_type __lmask
= ~0ul >> (_S_word_bit
- __last
);
402 const _Bit_type __mask
= __fmask
& __lmask
;
411 fill(_Bit_iterator __first
, _Bit_iterator __last
, const bool& __x
)
413 if (__first
._M_p
!= __last
._M_p
)
415 _Bit_type
* __first_p
= __first
._M_p
;
416 if (__first
._M_offset
!= 0)
417 __fill_bvector(__first_p
++, __first
._M_offset
, _S_word_bit
, __x
);
419 __builtin_memset(__first_p
, __x
? ~0 : 0,
420 (__last
._M_p
- __first_p
) * sizeof(_Bit_type
));
422 if (__last
._M_offset
!= 0)
423 __fill_bvector(__last
._M_p
, 0, __last
._M_offset
, __x
);
425 else if (__first
._M_offset
!= __last
._M_offset
)
426 __fill_bvector(__first
._M_p
, __first
._M_offset
, __last
._M_offset
, __x
);
429 template<typename _Alloc
>
432 typedef typename
__gnu_cxx::__alloc_traits
<_Alloc
>::template
433 rebind
<_Bit_type
>::other _Bit_alloc_type
;
434 typedef typename
__gnu_cxx::__alloc_traits
<_Bit_alloc_type
>
436 typedef typename
_Bit_alloc_traits::pointer _Bit_pointer
;
438 struct _Bvector_impl_data
440 _Bit_iterator _M_start
;
441 _Bit_iterator _M_finish
;
442 _Bit_pointer _M_end_of_storage
;
444 _Bvector_impl_data() _GLIBCXX_NOEXCEPT
445 : _M_start(), _M_finish(), _M_end_of_storage()
448 #if __cplusplus >= 201103L
449 _Bvector_impl_data(_Bvector_impl_data
&& __x
) noexcept
450 : _M_start(__x
._M_start
), _M_finish(__x
._M_finish
)
451 , _M_end_of_storage(__x
._M_end_of_storage
)
455 _M_move_data(_Bvector_impl_data
&& __x
) noexcept
457 this->_M_start
= __x
._M_start
;
458 this->_M_finish
= __x
._M_finish
;
459 this->_M_end_of_storage
= __x
._M_end_of_storage
;
465 _M_reset() _GLIBCXX_NOEXCEPT
467 _M_start
= _M_finish
= _Bit_iterator();
468 _M_end_of_storage
= _Bit_pointer();
473 : public _Bit_alloc_type
, public _Bvector_impl_data
477 _GLIBCXX_NOEXCEPT_IF( noexcept(_Bit_alloc_type()) )
481 _Bvector_impl(const _Bit_alloc_type
& __a
) _GLIBCXX_NOEXCEPT
482 : _Bit_alloc_type(__a
)
485 #if __cplusplus >= 201103L
486 _Bvector_impl(_Bvector_impl
&&) = default;
490 _M_end_addr() const _GLIBCXX_NOEXCEPT
492 if (this->_M_end_of_storage
)
493 return std::__addressof(this->_M_end_of_storage
[-1]) + 1;
499 typedef _Alloc allocator_type
;
502 _M_get_Bit_allocator() _GLIBCXX_NOEXCEPT
503 { return this->_M_impl
; }
505 const _Bit_alloc_type
&
506 _M_get_Bit_allocator() const _GLIBCXX_NOEXCEPT
507 { return this->_M_impl
; }
510 get_allocator() const _GLIBCXX_NOEXCEPT
511 { return allocator_type(_M_get_Bit_allocator()); }
513 #if __cplusplus >= 201103L
514 _Bvector_base() = default;
519 _Bvector_base(const allocator_type
& __a
)
522 #if __cplusplus >= 201103L
523 _Bvector_base(_Bvector_base
&&) = default;
527 { this->_M_deallocate(); }
530 _Bvector_impl _M_impl
;
533 _M_allocate(size_t __n
)
534 { return _Bit_alloc_traits::allocate(_M_impl
, _S_nword(__n
)); }
539 if (_M_impl
._M_start
._M_p
)
541 const size_t __n
= _M_impl
._M_end_addr() - _M_impl
._M_start
._M_p
;
542 _Bit_alloc_traits::deallocate(_M_impl
,
543 _M_impl
._M_end_of_storage
- __n
,
549 #if __cplusplus >= 201103L
551 _M_move_data(_Bvector_base
&& __x
) noexcept
552 { _M_impl
._M_move_data(std::move(__x
._M_impl
)); }
557 { return (__n
+ int(_S_word_bit
) - 1) / int(_S_word_bit
); }
560 _GLIBCXX_END_NAMESPACE_CONTAINER
561 _GLIBCXX_END_NAMESPACE_VERSION
564 // Declare a partial specialization of vector<T, Alloc>.
565 #include <bits/stl_vector.h>
567 namespace std
_GLIBCXX_VISIBILITY(default)
569 _GLIBCXX_BEGIN_NAMESPACE_VERSION
570 _GLIBCXX_BEGIN_NAMESPACE_CONTAINER
573 * @brief A specialization of vector for booleans which offers fixed time
574 * access to individual elements in any order.
578 * @tparam _Alloc Allocator type.
580 * Note that vector<bool> does not actually meet the requirements for being
581 * a container. This is because the reference and pointer types are not
582 * really references and pointers to bool. See DR96 for details. @see
583 * vector for function documentation.
585 * In some terminology a %vector can be described as a dynamic
586 * C-style array, it offers fast and efficient access to individual
587 * elements in any order and saves the user from worrying about
588 * memory and size allocation. Subscripting ( @c [] ) access is
589 * also provided as with C-style arrays.
591 template<typename _Alloc
>
592 class vector
<bool, _Alloc
> : protected _Bvector_base
<_Alloc
>
594 typedef _Bvector_base
<_Alloc
> _Base
;
595 typedef typename
_Base::_Bit_pointer _Bit_pointer
;
596 typedef typename
_Base::_Bit_alloc_traits _Bit_alloc_traits
;
598 #if __cplusplus >= 201103L
599 friend struct std::hash
<vector
>;
603 typedef bool value_type
;
604 typedef size_t size_type
;
605 typedef ptrdiff_t difference_type
;
606 typedef _Bit_reference reference
;
607 typedef bool const_reference
;
608 typedef _Bit_reference
* pointer
;
609 typedef const bool* const_pointer
;
610 typedef _Bit_iterator iterator
;
611 typedef _Bit_const_iterator const_iterator
;
612 typedef std::reverse_iterator
<const_iterator
> const_reverse_iterator
;
613 typedef std::reverse_iterator
<iterator
> reverse_iterator
;
614 typedef _Alloc allocator_type
;
617 get_allocator() const
618 { return _Base::get_allocator(); }
621 using _Base::_M_allocate
;
622 using _Base::_M_deallocate
;
623 using _Base::_S_nword
;
624 using _Base::_M_get_Bit_allocator
;
627 #if __cplusplus >= 201103L
634 vector(const allocator_type
& __a
)
637 #if __cplusplus >= 201103L
639 vector(size_type __n
, const allocator_type
& __a
= allocator_type())
640 : vector(__n
, false, __a
)
643 vector(size_type __n
, const bool& __value
,
644 const allocator_type
& __a
= allocator_type())
647 vector(size_type __n
, const bool& __value
= bool(),
648 const allocator_type
& __a
= allocator_type())
653 _M_initialize_value(__value
);
656 vector(const vector
& __x
)
657 : _Base(_Bit_alloc_traits::_S_select_on_copy(__x
._M_get_Bit_allocator()))
659 _M_initialize(__x
.size());
660 _M_copy_aligned(__x
.begin(), __x
.end(), this->_M_impl
._M_start
);
663 #if __cplusplus >= 201103L
664 vector(vector
&&) = default;
666 vector(vector
&& __x
, const allocator_type
& __a
)
667 noexcept(_Bit_alloc_traits::_S_always_equal())
670 if (__x
.get_allocator() == __a
)
671 this->_M_move_data(std::move(__x
));
674 _M_initialize(__x
.size());
675 _M_copy_aligned(__x
.begin(), __x
.end(), begin());
680 vector(const vector
& __x
, const allocator_type
& __a
)
683 _M_initialize(__x
.size());
684 _M_copy_aligned(__x
.begin(), __x
.end(), this->_M_impl
._M_start
);
687 vector(initializer_list
<bool> __l
,
688 const allocator_type
& __a
= allocator_type())
691 _M_initialize_range(__l
.begin(), __l
.end(),
692 random_access_iterator_tag());
696 #if __cplusplus >= 201103L
697 template<typename _InputIterator
,
698 typename
= std::_RequireInputIter
<_InputIterator
>>
699 vector(_InputIterator __first
, _InputIterator __last
,
700 const allocator_type
& __a
= allocator_type())
702 { _M_initialize_dispatch(__first
, __last
, __false_type()); }
704 template<typename _InputIterator
>
705 vector(_InputIterator __first
, _InputIterator __last
,
706 const allocator_type
& __a
= allocator_type())
709 typedef typename
std::__is_integer
<_InputIterator
>::__type _Integral
;
710 _M_initialize_dispatch(__first
, __last
, _Integral());
714 ~vector() _GLIBCXX_NOEXCEPT
{ }
717 operator=(const vector
& __x
)
721 #if __cplusplus >= 201103L
722 if (_Bit_alloc_traits::_S_propagate_on_copy_assign())
724 if (this->_M_get_Bit_allocator() != __x
._M_get_Bit_allocator())
726 this->_M_deallocate();
727 std::__alloc_on_copy(_M_get_Bit_allocator(),
728 __x
._M_get_Bit_allocator());
729 _M_initialize(__x
.size());
732 std::__alloc_on_copy(_M_get_Bit_allocator(),
733 __x
._M_get_Bit_allocator());
736 if (__x
.size() > capacity())
738 this->_M_deallocate();
739 _M_initialize(__x
.size());
741 this->_M_impl
._M_finish
= _M_copy_aligned(__x
.begin(), __x
.end(),
746 #if __cplusplus >= 201103L
748 operator=(vector
&& __x
) noexcept(_Bit_alloc_traits::_S_nothrow_move())
750 if (_Bit_alloc_traits::_S_propagate_on_move_assign()
751 || this->_M_get_Bit_allocator() == __x
._M_get_Bit_allocator())
753 this->_M_deallocate();
754 this->_M_move_data(std::move(__x
));
755 std::__alloc_on_move(_M_get_Bit_allocator(),
756 __x
._M_get_Bit_allocator());
760 if (__x
.size() > capacity())
762 this->_M_deallocate();
763 _M_initialize(__x
.size());
765 this->_M_impl
._M_finish
= _M_copy_aligned(__x
.begin(), __x
.end(),
773 operator=(initializer_list
<bool> __l
)
775 this->assign (__l
.begin(), __l
.end());
780 // assign(), a generalized assignment member function. Two
781 // versions: one that takes a count, and one that takes a range.
782 // The range version is a member template, so we dispatch on whether
783 // or not the type is an integer.
785 assign(size_type __n
, const bool& __x
)
786 { _M_fill_assign(__n
, __x
); }
788 #if __cplusplus >= 201103L
789 template<typename _InputIterator
,
790 typename
= std::_RequireInputIter
<_InputIterator
>>
792 assign(_InputIterator __first
, _InputIterator __last
)
793 { _M_assign_aux(__first
, __last
, std::__iterator_category(__first
)); }
795 template<typename _InputIterator
>
797 assign(_InputIterator __first
, _InputIterator __last
)
799 typedef typename
std::__is_integer
<_InputIterator
>::__type _Integral
;
800 _M_assign_dispatch(__first
, __last
, _Integral());
804 #if __cplusplus >= 201103L
806 assign(initializer_list
<bool> __l
)
807 { _M_assign_aux(__l
.begin(), __l
.end(), random_access_iterator_tag()); }
811 begin() _GLIBCXX_NOEXCEPT
812 { return this->_M_impl
._M_start
; }
815 begin() const _GLIBCXX_NOEXCEPT
816 { return this->_M_impl
._M_start
; }
819 end() _GLIBCXX_NOEXCEPT
820 { return this->_M_impl
._M_finish
; }
823 end() const _GLIBCXX_NOEXCEPT
824 { return this->_M_impl
._M_finish
; }
827 rbegin() _GLIBCXX_NOEXCEPT
828 { return reverse_iterator(end()); }
830 const_reverse_iterator
831 rbegin() const _GLIBCXX_NOEXCEPT
832 { return const_reverse_iterator(end()); }
835 rend() _GLIBCXX_NOEXCEPT
836 { return reverse_iterator(begin()); }
838 const_reverse_iterator
839 rend() const _GLIBCXX_NOEXCEPT
840 { return const_reverse_iterator(begin()); }
842 #if __cplusplus >= 201103L
844 cbegin() const noexcept
845 { return this->_M_impl
._M_start
; }
848 cend() const noexcept
849 { return this->_M_impl
._M_finish
; }
851 const_reverse_iterator
852 crbegin() const noexcept
853 { return const_reverse_iterator(end()); }
855 const_reverse_iterator
856 crend() const noexcept
857 { return const_reverse_iterator(begin()); }
861 size() const _GLIBCXX_NOEXCEPT
862 { return size_type(end() - begin()); }
865 max_size() const _GLIBCXX_NOEXCEPT
867 const size_type __isize
=
868 __gnu_cxx::__numeric_traits
<difference_type
>::__max
869 - int(_S_word_bit
) + 1;
870 const size_type __asize
871 = _Bit_alloc_traits::max_size(_M_get_Bit_allocator());
872 return (__asize
<= __isize
/ int(_S_word_bit
)
873 ? __asize
* int(_S_word_bit
) : __isize
);
877 capacity() const _GLIBCXX_NOEXCEPT
878 { return size_type(const_iterator(this->_M_impl
._M_end_addr(), 0)
882 empty() const _GLIBCXX_NOEXCEPT
883 { return begin() == end(); }
886 operator[](size_type __n
)
888 return *iterator(this->_M_impl
._M_start
._M_p
889 + __n
/ int(_S_word_bit
), __n
% int(_S_word_bit
));
893 operator[](size_type __n
) const
895 return *const_iterator(this->_M_impl
._M_start
._M_p
896 + __n
/ int(_S_word_bit
), __n
% int(_S_word_bit
));
901 _M_range_check(size_type __n
) const
903 if (__n
>= this->size())
904 __throw_out_of_range_fmt(__N("vector<bool>::_M_range_check: __n "
905 "(which is %zu) >= this->size() "
913 { _M_range_check(__n
); return (*this)[__n
]; }
916 at(size_type __n
) const
917 { _M_range_check(__n
); return (*this)[__n
]; }
920 reserve(size_type __n
)
922 if (__n
> max_size())
923 __throw_length_error(__N("vector::reserve"));
924 if (capacity() < __n
)
938 { return *(end() - 1); }
942 { return *(end() - 1); }
944 // _GLIBCXX_RESOLVE_LIB_DEFECTS
945 // DR 464. Suggestion for new member functions in standard containers.
946 // N.B. DR 464 says nothing about vector<bool> but we need something
947 // here due to the way we are implementing DR 464 in the debug-mode
950 data() _GLIBCXX_NOEXCEPT
{ }
955 if (this->_M_impl
._M_finish
._M_p
!= this->_M_impl
._M_end_addr())
956 *this->_M_impl
._M_finish
++ = __x
;
958 _M_insert_aux(end(), __x
);
962 swap(vector
& __x
) _GLIBCXX_NOEXCEPT
964 std::swap(this->_M_impl
._M_start
, __x
._M_impl
._M_start
);
965 std::swap(this->_M_impl
._M_finish
, __x
._M_impl
._M_finish
);
966 std::swap(this->_M_impl
._M_end_of_storage
,
967 __x
._M_impl
._M_end_of_storage
);
968 _Bit_alloc_traits::_S_on_swap(_M_get_Bit_allocator(),
969 __x
._M_get_Bit_allocator());
972 // [23.2.5]/1, third-to-last entry in synopsis listing
974 swap(reference __x
, reference __y
) _GLIBCXX_NOEXCEPT
982 #if __cplusplus >= 201103L
983 insert(const_iterator __position
, const bool& __x
= bool())
985 insert(iterator __position
, const bool& __x
= bool())
988 const difference_type __n
= __position
- begin();
989 if (this->_M_impl
._M_finish
._M_p
!= this->_M_impl
._M_end_addr()
990 && __position
== end())
991 *this->_M_impl
._M_finish
++ = __x
;
993 _M_insert_aux(__position
._M_const_cast(), __x
);
994 return begin() + __n
;
997 #if __cplusplus >= 201103L
998 template<typename _InputIterator
,
999 typename
= std::_RequireInputIter
<_InputIterator
>>
1001 insert(const_iterator __position
,
1002 _InputIterator __first
, _InputIterator __last
)
1004 difference_type __offset
= __position
- cbegin();
1005 _M_insert_dispatch(__position
._M_const_cast(),
1006 __first
, __last
, __false_type());
1007 return begin() + __offset
;
1010 template<typename _InputIterator
>
1012 insert(iterator __position
,
1013 _InputIterator __first
, _InputIterator __last
)
1015 typedef typename
std::__is_integer
<_InputIterator
>::__type _Integral
;
1016 _M_insert_dispatch(__position
, __first
, __last
, _Integral());
1020 #if __cplusplus >= 201103L
1022 insert(const_iterator __position
, size_type __n
, const bool& __x
)
1024 difference_type __offset
= __position
- cbegin();
1025 _M_fill_insert(__position
._M_const_cast(), __n
, __x
);
1026 return begin() + __offset
;
1030 insert(iterator __position
, size_type __n
, const bool& __x
)
1031 { _M_fill_insert(__position
, __n
, __x
); }
1034 #if __cplusplus >= 201103L
1036 insert(const_iterator __p
, initializer_list
<bool> __l
)
1037 { return this->insert(__p
, __l
.begin(), __l
.end()); }
1042 { --this->_M_impl
._M_finish
; }
1045 #if __cplusplus >= 201103L
1046 erase(const_iterator __position
)
1048 erase(iterator __position
)
1050 { return _M_erase(__position
._M_const_cast()); }
1053 #if __cplusplus >= 201103L
1054 erase(const_iterator __first
, const_iterator __last
)
1056 erase(iterator __first
, iterator __last
)
1058 { return _M_erase(__first
._M_const_cast(), __last
._M_const_cast()); }
1061 resize(size_type __new_size
, bool __x
= bool())
1063 if (__new_size
< size())
1064 _M_erase_at_end(begin() + difference_type(__new_size
));
1066 insert(end(), __new_size
- size(), __x
);
1069 #if __cplusplus >= 201103L
1072 { _M_shrink_to_fit(); }
1076 flip() _GLIBCXX_NOEXCEPT
1078 _Bit_type
* const __end
= this->_M_impl
._M_end_addr();
1079 for (_Bit_type
* __p
= this->_M_impl
._M_start
._M_p
; __p
!= __end
; ++__p
)
1084 clear() _GLIBCXX_NOEXCEPT
1085 { _M_erase_at_end(begin()); }
1087 #if __cplusplus >= 201103L
1088 template<typename
... _Args
>
1089 #if __cplusplus > 201402L
1094 emplace_back(_Args
&&... __args
)
1096 push_back(bool(__args
...));
1097 #if __cplusplus > 201402L
1102 template<typename
... _Args
>
1104 emplace(const_iterator __pos
, _Args
&&... __args
)
1105 { return insert(__pos
, bool(__args
...)); }
1109 // Precondition: __first._M_offset == 0 && __result._M_offset == 0.
1111 _M_copy_aligned(const_iterator __first
, const_iterator __last
,
1114 _Bit_type
* __q
= std::copy(__first
._M_p
, __last
._M_p
, __result
._M_p
);
1115 return std::copy(const_iterator(__last
._M_p
, 0), __last
,
1120 _M_initialize(size_type __n
)
1124 _Bit_pointer __q
= this->_M_allocate(__n
);
1125 this->_M_impl
._M_end_of_storage
= __q
+ _S_nword(__n
);
1126 this->_M_impl
._M_start
= iterator(std::__addressof(*__q
), 0);
1130 this->_M_impl
._M_end_of_storage
= _Bit_pointer();
1131 this->_M_impl
._M_start
= iterator(0, 0);
1133 this->_M_impl
._M_finish
= this->_M_impl
._M_start
+ difference_type(__n
);
1138 _M_initialize_value(bool __x
)
1140 if (_Bit_type
* __p
= this->_M_impl
._M_start
._M_p
)
1141 __builtin_memset(__p
, __x
? ~0 : 0,
1142 (this->_M_impl
._M_end_addr() - __p
)
1143 * sizeof(_Bit_type
));
1147 _M_reallocate(size_type __n
);
1149 #if __cplusplus >= 201103L
1154 // Check whether it's an integral type. If so, it's not an iterator.
1156 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1157 // 438. Ambiguity in the "do the right thing" clause
1158 template<typename _Integer
>
1160 _M_initialize_dispatch(_Integer __n
, _Integer __x
, __true_type
)
1162 _M_initialize(static_cast<size_type
>(__n
));
1163 _M_initialize_value(__x
);
1166 template<typename _InputIterator
>
1168 _M_initialize_dispatch(_InputIterator __first
, _InputIterator __last
,
1170 { _M_initialize_range(__first
, __last
,
1171 std::__iterator_category(__first
)); }
1173 template<typename _InputIterator
>
1175 _M_initialize_range(_InputIterator __first
, _InputIterator __last
,
1176 std::input_iterator_tag
)
1178 for (; __first
!= __last
; ++__first
)
1179 push_back(*__first
);
1182 template<typename _ForwardIterator
>
1184 _M_initialize_range(_ForwardIterator __first
, _ForwardIterator __last
,
1185 std::forward_iterator_tag
)
1187 const size_type __n
= std::distance(__first
, __last
);
1189 std::copy(__first
, __last
, this->_M_impl
._M_start
);
1192 #if __cplusplus < 201103L
1193 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1194 // 438. Ambiguity in the "do the right thing" clause
1195 template<typename _Integer
>
1197 _M_assign_dispatch(_Integer __n
, _Integer __val
, __true_type
)
1198 { _M_fill_assign(__n
, __val
); }
1200 template<class _InputIterator
>
1202 _M_assign_dispatch(_InputIterator __first
, _InputIterator __last
,
1204 { _M_assign_aux(__first
, __last
, std::__iterator_category(__first
)); }
1208 _M_fill_assign(size_t __n
, bool __x
)
1212 _M_initialize_value(__x
);
1213 insert(end(), __n
- size(), __x
);
1217 _M_erase_at_end(begin() + __n
);
1218 _M_initialize_value(__x
);
1222 template<typename _InputIterator
>
1224 _M_assign_aux(_InputIterator __first
, _InputIterator __last
,
1225 std::input_iterator_tag
)
1227 iterator __cur
= begin();
1228 for (; __first
!= __last
&& __cur
!= end(); ++__cur
, (void)++__first
)
1230 if (__first
== __last
)
1231 _M_erase_at_end(__cur
);
1233 insert(end(), __first
, __last
);
1236 template<typename _ForwardIterator
>
1238 _M_assign_aux(_ForwardIterator __first
, _ForwardIterator __last
,
1239 std::forward_iterator_tag
)
1241 const size_type __len
= std::distance(__first
, __last
);
1243 _M_erase_at_end(std::copy(__first
, __last
, begin()));
1246 _ForwardIterator __mid
= __first
;
1247 std::advance(__mid
, size());
1248 std::copy(__first
, __mid
, begin());
1249 insert(end(), __mid
, __last
);
1253 // Check whether it's an integral type. If so, it's not an iterator.
1255 // _GLIBCXX_RESOLVE_LIB_DEFECTS
1256 // 438. Ambiguity in the "do the right thing" clause
1257 template<typename _Integer
>
1259 _M_insert_dispatch(iterator __pos
, _Integer __n
, _Integer __x
,
1261 { _M_fill_insert(__pos
, __n
, __x
); }
1263 template<typename _InputIterator
>
1265 _M_insert_dispatch(iterator __pos
,
1266 _InputIterator __first
, _InputIterator __last
,
1268 { _M_insert_range(__pos
, __first
, __last
,
1269 std::__iterator_category(__first
)); }
1272 _M_fill_insert(iterator __position
, size_type __n
, bool __x
);
1274 template<typename _InputIterator
>
1276 _M_insert_range(iterator __pos
, _InputIterator __first
,
1277 _InputIterator __last
, std::input_iterator_tag
)
1279 for (; __first
!= __last
; ++__first
)
1281 __pos
= insert(__pos
, *__first
);
1286 template<typename _ForwardIterator
>
1288 _M_insert_range(iterator __position
, _ForwardIterator __first
,
1289 _ForwardIterator __last
, std::forward_iterator_tag
);
1292 _M_insert_aux(iterator __position
, bool __x
);
1295 _M_check_len(size_type __n
, const char* __s
) const
1297 if (max_size() - size() < __n
)
1298 __throw_length_error(__N(__s
));
1300 const size_type __len
= size() + std::max(size(), __n
);
1301 return (__len
< size() || __len
> max_size()) ? max_size() : __len
;
1305 _M_erase_at_end(iterator __pos
)
1306 { this->_M_impl
._M_finish
= __pos
; }
1309 _M_erase(iterator __pos
);
1312 _M_erase(iterator __first
, iterator __last
);
1315 _GLIBCXX_END_NAMESPACE_CONTAINER
1316 _GLIBCXX_END_NAMESPACE_VERSION
1319 #if __cplusplus >= 201103L
1321 namespace std
_GLIBCXX_VISIBILITY(default)
1323 _GLIBCXX_BEGIN_NAMESPACE_VERSION
1326 /// std::hash specialization for vector<bool>.
1327 template<typename _Alloc
>
1328 struct hash
<_GLIBCXX_STD_C::vector
<bool, _Alloc
>>
1329 : public __hash_base
<size_t, _GLIBCXX_STD_C::vector
<bool, _Alloc
>>
1332 operator()(const _GLIBCXX_STD_C::vector
<bool, _Alloc
>&) const noexcept
;
1335 _GLIBCXX_END_NAMESPACE_VERSION