30#ifndef _GLIBCXX_TR2_DYNAMIC_BITSET_TCC
31#define _GLIBCXX_TR2_DYNAMIC_BITSET_TCC 1
33#pragma GCC system_header
35namespace std _GLIBCXX_VISIBILITY(default)
37_GLIBCXX_BEGIN_NAMESPACE_VERSION
42 template<
typename _WordT,
typename _Alloc>
44 __dynamic_bitset_base<_WordT, _Alloc>::_M_do_left_shift(
size_t __shift)
46 if (__builtin_expect(__shift != 0, 1))
48 const size_t __wshift = __shift / _S_bits_per_block;
49 const size_t __offset = __shift % _S_bits_per_block;
52 for (
size_t __n = this->_M_w.size() - 1; __n >= __wshift; --__n)
53 this->_M_w[__n] = this->_M_w[__n - __wshift];
56 const size_t __sub_offset = _S_bits_per_block - __offset;
57 for (
size_t __n = _M_w.size() - 1; __n > __wshift; --__n)
58 this->_M_w[__n] = ((this->_M_w[__n - __wshift] << __offset)
59 | (this->_M_w[__n - __wshift - 1] >> __sub_offset));
60 this->_M_w[__wshift] = this->_M_w[0] << __offset;
63 std::fill_n(this->_M_w.begin(), __wshift, _WordT(0));
67 template<
typename _WordT,
typename _Alloc>
69 __dynamic_bitset_base<_WordT, _Alloc>::_M_do_right_shift(
size_t __shift)
71 if (__builtin_expect(__shift != 0, 1))
73 const size_t __wshift = __shift / _S_bits_per_block;
74 const size_t __offset = __shift % _S_bits_per_block;
75 const size_t __limit = this->_M_w.size() - __wshift - 1;
78 for (
size_t __n = 0; __n <= __limit; ++__n)
79 this->_M_w[__n] = this->_M_w[__n + __wshift];
82 const size_t __sub_offset = (_S_bits_per_block
84 for (
size_t __n = 0; __n < __limit; ++__n)
85 this->_M_w[__n] = ((this->_M_w[__n + __wshift] >> __offset)
86 | (this->_M_w[__n + __wshift + 1] << __sub_offset));
87 this->_M_w[__limit] = this->_M_w[_M_w.size()-1] >> __offset;
90 std::fill_n(this->_M_w.end() - __wshift, __wshift, _WordT(0));
94 template<
typename _WordT,
typename _Alloc>
96 __dynamic_bitset_base<_WordT, _Alloc>::_M_do_to_ulong()
const
98 size_t __n =
sizeof(
unsigned long) /
sizeof(block_type);
99 for (
size_t __i = __n; __i < this->_M_w.size(); ++__i)
101 __throw_overflow_error(__N(
"__dynamic_bitset_base::_M_do_to_ulong"));
102 unsigned long __res = 0UL;
103 for (
size_t __i = 0; __i < __n && __i < this->_M_w.size(); ++__i)
104 __res += this->_M_w[__i] << (__i * _S_bits_per_block);
108 template<
typename _WordT,
typename _Alloc>
110 __dynamic_bitset_base<_WordT, _Alloc>::_M_do_to_ullong()
const
112 size_t __n =
sizeof(
unsigned long long) /
sizeof(block_type);
113 for (
size_t __i = __n; __i < this->_M_w.size(); ++__i)
115 __throw_overflow_error(__N(
"__dynamic_bitset_base::_M_do_to_ullong"));
116 unsigned long long __res = 0ULL;
117 for (
size_t __i = 0; __i < __n && __i < this->_M_w.size(); ++__i)
118 __res += this->_M_w[__i] << (__i * _S_bits_per_block);
122 template<
typename _WordT,
typename _Alloc>
124 __dynamic_bitset_base<_WordT, _Alloc>
125 ::_M_do_find_first(
size_t __not_found)
const
127 for (
size_t __i = 0; __i < this->_M_w.size(); ++__i)
129 _WordT __thisword = this->_M_w[__i];
130 if (__thisword !=
static_cast<_WordT
>(0))
131 return (__i * _S_bits_per_block
132 + __builtin_ctzll(__thisword));
138 template<
typename _WordT,
typename _Alloc>
140 __dynamic_bitset_base<_WordT, _Alloc>
141 ::_M_do_find_next(
size_t __prev,
size_t __not_found)
const
147 if (__prev >= this->_M_w.size() * _S_bits_per_block)
151 size_t __i = _S_whichword(__prev);
152 _WordT __thisword = this->_M_w[__i];
155 __thisword &= (~static_cast<_WordT>(0)) << _S_whichbit(__prev);
157 if (__thisword !=
static_cast<_WordT
>(0))
158 return (__i * _S_bits_per_block
159 + __builtin_ctzll(__thisword));
162 for (++__i; __i < this->_M_w.size(); ++__i)
164 __thisword = this->_M_w[__i];
165 if (__thisword !=
static_cast<_WordT
>(0))
166 return (__i * _S_bits_per_block
167 + __builtin_ctzll(__thisword));
174 template<
typename _WordT,
typename _Alloc>
175 template<
typename _Traits,
typename _CharT>
177 dynamic_bitset<_WordT, _Alloc>::
178 _M_copy_from_ptr(
const _CharT* __str,
size_t __len,
179 size_t __pos,
size_t __n, _CharT __zero, _CharT __one)
183 for (
size_t __i = __nbits; __i > 0; --__i)
185 const _CharT __c = __str[__pos + __nbits - __i];
186 if (_Traits::eq(__c, __zero))
188 else if (_Traits::eq(__c, __one))
189 _M_unchecked_set(__i - 1);
191 __throw_invalid_argument(__N(
"dynamic_bitset::_M_copy_from_ptr"));
202 template<
typename _CharT,
typename _Traits,
203 typename _WordT,
typename _Alloc>
208 typedef typename _Traits::char_type char_type;
210 typedef typename __istream_type::ios_base
__ios_base;
213 __tmp.reserve(__x.size());
218 typename __ios_base::iostate
__state = __ios_base::goodbit;
226 static typename _Traits::int_type
__eof = _Traits::eof();
228 typename _Traits::int_type
__c1 =
__is.rdbuf()->sbumpc();
236 const char_type __c2 = _Traits::to_char_type(
__c1);
237 if (_Traits::eq(__c2,
__zero))
239 else if (_Traits::eq(__c2,
__one))
242 eq_int_type(
__is.rdbuf()->sputbackc(__c2),
245 __state |= __ios_base::failbit;
255 __is._M_setstate(__ios_base::badbit);
256 __throw_exception_again;
259 {
__is._M_setstate(__ios_base::badbit); }
262 __x.resize(
__tmp.size());
264 if (
__tmp.empty() && __x.size())
265 __state |= __ios_base::failbit;
267 __x._M_copy_from_string(
__tmp,
static_cast<size_t>(0), __x.size(),
275_GLIBCXX_END_NAMESPACE_VERSION
constexpr const _Tp & min(const _Tp &, const _Tp &)
This does what you think it does.
std::basic_istream< _CharT, _Traits > & operator>>(std::basic_istream< _CharT, _Traits > &__is, dynamic_bitset< _WordT, _Alloc > &__x)
Stream input operator for dynamic_bitset.
ISO C++ entities toplevel namespace is std.
Thrown as part of forced unwinding.