williamr@2
|
1 |
/*
|
williamr@2
|
2 |
* Copyright (c) 1998
|
williamr@2
|
3 |
* Silicon Graphics Computer Systems, Inc.
|
williamr@2
|
4 |
*
|
williamr@2
|
5 |
* Copyright (c) 1999
|
williamr@2
|
6 |
* Boris Fomitchev
|
williamr@2
|
7 |
*
|
williamr@2
|
8 |
* This material is provided "as is", with absolutely no warranty expressed
|
williamr@2
|
9 |
* or implied. Any use is at your own risk.
|
williamr@2
|
10 |
*
|
williamr@2
|
11 |
* Permission to use or copy this software for any purpose is hereby granted
|
williamr@2
|
12 |
* without fee, provided the above notices are retained on all copies.
|
williamr@2
|
13 |
* Permission to modify the code and to distribute modified code is granted,
|
williamr@2
|
14 |
* provided the above notices are retained, and a notice that the code was
|
williamr@2
|
15 |
* modified is included with the above copyright notice.
|
williamr@2
|
16 |
*
|
williamr@2
|
17 |
*/
|
williamr@2
|
18 |
|
williamr@2
|
19 |
#ifndef _STLP_BITSET_C
|
williamr@2
|
20 |
# define _STLP_BITSET_C
|
williamr@2
|
21 |
|
williamr@2
|
22 |
# ifndef _STLP_BITSET_H
|
williamr@2
|
23 |
# include <stl/_bitset.h>
|
williamr@2
|
24 |
# endif
|
williamr@2
|
25 |
|
williamr@2
|
26 |
# define __BITS_PER_WORD (CHAR_BIT*sizeof(unsigned long))
|
williamr@2
|
27 |
|
williamr@2
|
28 |
_STLP_BEGIN_NAMESPACE
|
williamr@2
|
29 |
|
williamr@2
|
30 |
//
|
williamr@2
|
31 |
// Definitions of non-inline functions from _Base_bitset.
|
williamr@2
|
32 |
//
|
williamr@2
|
33 |
|
williamr@2
|
34 |
|
williamr@2
|
35 |
template<size_t _Nw>
|
williamr@2
|
36 |
void _STLP_IMPORT_METHOD _Base_bitset<_Nw>::_M_do_left_shift(size_t __shift)
|
williamr@2
|
37 |
{
|
williamr@2
|
38 |
|
williamr@2
|
39 |
if (__shift != 0) {
|
williamr@2
|
40 |
const size_t __wshift = __shift / __BITS_PER_WORD;
|
williamr@2
|
41 |
const size_t __offset = __shift % __BITS_PER_WORD;
|
williamr@2
|
42 |
|
williamr@2
|
43 |
if (__offset == 0)
|
williamr@2
|
44 |
for (size_t __n = _Nw - 1; __n >= __wshift; --__n)
|
williamr@2
|
45 |
_M_w[__n] = _M_w[__n - __wshift];
|
williamr@2
|
46 |
|
williamr@2
|
47 |
else {
|
williamr@2
|
48 |
const size_t __sub_offset = __BITS_PER_WORD - __offset;
|
williamr@2
|
49 |
for (size_t __n = _Nw - 1; __n > __wshift; --__n)
|
williamr@2
|
50 |
_M_w[__n] = (_M_w[__n - __wshift] << __offset) |
|
williamr@2
|
51 |
(_M_w[__n - __wshift - 1] >> __sub_offset);
|
williamr@2
|
52 |
_M_w[__wshift] = _M_w[0] << __offset;
|
williamr@2
|
53 |
}
|
williamr@2
|
54 |
|
williamr@2
|
55 |
fill(_M_w + 0, _M_w + __wshift, __STATIC_CAST(_WordT,0));
|
williamr@2
|
56 |
}
|
williamr@2
|
57 |
}
|
williamr@2
|
58 |
|
williamr@2
|
59 |
template<size_t _Nw>
|
williamr@2
|
60 |
void _Base_bitset<_Nw>::_M_do_right_shift(size_t __shift)
|
williamr@2
|
61 |
{
|
williamr@2
|
62 |
|
williamr@2
|
63 |
if (__shift != 0) {
|
williamr@2
|
64 |
const size_t __wshift = __shift / __BITS_PER_WORD;
|
williamr@2
|
65 |
const size_t __offset = __shift % __BITS_PER_WORD;
|
williamr@2
|
66 |
const size_t __limit = _Nw - __wshift - 1;
|
williamr@2
|
67 |
|
williamr@2
|
68 |
if (__offset == 0)
|
williamr@2
|
69 |
for (size_t __n = 0; __n <= __limit; ++__n)
|
williamr@2
|
70 |
_M_w[__n] = _M_w[__n + __wshift];
|
williamr@2
|
71 |
|
williamr@2
|
72 |
else {
|
williamr@2
|
73 |
const size_t __sub_offset = __BITS_PER_WORD - __offset;
|
williamr@2
|
74 |
for (size_t __n = 0; __n < __limit; ++__n)
|
williamr@2
|
75 |
_M_w[__n] = (_M_w[__n + __wshift] >> __offset) |
|
williamr@2
|
76 |
(_M_w[__n + __wshift + 1] << __sub_offset);
|
williamr@2
|
77 |
_M_w[__limit] = _M_w[_Nw-1] >> __offset;
|
williamr@2
|
78 |
}
|
williamr@2
|
79 |
|
williamr@2
|
80 |
fill(_M_w + __limit + 1, _M_w + _Nw, __STATIC_CAST(_WordT,0));
|
williamr@2
|
81 |
}
|
williamr@2
|
82 |
}
|
williamr@2
|
83 |
|
williamr@2
|
84 |
template<size_t _Nw>
|
williamr@2
|
85 |
unsigned long _Base_bitset<_Nw>::_M_do_to_ulong() const
|
williamr@2
|
86 |
{
|
williamr@2
|
87 |
for (size_t __i = 1; __i < _Nw; ++__i)
|
williamr@2
|
88 |
if (_M_w[__i])
|
williamr@2
|
89 |
__stl_throw_overflow_error("bitset");
|
williamr@2
|
90 |
return _M_w[0];
|
williamr@2
|
91 |
} // End _M_do_to_ulong
|
williamr@2
|
92 |
|
williamr@2
|
93 |
template<size_t _Nw>
|
williamr@2
|
94 |
size_t _Base_bitset<_Nw>::_M_do_find_first(size_t __not_found) const
|
williamr@2
|
95 |
{
|
williamr@2
|
96 |
for ( size_t __i = 0; __i < _Nw; __i++ ) {
|
williamr@2
|
97 |
_WordT __thisword = _M_w[__i];
|
williamr@2
|
98 |
if ( __thisword != __STATIC_CAST(_WordT,0) ) {
|
williamr@2
|
99 |
// find byte within word
|
williamr@2
|
100 |
for ( size_t __j = 0; __j < sizeof(_WordT); __j++ ) {
|
williamr@2
|
101 |
unsigned char __this_byte
|
williamr@2
|
102 |
= __STATIC_CAST(unsigned char,(__thisword & (~(unsigned char)0)));
|
williamr@2
|
103 |
if ( __this_byte )
|
williamr@2
|
104 |
return __i*__BITS_PER_WORD + __j*CHAR_BIT +
|
williamr@2
|
105 |
_Bs_G<bool>::_S_first_one[__this_byte];
|
williamr@2
|
106 |
|
williamr@2
|
107 |
__thisword >>= CHAR_BIT;
|
williamr@2
|
108 |
}
|
williamr@2
|
109 |
}
|
williamr@2
|
110 |
}
|
williamr@2
|
111 |
// not found, so return an indication of failure.
|
williamr@2
|
112 |
return __not_found;
|
williamr@2
|
113 |
}
|
williamr@2
|
114 |
|
williamr@2
|
115 |
template<size_t _Nw>
|
williamr@2
|
116 |
size_t
|
williamr@2
|
117 |
_Base_bitset<_Nw>::_M_do_find_next(size_t __prev,
|
williamr@2
|
118 |
size_t __not_found) const
|
williamr@2
|
119 |
{
|
williamr@2
|
120 |
// make bound inclusive
|
williamr@2
|
121 |
++__prev;
|
williamr@2
|
122 |
|
williamr@2
|
123 |
// check out of bounds
|
williamr@2
|
124 |
if ( __prev >= _Nw * __BITS_PER_WORD )
|
williamr@2
|
125 |
return __not_found;
|
williamr@2
|
126 |
|
williamr@2
|
127 |
// search first word
|
williamr@2
|
128 |
size_t __i = _S_whichword(__prev);
|
williamr@2
|
129 |
_WordT __thisword = _M_w[__i];
|
williamr@2
|
130 |
|
williamr@2
|
131 |
// mask off bits below bound
|
williamr@2
|
132 |
__thisword &= (~__STATIC_CAST(_WordT,0)) << _S_whichbit(__prev);
|
williamr@2
|
133 |
|
williamr@2
|
134 |
if ( __thisword != __STATIC_CAST(_WordT,0) ) {
|
williamr@2
|
135 |
// find byte within word
|
williamr@2
|
136 |
// get first byte into place
|
williamr@2
|
137 |
__thisword >>= _S_whichbyte(__prev) * CHAR_BIT;
|
williamr@2
|
138 |
for ( size_t __j = _S_whichbyte(__prev); __j < sizeof(_WordT); __j++ ) {
|
williamr@2
|
139 |
unsigned char __this_byte
|
williamr@2
|
140 |
= __STATIC_CAST(unsigned char,(__thisword & (~(unsigned char)0)));
|
williamr@2
|
141 |
if ( __this_byte )
|
williamr@2
|
142 |
return __i*__BITS_PER_WORD + __j*CHAR_BIT +
|
williamr@2
|
143 |
_Bs_G<bool>::_S_first_one[__this_byte];
|
williamr@2
|
144 |
|
williamr@2
|
145 |
__thisword >>= CHAR_BIT;
|
williamr@2
|
146 |
}
|
williamr@2
|
147 |
}
|
williamr@2
|
148 |
|
williamr@2
|
149 |
// check subsequent words
|
williamr@2
|
150 |
__i++;
|
williamr@2
|
151 |
for ( ; __i < _Nw; __i++ ) {
|
williamr@2
|
152 |
/* _WordT */ __thisword = _M_w[__i];
|
williamr@2
|
153 |
if ( __thisword != __STATIC_CAST(_WordT,0) ) {
|
williamr@2
|
154 |
// find byte within word
|
williamr@2
|
155 |
for ( size_t __j = 0; __j < sizeof(_WordT); __j++ ) {
|
williamr@2
|
156 |
unsigned char __this_byte
|
williamr@2
|
157 |
= __STATIC_CAST(unsigned char,(__thisword & (~(unsigned char)0)));
|
williamr@2
|
158 |
if ( __this_byte )
|
williamr@2
|
159 |
return __i*__BITS_PER_WORD + __j*CHAR_BIT +
|
williamr@2
|
160 |
_Bs_G<bool>::_S_first_one[__this_byte];
|
williamr@2
|
161 |
|
williamr@2
|
162 |
__thisword >>= CHAR_BIT;
|
williamr@2
|
163 |
}
|
williamr@2
|
164 |
}
|
williamr@2
|
165 |
}
|
williamr@2
|
166 |
|
williamr@2
|
167 |
// not found, so return an indication of failure.
|
williamr@2
|
168 |
return __not_found;
|
williamr@2
|
169 |
} // end _M_do_find_next
|
williamr@2
|
170 |
|
williamr@2
|
171 |
|
williamr@2
|
172 |
|
williamr@2
|
173 |
# if ! defined (_STLP_NON_TYPE_TMPL_PARAM_BUG)
|
williamr@2
|
174 |
|
williamr@2
|
175 |
#if defined ( _STLP_USE_NEW_IOSTREAMS)
|
williamr@2
|
176 |
|
williamr@2
|
177 |
template <class _CharT, class _Traits, size_t _Nb>
|
williamr@2
|
178 |
basic_istream<_CharT, _Traits>& _STLP_CALL
|
williamr@2
|
179 |
operator>>(basic_istream<_CharT, _Traits>& __is, bitset<_Nb>& __x)
|
williamr@2
|
180 |
{
|
williamr@2
|
181 |
basic_string<_CharT, _Traits> __tmp;
|
williamr@2
|
182 |
__tmp.reserve(_Nb);
|
williamr@2
|
183 |
|
williamr@2
|
184 |
// Skip whitespace
|
williamr@2
|
185 |
typename basic_istream<_CharT, _Traits>::sentry __sentry(__is);
|
williamr@2
|
186 |
if (__sentry) {
|
williamr@2
|
187 |
basic_streambuf<_CharT, _Traits>* __buf = __is.rdbuf();
|
williamr@2
|
188 |
for (size_t __i = 0; __i < _Nb; ++__i) {
|
williamr@2
|
189 |
static typename _Traits::int_type __eof = _Traits::eof();
|
williamr@2
|
190 |
|
williamr@2
|
191 |
typename _Traits::int_type __c1 = __buf->sbumpc();
|
williamr@2
|
192 |
if (_Traits::eq_int_type(__c1, __eof)) {
|
williamr@2
|
193 |
__is.setstate(ios_base::eofbit);
|
williamr@2
|
194 |
break;
|
williamr@2
|
195 |
}
|
williamr@2
|
196 |
else {
|
williamr@2
|
197 |
char __c2 = _Traits::to_char_type(__c1);
|
williamr@2
|
198 |
char __c = __is.narrow(__c2, '*');
|
williamr@2
|
199 |
|
williamr@2
|
200 |
if (__c == '0' || __c == '1')
|
williamr@2
|
201 |
__tmp.push_back(__c);
|
williamr@2
|
202 |
else if (_Traits::eq_int_type(__buf->sputbackc(__c2), __eof)) {
|
williamr@2
|
203 |
__is.setstate(ios_base::failbit);
|
williamr@2
|
204 |
break;
|
williamr@2
|
205 |
}
|
williamr@2
|
206 |
}
|
williamr@2
|
207 |
}
|
williamr@2
|
208 |
|
williamr@2
|
209 |
if (__tmp.empty())
|
williamr@2
|
210 |
__is.setstate(ios_base::failbit);
|
williamr@2
|
211 |
else
|
williamr@2
|
212 |
__x._M_copy_from_string(__tmp, __STATIC_CAST(size_t,0), _Nb);
|
williamr@2
|
213 |
}
|
williamr@2
|
214 |
|
williamr@2
|
215 |
return __is;
|
williamr@2
|
216 |
}
|
williamr@2
|
217 |
|
williamr@2
|
218 |
template <class _CharT, class _Traits, size_t _Nb>
|
williamr@2
|
219 |
basic_ostream<_CharT, _Traits>& _STLP_CALL
|
williamr@2
|
220 |
operator<<(basic_ostream<_CharT, _Traits>& __os,
|
williamr@2
|
221 |
const bitset<_Nb>& __x)
|
williamr@2
|
222 |
{
|
williamr@2
|
223 |
basic_string<_CharT, _Traits> __tmp;
|
williamr@2
|
224 |
__x._M_copy_to_string(__tmp);
|
williamr@2
|
225 |
return __os << __tmp;
|
williamr@2
|
226 |
}
|
williamr@2
|
227 |
|
williamr@2
|
228 |
#elif ! defined ( _STLP_USE_NO_IOSTREAMS )
|
williamr@2
|
229 |
|
williamr@2
|
230 |
// (reg) For Watcom IO, this tells if ostream class is in .exe or in .dll
|
williamr@2
|
231 |
template <size_t _Nb>
|
williamr@2
|
232 |
_ISTREAM_DLL& _STLP_CALL
|
williamr@2
|
233 |
operator>>(_ISTREAM_DLL& __is, bitset<_Nb>& __x) {
|
williamr@2
|
234 |
string __tmp;
|
williamr@2
|
235 |
__tmp.reserve(_Nb);
|
williamr@2
|
236 |
|
williamr@2
|
237 |
// In new templatized iostreams, use istream::sentry
|
williamr@2
|
238 |
if (__is.flags() & ios::skipws) {
|
williamr@2
|
239 |
char __c;
|
williamr@2
|
240 |
do
|
williamr@2
|
241 |
__is.get(__c);
|
williamr@2
|
242 |
while (__is && isspace(__c));
|
williamr@2
|
243 |
if (__is)
|
williamr@2
|
244 |
__is.putback(__c);
|
williamr@2
|
245 |
}
|
williamr@2
|
246 |
|
williamr@2
|
247 |
for (size_t __i = 0; __i < _Nb; ++__i) {
|
williamr@2
|
248 |
char __c;
|
williamr@2
|
249 |
__is.get(__c);
|
williamr@2
|
250 |
|
williamr@2
|
251 |
if (!__is)
|
williamr@2
|
252 |
break;
|
williamr@2
|
253 |
else if (__c != '0' && __c != '1') {
|
williamr@2
|
254 |
__is.putback(__c);
|
williamr@2
|
255 |
break;
|
williamr@2
|
256 |
}
|
williamr@2
|
257 |
else
|
williamr@2
|
258 |
__tmp.push_back(__c);
|
williamr@2
|
259 |
}
|
williamr@2
|
260 |
|
williamr@2
|
261 |
if (__tmp.empty())
|
williamr@2
|
262 |
__is.clear(__is.rdstate() | ios::failbit);
|
williamr@2
|
263 |
else
|
williamr@2
|
264 |
__x._M_copy_from_string(__tmp, __STATIC_CAST(size_t,0), _Nb);
|
williamr@2
|
265 |
|
williamr@2
|
266 |
return __is;
|
williamr@2
|
267 |
}
|
williamr@2
|
268 |
|
williamr@2
|
269 |
# endif /* _STLP_USE_NEW_IOSTREAMS */
|
williamr@2
|
270 |
|
williamr@2
|
271 |
# endif /* _STLP_NON_TYPE_TMPL_PARAM_BUG */
|
williamr@2
|
272 |
|
williamr@2
|
273 |
|
williamr@2
|
274 |
# if defined (_STLP_EXPOSE_GLOBALS_IMPLEMENTATION)
|
williamr@2
|
275 |
|
williamr@2
|
276 |
// ------------------------------------------------------------
|
williamr@2
|
277 |
// Lookup tables for find and count operations.
|
williamr@2
|
278 |
|
williamr@2
|
279 |
# if ( _STLP_STATIC_TEMPLATE_DATA > 0 )
|
williamr@2
|
280 |
template<class _Dummy>
|
williamr@2
|
281 |
const unsigned char _Bs_G<_Dummy>::_S_bit_count[256] = {
|
williamr@2
|
282 |
# else
|
williamr@2
|
283 |
const unsigned char _Bs_G<bool>::_S_bit_count[256] _STLP_WEAK = {
|
williamr@2
|
284 |
# endif
|
williamr@2
|
285 |
0, /* 0 */ 1, /* 1 */ 1, /* 2 */ 2, /* 3 */ 1, /* 4 */
|
williamr@2
|
286 |
2, /* 5 */ 2, /* 6 */ 3, /* 7 */ 1, /* 8 */ 2, /* 9 */
|
williamr@2
|
287 |
2, /* 10 */ 3, /* 11 */ 2, /* 12 */ 3, /* 13 */ 3, /* 14 */
|
williamr@2
|
288 |
4, /* 15 */ 1, /* 16 */ 2, /* 17 */ 2, /* 18 */ 3, /* 19 */
|
williamr@2
|
289 |
2, /* 20 */ 3, /* 21 */ 3, /* 22 */ 4, /* 23 */ 2, /* 24 */
|
williamr@2
|
290 |
3, /* 25 */ 3, /* 26 */ 4, /* 27 */ 3, /* 28 */ 4, /* 29 */
|
williamr@2
|
291 |
4, /* 30 */ 5, /* 31 */ 1, /* 32 */ 2, /* 33 */ 2, /* 34 */
|
williamr@2
|
292 |
3, /* 35 */ 2, /* 36 */ 3, /* 37 */ 3, /* 38 */ 4, /* 39 */
|
williamr@2
|
293 |
2, /* 40 */ 3, /* 41 */ 3, /* 42 */ 4, /* 43 */ 3, /* 44 */
|
williamr@2
|
294 |
4, /* 45 */ 4, /* 46 */ 5, /* 47 */ 2, /* 48 */ 3, /* 49 */
|
williamr@2
|
295 |
3, /* 50 */ 4, /* 51 */ 3, /* 52 */ 4, /* 53 */ 4, /* 54 */
|
williamr@2
|
296 |
5, /* 55 */ 3, /* 56 */ 4, /* 57 */ 4, /* 58 */ 5, /* 59 */
|
williamr@2
|
297 |
4, /* 60 */ 5, /* 61 */ 5, /* 62 */ 6, /* 63 */ 1, /* 64 */
|
williamr@2
|
298 |
2, /* 65 */ 2, /* 66 */ 3, /* 67 */ 2, /* 68 */ 3, /* 69 */
|
williamr@2
|
299 |
3, /* 70 */ 4, /* 71 */ 2, /* 72 */ 3, /* 73 */ 3, /* 74 */
|
williamr@2
|
300 |
4, /* 75 */ 3, /* 76 */ 4, /* 77 */ 4, /* 78 */ 5, /* 79 */
|
williamr@2
|
301 |
2, /* 80 */ 3, /* 81 */ 3, /* 82 */ 4, /* 83 */ 3, /* 84 */
|
williamr@2
|
302 |
4, /* 85 */ 4, /* 86 */ 5, /* 87 */ 3, /* 88 */ 4, /* 89 */
|
williamr@2
|
303 |
4, /* 90 */ 5, /* 91 */ 4, /* 92 */ 5, /* 93 */ 5, /* 94 */
|
williamr@2
|
304 |
6, /* 95 */ 2, /* 96 */ 3, /* 97 */ 3, /* 98 */ 4, /* 99 */
|
williamr@2
|
305 |
3, /* 100 */ 4, /* 101 */ 4, /* 102 */ 5, /* 103 */ 3, /* 104 */
|
williamr@2
|
306 |
4, /* 105 */ 4, /* 106 */ 5, /* 107 */ 4, /* 108 */ 5, /* 109 */
|
williamr@2
|
307 |
5, /* 110 */ 6, /* 111 */ 3, /* 112 */ 4, /* 113 */ 4, /* 114 */
|
williamr@2
|
308 |
5, /* 115 */ 4, /* 116 */ 5, /* 117 */ 5, /* 118 */ 6, /* 119 */
|
williamr@2
|
309 |
4, /* 120 */ 5, /* 121 */ 5, /* 122 */ 6, /* 123 */ 5, /* 124 */
|
williamr@2
|
310 |
6, /* 125 */ 6, /* 126 */ 7, /* 127 */ 1, /* 128 */ 2, /* 129 */
|
williamr@2
|
311 |
2, /* 130 */ 3, /* 131 */ 2, /* 132 */ 3, /* 133 */ 3, /* 134 */
|
williamr@2
|
312 |
4, /* 135 */ 2, /* 136 */ 3, /* 137 */ 3, /* 138 */ 4, /* 139 */
|
williamr@2
|
313 |
3, /* 140 */ 4, /* 141 */ 4, /* 142 */ 5, /* 143 */ 2, /* 144 */
|
williamr@2
|
314 |
3, /* 145 */ 3, /* 146 */ 4, /* 147 */ 3, /* 148 */ 4, /* 149 */
|
williamr@2
|
315 |
4, /* 150 */ 5, /* 151 */ 3, /* 152 */ 4, /* 153 */ 4, /* 154 */
|
williamr@2
|
316 |
5, /* 155 */ 4, /* 156 */ 5, /* 157 */ 5, /* 158 */ 6, /* 159 */
|
williamr@2
|
317 |
2, /* 160 */ 3, /* 161 */ 3, /* 162 */ 4, /* 163 */ 3, /* 164 */
|
williamr@2
|
318 |
4, /* 165 */ 4, /* 166 */ 5, /* 167 */ 3, /* 168 */ 4, /* 169 */
|
williamr@2
|
319 |
4, /* 170 */ 5, /* 171 */ 4, /* 172 */ 5, /* 173 */ 5, /* 174 */
|
williamr@2
|
320 |
6, /* 175 */ 3, /* 176 */ 4, /* 177 */ 4, /* 178 */ 5, /* 179 */
|
williamr@2
|
321 |
4, /* 180 */ 5, /* 181 */ 5, /* 182 */ 6, /* 183 */ 4, /* 184 */
|
williamr@2
|
322 |
5, /* 185 */ 5, /* 186 */ 6, /* 187 */ 5, /* 188 */ 6, /* 189 */
|
williamr@2
|
323 |
6, /* 190 */ 7, /* 191 */ 2, /* 192 */ 3, /* 193 */ 3, /* 194 */
|
williamr@2
|
324 |
4, /* 195 */ 3, /* 196 */ 4, /* 197 */ 4, /* 198 */ 5, /* 199 */
|
williamr@2
|
325 |
3, /* 200 */ 4, /* 201 */ 4, /* 202 */ 5, /* 203 */ 4, /* 204 */
|
williamr@2
|
326 |
5, /* 205 */ 5, /* 206 */ 6, /* 207 */ 3, /* 208 */ 4, /* 209 */
|
williamr@2
|
327 |
4, /* 210 */ 5, /* 211 */ 4, /* 212 */ 5, /* 213 */ 5, /* 214 */
|
williamr@2
|
328 |
6, /* 215 */ 4, /* 216 */ 5, /* 217 */ 5, /* 218 */ 6, /* 219 */
|
williamr@2
|
329 |
5, /* 220 */ 6, /* 221 */ 6, /* 222 */ 7, /* 223 */ 3, /* 224 */
|
williamr@2
|
330 |
4, /* 225 */ 4, /* 226 */ 5, /* 227 */ 4, /* 228 */ 5, /* 229 */
|
williamr@2
|
331 |
5, /* 230 */ 6, /* 231 */ 4, /* 232 */ 5, /* 233 */ 5, /* 234 */
|
williamr@2
|
332 |
6, /* 235 */ 5, /* 236 */ 6, /* 237 */ 6, /* 238 */ 7, /* 239 */
|
williamr@2
|
333 |
4, /* 240 */ 5, /* 241 */ 5, /* 242 */ 6, /* 243 */ 5, /* 244 */
|
williamr@2
|
334 |
6, /* 245 */ 6, /* 246 */ 7, /* 247 */ 5, /* 248 */ 6, /* 249 */
|
williamr@2
|
335 |
6, /* 250 */ 7, /* 251 */ 6, /* 252 */ 7, /* 253 */ 7, /* 254 */
|
williamr@2
|
336 |
8 /* 255 */
|
williamr@2
|
337 |
}; // end _Bitset_global
|
williamr@2
|
338 |
|
williamr@2
|
339 |
# if ( _STLP_STATIC_TEMPLATE_DATA > 0 )
|
williamr@2
|
340 |
template<class _Dummy>
|
williamr@2
|
341 |
const unsigned char _Bs_G<_Dummy>::_S_first_one[256] = {
|
williamr@2
|
342 |
# else
|
williamr@2
|
343 |
const unsigned char _Bs_G<bool>::_S_first_one[256] _STLP_WEAK = {
|
williamr@2
|
344 |
# endif
|
williamr@2
|
345 |
|
williamr@2
|
346 |
0, /* 0 */ 0, /* 1 */ 1, /* 2 */ 0, /* 3 */ 2, /* 4 */
|
williamr@2
|
347 |
0, /* 5 */ 1, /* 6 */ 0, /* 7 */ 3, /* 8 */ 0, /* 9 */
|
williamr@2
|
348 |
1, /* 10 */ 0, /* 11 */ 2, /* 12 */ 0, /* 13 */ 1, /* 14 */
|
williamr@2
|
349 |
0, /* 15 */ 4, /* 16 */ 0, /* 17 */ 1, /* 18 */ 0, /* 19 */
|
williamr@2
|
350 |
2, /* 20 */ 0, /* 21 */ 1, /* 22 */ 0, /* 23 */ 3, /* 24 */
|
williamr@2
|
351 |
0, /* 25 */ 1, /* 26 */ 0, /* 27 */ 2, /* 28 */ 0, /* 29 */
|
williamr@2
|
352 |
1, /* 30 */ 0, /* 31 */ 5, /* 32 */ 0, /* 33 */ 1, /* 34 */
|
williamr@2
|
353 |
0, /* 35 */ 2, /* 36 */ 0, /* 37 */ 1, /* 38 */ 0, /* 39 */
|
williamr@2
|
354 |
3, /* 40 */ 0, /* 41 */ 1, /* 42 */ 0, /* 43 */ 2, /* 44 */
|
williamr@2
|
355 |
0, /* 45 */ 1, /* 46 */ 0, /* 47 */ 4, /* 48 */ 0, /* 49 */
|
williamr@2
|
356 |
1, /* 50 */ 0, /* 51 */ 2, /* 52 */ 0, /* 53 */ 1, /* 54 */
|
williamr@2
|
357 |
0, /* 55 */ 3, /* 56 */ 0, /* 57 */ 1, /* 58 */ 0, /* 59 */
|
williamr@2
|
358 |
2, /* 60 */ 0, /* 61 */ 1, /* 62 */ 0, /* 63 */ 6, /* 64 */
|
williamr@2
|
359 |
0, /* 65 */ 1, /* 66 */ 0, /* 67 */ 2, /* 68 */ 0, /* 69 */
|
williamr@2
|
360 |
1, /* 70 */ 0, /* 71 */ 3, /* 72 */ 0, /* 73 */ 1, /* 74 */
|
williamr@2
|
361 |
0, /* 75 */ 2, /* 76 */ 0, /* 77 */ 1, /* 78 */ 0, /* 79 */
|
williamr@2
|
362 |
4, /* 80 */ 0, /* 81 */ 1, /* 82 */ 0, /* 83 */ 2, /* 84 */
|
williamr@2
|
363 |
0, /* 85 */ 1, /* 86 */ 0, /* 87 */ 3, /* 88 */ 0, /* 89 */
|
williamr@2
|
364 |
1, /* 90 */ 0, /* 91 */ 2, /* 92 */ 0, /* 93 */ 1, /* 94 */
|
williamr@2
|
365 |
0, /* 95 */ 5, /* 96 */ 0, /* 97 */ 1, /* 98 */ 0, /* 99 */
|
williamr@2
|
366 |
2, /* 100 */ 0, /* 101 */ 1, /* 102 */ 0, /* 103 */ 3, /* 104 */
|
williamr@2
|
367 |
0, /* 105 */ 1, /* 106 */ 0, /* 107 */ 2, /* 108 */ 0, /* 109 */
|
williamr@2
|
368 |
1, /* 110 */ 0, /* 111 */ 4, /* 112 */ 0, /* 113 */ 1, /* 114 */
|
williamr@2
|
369 |
0, /* 115 */ 2, /* 116 */ 0, /* 117 */ 1, /* 118 */ 0, /* 119 */
|
williamr@2
|
370 |
3, /* 120 */ 0, /* 121 */ 1, /* 122 */ 0, /* 123 */ 2, /* 124 */
|
williamr@2
|
371 |
0, /* 125 */ 1, /* 126 */ 0, /* 127 */ 7, /* 128 */ 0, /* 129 */
|
williamr@2
|
372 |
1, /* 130 */ 0, /* 131 */ 2, /* 132 */ 0, /* 133 */ 1, /* 134 */
|
williamr@2
|
373 |
0, /* 135 */ 3, /* 136 */ 0, /* 137 */ 1, /* 138 */ 0, /* 139 */
|
williamr@2
|
374 |
2, /* 140 */ 0, /* 141 */ 1, /* 142 */ 0, /* 143 */ 4, /* 144 */
|
williamr@2
|
375 |
0, /* 145 */ 1, /* 146 */ 0, /* 147 */ 2, /* 148 */ 0, /* 149 */
|
williamr@2
|
376 |
1, /* 150 */ 0, /* 151 */ 3, /* 152 */ 0, /* 153 */ 1, /* 154 */
|
williamr@2
|
377 |
0, /* 155 */ 2, /* 156 */ 0, /* 157 */ 1, /* 158 */ 0, /* 159 */
|
williamr@2
|
378 |
5, /* 160 */ 0, /* 161 */ 1, /* 162 */ 0, /* 163 */ 2, /* 164 */
|
williamr@2
|
379 |
0, /* 165 */ 1, /* 166 */ 0, /* 167 */ 3, /* 168 */ 0, /* 169 */
|
williamr@2
|
380 |
1, /* 170 */ 0, /* 171 */ 2, /* 172 */ 0, /* 173 */ 1, /* 174 */
|
williamr@2
|
381 |
0, /* 175 */ 4, /* 176 */ 0, /* 177 */ 1, /* 178 */ 0, /* 179 */
|
williamr@2
|
382 |
2, /* 180 */ 0, /* 181 */ 1, /* 182 */ 0, /* 183 */ 3, /* 184 */
|
williamr@2
|
383 |
0, /* 185 */ 1, /* 186 */ 0, /* 187 */ 2, /* 188 */ 0, /* 189 */
|
williamr@2
|
384 |
1, /* 190 */ 0, /* 191 */ 6, /* 192 */ 0, /* 193 */ 1, /* 194 */
|
williamr@2
|
385 |
0, /* 195 */ 2, /* 196 */ 0, /* 197 */ 1, /* 198 */ 0, /* 199 */
|
williamr@2
|
386 |
3, /* 200 */ 0, /* 201 */ 1, /* 202 */ 0, /* 203 */ 2, /* 204 */
|
williamr@2
|
387 |
0, /* 205 */ 1, /* 206 */ 0, /* 207 */ 4, /* 208 */ 0, /* 209 */
|
williamr@2
|
388 |
1, /* 210 */ 0, /* 211 */ 2, /* 212 */ 0, /* 213 */ 1, /* 214 */
|
williamr@2
|
389 |
0, /* 215 */ 3, /* 216 */ 0, /* 217 */ 1, /* 218 */ 0, /* 219 */
|
williamr@2
|
390 |
2, /* 220 */ 0, /* 221 */ 1, /* 222 */ 0, /* 223 */ 5, /* 224 */
|
williamr@2
|
391 |
0, /* 225 */ 1, /* 226 */ 0, /* 227 */ 2, /* 228 */ 0, /* 229 */
|
williamr@2
|
392 |
1, /* 230 */ 0, /* 231 */ 3, /* 232 */ 0, /* 233 */ 1, /* 234 */
|
williamr@2
|
393 |
0, /* 235 */ 2, /* 236 */ 0, /* 237 */ 1, /* 238 */ 0, /* 239 */
|
williamr@2
|
394 |
4, /* 240 */ 0, /* 241 */ 1, /* 242 */ 0, /* 243 */ 2, /* 244 */
|
williamr@2
|
395 |
0, /* 245 */ 1, /* 246 */ 0, /* 247 */ 3, /* 248 */ 0, /* 249 */
|
williamr@2
|
396 |
1, /* 250 */ 0, /* 251 */ 2, /* 252 */ 0, /* 253 */ 1, /* 254 */
|
williamr@2
|
397 |
0, /* 255 */
|
williamr@2
|
398 |
}; // end _Bitset_global
|
williamr@2
|
399 |
|
williamr@2
|
400 |
# endif /* defined (_STLP_EXPOSE_GLOBALS_IMPLEMENTATION) */
|
williamr@2
|
401 |
|
williamr@2
|
402 |
_STLP_END_NAMESPACE
|
williamr@2
|
403 |
|
williamr@2
|
404 |
# undef __BITS_PER_WORD
|
williamr@2
|
405 |
# undef bitset
|
williamr@2
|
406 |
|
williamr@2
|
407 |
#endif /* _STLP_BITSET_C */
|