1 // -*- C++ -*- 2 //===---------------------------- bitset ----------------------------------===// 3 // 4 // The LLVM Compiler Infrastructure 5 // 6 // This file is dual licensed under the MIT and the University of Illinois Open 7 // Source Licenses. See LICENSE.TXT for details. 8 // 9 //===----------------------------------------------------------------------===// 10 11 #ifndef _LIBCPP_BITSET 12 #define _LIBCPP_BITSET 13 14 /* 15 bitset synopsis 16 17 namespace std 18 { 19 20 namespace std { 21 22 template <size_t N> 23 class bitset 24 { 25 public: 26 // bit reference: 27 class reference 28 { 29 friend class bitset; 30 reference() noexcept; 31 public: 32 ~reference() noexcept; 33 reference& operator=(bool x) noexcept; // for b[i] = x; 34 reference& operator=(const reference&) noexcept; // for b[i] = b[j]; 35 bool operator~() const noexcept; // flips the bit 36 operator bool() const noexcept; // for x = b[i]; 37 reference& flip() noexcept; // for b[i].flip(); 38 }; 39 40 // 23.3.5.1 constructors: 41 constexpr bitset() noexcept; 42 constexpr bitset(unsigned long long val) noexcept; 43 template <class charT> 44 explicit bitset(const charT* str, 45 typename basic_string<charT>::size_type n = basic_string<charT>::npos, 46 charT zero = charT('0'), charT one = charT('1')); 47 template<class charT, class traits, class Allocator> 48 explicit bitset(const basic_string<charT,traits,Allocator>& str, 49 typename basic_string<charT,traits,Allocator>::size_type pos = 0, 50 typename basic_string<charT,traits,Allocator>::size_type n = 51 basic_string<charT,traits,Allocator>::npos, 52 charT zero = charT('0'), charT one = charT('1')); 53 54 // 23.3.5.2 bitset operations: 55 bitset& operator&=(const bitset& rhs) noexcept; 56 bitset& operator|=(const bitset& rhs) noexcept; 57 bitset& operator^=(const bitset& rhs) noexcept; 58 bitset& operator<<=(size_t pos) noexcept; 59 bitset& operator>>=(size_t pos) noexcept; 60 bitset& set() noexcept; 61 bitset& set(size_t pos, bool val = true); 62 bitset& reset() noexcept; 63 bitset& reset(size_t pos); 64 bitset operator~() const noexcept; 65 bitset& flip() noexcept; 66 bitset& flip(size_t pos); 67 68 // element access: 69 constexpr bool operator[](size_t pos) const; // for b[i]; 70 reference operator[](size_t pos); // for b[i]; 71 unsigned long to_ulong() const; 72 unsigned long long to_ullong() const; 73 template <class charT, class traits, class Allocator> 74 basic_string<charT, traits, Allocator> to_string(charT zero = charT('0'), charT one = charT('1')) const; 75 template <class charT, class traits> 76 basic_string<charT, traits, allocator<charT> > to_string(charT zero = charT('0'), charT one = charT('1')) const; 77 template <class charT> 78 basic_string<charT, char_traits<charT>, allocator<charT> > to_string(charT zero = charT('0'), charT one = charT('1')) const; 79 basic_string<char, char_traits<char>, allocator<char> > to_string(char zero = '0', char one = '1') const; 80 size_t count() const noexcept; 81 constexpr size_t size() const noexcept; 82 bool operator==(const bitset& rhs) const noexcept; 83 bool operator!=(const bitset& rhs) const noexcept; 84 bool test(size_t pos) const; 85 bool all() const noexcept; 86 bool any() const noexcept; 87 bool none() const noexcept; 88 bitset operator<<(size_t pos) const noexcept; 89 bitset operator>>(size_t pos) const noexcept; 90 }; 91 92 // 23.3.5.3 bitset operators: 93 template <size_t N> 94 bitset<N> operator&(const bitset<N>&, const bitset<N>&) noexcept; 95 96 template <size_t N> 97 bitset<N> operator|(const bitset<N>&, const bitset<N>&) noexcept; 98 99 template <size_t N> 100 bitset<N> operator^(const bitset<N>&, const bitset<N>&) noexcept; 101 102 template <class charT, class traits, size_t N> 103 basic_istream<charT, traits>& 104 operator>>(basic_istream<charT, traits>& is, bitset<N>& x); 105 106 template <class charT, class traits, size_t N> 107 basic_ostream<charT, traits>& 108 operator<<(basic_ostream<charT, traits>& os, const bitset<N>& x); 109 110 template <size_t N> struct hash<std::bitset<N>>; 111 112 } // std 113 114 */ 115 116 #include <__config> 117 #include <__bit_reference> 118 #include <cstddef> 119 #include <climits> 120 #include <string> 121 #include <stdexcept> 122 #include <iosfwd> 123 #include <__functional_base> 124 125 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER) 126 #pragma GCC system_header 127 #endif 128 129 _LIBCPP_PUSH_MACROS 130 #include <__undef_macros> 131 132 133 _LIBCPP_BEGIN_NAMESPACE_STD 134 135 template <size_t _N_words, size_t _Size> 136 class __bitset; 137 138 template <size_t _N_words, size_t _Size> 139 struct __has_storage_type<__bitset<_N_words, _Size> > 140 { 141 static const bool value = true; 142 }; 143 144 template <size_t _N_words, size_t _Size> 145 class __bitset 146 { 147 public: 148 typedef ptrdiff_t difference_type; 149 typedef size_t size_type; 150 typedef size_type __storage_type; 151 protected: 152 typedef __bitset __self; 153 typedef __storage_type* __storage_pointer; 154 typedef const __storage_type* __const_storage_pointer; 155 static const unsigned __bits_per_word = static_cast<unsigned>(sizeof(__storage_type) * CHAR_BIT); 156 157 friend class __bit_reference<__bitset>; 158 friend class __bit_const_reference<__bitset>; 159 friend class __bit_iterator<__bitset, false>; 160 friend class __bit_iterator<__bitset, true>; 161 friend struct __bit_array<__bitset>; 162 163 __storage_type __first_[_N_words]; 164 165 typedef __bit_reference<__bitset> reference; 166 typedef __bit_const_reference<__bitset> const_reference; 167 typedef __bit_iterator<__bitset, false> iterator; 168 typedef __bit_iterator<__bitset, true> const_iterator; 169 170 _LIBCPP_INLINE_VISIBILITY 171 _LIBCPP_CONSTEXPR __bitset() _NOEXCEPT; 172 _LIBCPP_INLINE_VISIBILITY 173 explicit _LIBCPP_CONSTEXPR __bitset(unsigned long long __v) _NOEXCEPT; 174 175 _LIBCPP_INLINE_VISIBILITY reference __make_ref(size_t __pos) _NOEXCEPT 176 {return reference(__first_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word);} 177 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR const_reference __make_ref(size_t __pos) const _NOEXCEPT 178 {return const_reference(__first_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word);} 179 _LIBCPP_INLINE_VISIBILITY iterator __make_iter(size_t __pos) _NOEXCEPT 180 {return iterator(__first_ + __pos / __bits_per_word, __pos % __bits_per_word);} 181 _LIBCPP_INLINE_VISIBILITY const_iterator __make_iter(size_t __pos) const _NOEXCEPT 182 {return const_iterator(__first_ + __pos / __bits_per_word, __pos % __bits_per_word);} 183 184 _LIBCPP_INLINE_VISIBILITY 185 void operator&=(const __bitset& __v) _NOEXCEPT; 186 _LIBCPP_INLINE_VISIBILITY 187 void operator|=(const __bitset& __v) _NOEXCEPT; 188 _LIBCPP_INLINE_VISIBILITY 189 void operator^=(const __bitset& __v) _NOEXCEPT; 190 191 void flip() _NOEXCEPT; 192 _LIBCPP_INLINE_VISIBILITY unsigned long to_ulong() const 193 {return to_ulong(integral_constant<bool, _Size < sizeof(unsigned long) * CHAR_BIT>());} 194 _LIBCPP_INLINE_VISIBILITY unsigned long long to_ullong() const 195 {return to_ullong(integral_constant<bool, _Size < sizeof(unsigned long long) * CHAR_BIT>());} 196 197 bool all() const _NOEXCEPT; 198 bool any() const _NOEXCEPT; 199 _LIBCPP_INLINE_VISIBILITY 200 size_t __hash_code() const _NOEXCEPT; 201 private: 202 #ifdef _LIBCPP_CXX03_LANG 203 void __init(unsigned long long __v, false_type) _NOEXCEPT; 204 _LIBCPP_INLINE_VISIBILITY 205 void __init(unsigned long long __v, true_type) _NOEXCEPT; 206 #endif // _LIBCPP_CXX03_LANG 207 unsigned long to_ulong(false_type) const; 208 _LIBCPP_INLINE_VISIBILITY 209 unsigned long to_ulong(true_type) const; 210 unsigned long long to_ullong(false_type) const; 211 _LIBCPP_INLINE_VISIBILITY 212 unsigned long long to_ullong(true_type) const; 213 _LIBCPP_INLINE_VISIBILITY 214 unsigned long long to_ullong(true_type, false_type) const; 215 unsigned long long to_ullong(true_type, true_type) const; 216 }; 217 218 template <size_t _N_words, size_t _Size> 219 inline 220 _LIBCPP_CONSTEXPR 221 __bitset<_N_words, _Size>::__bitset() _NOEXCEPT 222 #ifndef _LIBCPP_CXX03_LANG 223 : __first_{0} 224 #endif 225 { 226 #ifdef _LIBCPP_CXX03_LANG 227 _VSTD::fill_n(__first_, _N_words, __storage_type(0)); 228 #endif 229 } 230 231 #ifdef _LIBCPP_CXX03_LANG 232 233 template <size_t _N_words, size_t _Size> 234 void 235 __bitset<_N_words, _Size>::__init(unsigned long long __v, false_type) _NOEXCEPT 236 { 237 __storage_type __t[sizeof(unsigned long long) / sizeof(__storage_type)]; 238 size_t __sz = _Size; 239 for (size_t __i = 0; __i < sizeof(__t)/sizeof(__t[0]); ++__i, __v >>= __bits_per_word, __sz -= __bits_per_word ) 240 if ( __sz < __bits_per_word) 241 __t[__i] = static_cast<__storage_type>(__v) & ( 1ULL << __sz ) - 1; 242 else 243 __t[__i] = static_cast<__storage_type>(__v); 244 245 _VSTD::copy(__t, __t + sizeof(__t)/sizeof(__t[0]), __first_); 246 _VSTD::fill(__first_ + sizeof(__t)/sizeof(__t[0]), __first_ + sizeof(__first_)/sizeof(__first_[0]), 247 __storage_type(0)); 248 } 249 250 template <size_t _N_words, size_t _Size> 251 inline _LIBCPP_INLINE_VISIBILITY 252 void 253 __bitset<_N_words, _Size>::__init(unsigned long long __v, true_type) _NOEXCEPT 254 { 255 __first_[0] = __v; 256 if (_Size < __bits_per_word) 257 __first_[0] &= ( 1ULL << _Size ) - 1; 258 259 _VSTD::fill(__first_ + 1, __first_ + sizeof(__first_)/sizeof(__first_[0]), __storage_type(0)); 260 } 261 262 #endif // _LIBCPP_CXX03_LANG 263 264 template <size_t _N_words, size_t _Size> 265 inline 266 _LIBCPP_CONSTEXPR 267 __bitset<_N_words, _Size>::__bitset(unsigned long long __v) _NOEXCEPT 268 #ifndef _LIBCPP_CXX03_LANG 269 #if __SIZEOF_SIZE_T__ == 8 270 : __first_{__v} 271 #elif __SIZEOF_SIZE_T__ == 4 272 : __first_{static_cast<__storage_type>(__v), 273 _Size >= 2 * __bits_per_word ? static_cast<__storage_type>(__v >> __bits_per_word) 274 : static_cast<__storage_type>((__v >> __bits_per_word) & (__storage_type(1) << (_Size - __bits_per_word)) - 1)} 275 #else 276 #error This constructor has not been ported to this platform 277 #endif 278 #endif 279 { 280 #ifdef _LIBCPP_CXX03_LANG 281 __init(__v, integral_constant<bool, sizeof(unsigned long long) == sizeof(__storage_type)>()); 282 #endif 283 } 284 285 template <size_t _N_words, size_t _Size> 286 inline 287 void 288 __bitset<_N_words, _Size>::operator&=(const __bitset& __v) _NOEXCEPT 289 { 290 for (size_type __i = 0; __i < _N_words; ++__i) 291 __first_[__i] &= __v.__first_[__i]; 292 } 293 294 template <size_t _N_words, size_t _Size> 295 inline 296 void 297 __bitset<_N_words, _Size>::operator|=(const __bitset& __v) _NOEXCEPT 298 { 299 for (size_type __i = 0; __i < _N_words; ++__i) 300 __first_[__i] |= __v.__first_[__i]; 301 } 302 303 template <size_t _N_words, size_t _Size> 304 inline 305 void 306 __bitset<_N_words, _Size>::operator^=(const __bitset& __v) _NOEXCEPT 307 { 308 for (size_type __i = 0; __i < _N_words; ++__i) 309 __first_[__i] ^= __v.__first_[__i]; 310 } 311 312 template <size_t _N_words, size_t _Size> 313 void 314 __bitset<_N_words, _Size>::flip() _NOEXCEPT 315 { 316 // do middle whole words 317 size_type __n = _Size; 318 __storage_pointer __p = __first_; 319 for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word) 320 *__p = ~*__p; 321 // do last partial word 322 if (__n > 0) 323 { 324 __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n); 325 __storage_type __b = *__p & __m; 326 *__p &= ~__m; 327 *__p |= ~__b & __m; 328 } 329 } 330 331 template <size_t _N_words, size_t _Size> 332 unsigned long 333 __bitset<_N_words, _Size>::to_ulong(false_type) const 334 { 335 const_iterator __e = __make_iter(_Size); 336 const_iterator __i = _VSTD::find(__make_iter(sizeof(unsigned long) * CHAR_BIT), __e, true); 337 if (__i != __e) 338 __throw_overflow_error("bitset to_ulong overflow error"); 339 340 return __first_[0]; 341 } 342 343 template <size_t _N_words, size_t _Size> 344 inline 345 unsigned long 346 __bitset<_N_words, _Size>::to_ulong(true_type) const 347 { 348 return __first_[0]; 349 } 350 351 template <size_t _N_words, size_t _Size> 352 unsigned long long 353 __bitset<_N_words, _Size>::to_ullong(false_type) const 354 { 355 const_iterator __e = __make_iter(_Size); 356 const_iterator __i = _VSTD::find(__make_iter(sizeof(unsigned long long) * CHAR_BIT), __e, true); 357 if (__i != __e) 358 __throw_overflow_error("bitset to_ullong overflow error"); 359 360 return to_ullong(true_type()); 361 } 362 363 template <size_t _N_words, size_t _Size> 364 inline 365 unsigned long long 366 __bitset<_N_words, _Size>::to_ullong(true_type) const 367 { 368 return to_ullong(true_type(), integral_constant<bool, sizeof(__storage_type) < sizeof(unsigned long long)>()); 369 } 370 371 template <size_t _N_words, size_t _Size> 372 inline 373 unsigned long long 374 __bitset<_N_words, _Size>::to_ullong(true_type, false_type) const 375 { 376 return __first_[0]; 377 } 378 379 template <size_t _N_words, size_t _Size> 380 unsigned long long 381 __bitset<_N_words, _Size>::to_ullong(true_type, true_type) const 382 { 383 unsigned long long __r = __first_[0]; 384 for (std::size_t __i = 1; __i < sizeof(unsigned long long) / sizeof(__storage_type); ++__i) 385 __r |= static_cast<unsigned long long>(__first_[__i]) << (sizeof(__storage_type) * CHAR_BIT); 386 return __r; 387 } 388 389 template <size_t _N_words, size_t _Size> 390 bool 391 __bitset<_N_words, _Size>::all() const _NOEXCEPT 392 { 393 // do middle whole words 394 size_type __n = _Size; 395 __const_storage_pointer __p = __first_; 396 for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word) 397 if (~*__p) 398 return false; 399 // do last partial word 400 if (__n > 0) 401 { 402 __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n); 403 if (~*__p & __m) 404 return false; 405 } 406 return true; 407 } 408 409 template <size_t _N_words, size_t _Size> 410 bool 411 __bitset<_N_words, _Size>::any() const _NOEXCEPT 412 { 413 // do middle whole words 414 size_type __n = _Size; 415 __const_storage_pointer __p = __first_; 416 for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word) 417 if (*__p) 418 return true; 419 // do last partial word 420 if (__n > 0) 421 { 422 __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n); 423 if (*__p & __m) 424 return true; 425 } 426 return false; 427 } 428 429 template <size_t _N_words, size_t _Size> 430 inline 431 size_t 432 __bitset<_N_words, _Size>::__hash_code() const _NOEXCEPT 433 { 434 size_t __h = 0; 435 for (size_type __i = 0; __i < _N_words; ++__i) 436 __h ^= __first_[__i]; 437 return __h; 438 } 439 440 template <size_t _Size> 441 class __bitset<1, _Size> 442 { 443 public: 444 typedef ptrdiff_t difference_type; 445 typedef size_t size_type; 446 typedef size_type __storage_type; 447 protected: 448 typedef __bitset __self; 449 typedef __storage_type* __storage_pointer; 450 typedef const __storage_type* __const_storage_pointer; 451 static const unsigned __bits_per_word = static_cast<unsigned>(sizeof(__storage_type) * CHAR_BIT); 452 453 friend class __bit_reference<__bitset>; 454 friend class __bit_const_reference<__bitset>; 455 friend class __bit_iterator<__bitset, false>; 456 friend class __bit_iterator<__bitset, true>; 457 friend struct __bit_array<__bitset>; 458 459 __storage_type __first_; 460 461 typedef __bit_reference<__bitset> reference; 462 typedef __bit_const_reference<__bitset> const_reference; 463 typedef __bit_iterator<__bitset, false> iterator; 464 typedef __bit_iterator<__bitset, true> const_iterator; 465 466 _LIBCPP_INLINE_VISIBILITY 467 _LIBCPP_CONSTEXPR __bitset() _NOEXCEPT; 468 _LIBCPP_INLINE_VISIBILITY 469 explicit _LIBCPP_CONSTEXPR __bitset(unsigned long long __v) _NOEXCEPT; 470 471 _LIBCPP_INLINE_VISIBILITY reference __make_ref(size_t __pos) _NOEXCEPT 472 {return reference(&__first_, __storage_type(1) << __pos);} 473 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR const_reference __make_ref(size_t __pos) const _NOEXCEPT 474 {return const_reference(&__first_, __storage_type(1) << __pos);} 475 _LIBCPP_INLINE_VISIBILITY iterator __make_iter(size_t __pos) _NOEXCEPT 476 {return iterator(&__first_ + __pos / __bits_per_word, __pos % __bits_per_word);} 477 _LIBCPP_INLINE_VISIBILITY const_iterator __make_iter(size_t __pos) const _NOEXCEPT 478 {return const_iterator(&__first_ + __pos / __bits_per_word, __pos % __bits_per_word);} 479 480 _LIBCPP_INLINE_VISIBILITY 481 void operator&=(const __bitset& __v) _NOEXCEPT; 482 _LIBCPP_INLINE_VISIBILITY 483 void operator|=(const __bitset& __v) _NOEXCEPT; 484 _LIBCPP_INLINE_VISIBILITY 485 void operator^=(const __bitset& __v) _NOEXCEPT; 486 487 _LIBCPP_INLINE_VISIBILITY 488 void flip() _NOEXCEPT; 489 490 _LIBCPP_INLINE_VISIBILITY 491 unsigned long to_ulong() const; 492 _LIBCPP_INLINE_VISIBILITY 493 unsigned long long to_ullong() const; 494 495 _LIBCPP_INLINE_VISIBILITY 496 bool all() const _NOEXCEPT; 497 _LIBCPP_INLINE_VISIBILITY 498 bool any() const _NOEXCEPT; 499 500 _LIBCPP_INLINE_VISIBILITY 501 size_t __hash_code() const _NOEXCEPT; 502 }; 503 504 template <size_t _Size> 505 inline 506 _LIBCPP_CONSTEXPR 507 __bitset<1, _Size>::__bitset() _NOEXCEPT 508 : __first_(0) 509 { 510 } 511 512 template <size_t _Size> 513 inline 514 _LIBCPP_CONSTEXPR 515 __bitset<1, _Size>::__bitset(unsigned long long __v) _NOEXCEPT 516 : __first_( 517 _Size == __bits_per_word ? static_cast<__storage_type>(__v) 518 : static_cast<__storage_type>(__v) & ((__storage_type(1) << _Size) - 1) 519 ) 520 { 521 } 522 523 template <size_t _Size> 524 inline 525 void 526 __bitset<1, _Size>::operator&=(const __bitset& __v) _NOEXCEPT 527 { 528 __first_ &= __v.__first_; 529 } 530 531 template <size_t _Size> 532 inline 533 void 534 __bitset<1, _Size>::operator|=(const __bitset& __v) _NOEXCEPT 535 { 536 __first_ |= __v.__first_; 537 } 538 539 template <size_t _Size> 540 inline 541 void 542 __bitset<1, _Size>::operator^=(const __bitset& __v) _NOEXCEPT 543 { 544 __first_ ^= __v.__first_; 545 } 546 547 template <size_t _Size> 548 inline 549 void 550 __bitset<1, _Size>::flip() _NOEXCEPT 551 { 552 __storage_type __m = ~__storage_type(0) >> (__bits_per_word - _Size); 553 __first_ = ~__first_; 554 __first_ &= __m; 555 } 556 557 template <size_t _Size> 558 inline 559 unsigned long 560 __bitset<1, _Size>::to_ulong() const 561 { 562 return __first_; 563 } 564 565 template <size_t _Size> 566 inline 567 unsigned long long 568 __bitset<1, _Size>::to_ullong() const 569 { 570 return __first_; 571 } 572 573 template <size_t _Size> 574 inline 575 bool 576 __bitset<1, _Size>::all() const _NOEXCEPT 577 { 578 __storage_type __m = ~__storage_type(0) >> (__bits_per_word - _Size); 579 return !(~__first_ & __m); 580 } 581 582 template <size_t _Size> 583 inline 584 bool 585 __bitset<1, _Size>::any() const _NOEXCEPT 586 { 587 __storage_type __m = ~__storage_type(0) >> (__bits_per_word - _Size); 588 return __first_ & __m; 589 } 590 591 template <size_t _Size> 592 inline 593 size_t 594 __bitset<1, _Size>::__hash_code() const _NOEXCEPT 595 { 596 return __first_; 597 } 598 599 template <> 600 class __bitset<0, 0> 601 { 602 public: 603 typedef ptrdiff_t difference_type; 604 typedef size_t size_type; 605 typedef size_type __storage_type; 606 protected: 607 typedef __bitset __self; 608 typedef __storage_type* __storage_pointer; 609 typedef const __storage_type* __const_storage_pointer; 610 static const unsigned __bits_per_word = static_cast<unsigned>(sizeof(__storage_type) * CHAR_BIT); 611 612 friend class __bit_reference<__bitset>; 613 friend class __bit_const_reference<__bitset>; 614 friend class __bit_iterator<__bitset, false>; 615 friend class __bit_iterator<__bitset, true>; 616 friend struct __bit_array<__bitset>; 617 618 typedef __bit_reference<__bitset> reference; 619 typedef __bit_const_reference<__bitset> const_reference; 620 typedef __bit_iterator<__bitset, false> iterator; 621 typedef __bit_iterator<__bitset, true> const_iterator; 622 623 _LIBCPP_INLINE_VISIBILITY 624 _LIBCPP_CONSTEXPR __bitset() _NOEXCEPT; 625 _LIBCPP_INLINE_VISIBILITY 626 explicit _LIBCPP_CONSTEXPR __bitset(unsigned long long) _NOEXCEPT; 627 628 _LIBCPP_INLINE_VISIBILITY reference __make_ref(size_t) _NOEXCEPT 629 {return reference(0, 1);} 630 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR const_reference __make_ref(size_t) const _NOEXCEPT 631 {return const_reference(0, 1);} 632 _LIBCPP_INLINE_VISIBILITY iterator __make_iter(size_t) _NOEXCEPT 633 {return iterator(0, 0);} 634 _LIBCPP_INLINE_VISIBILITY const_iterator __make_iter(size_t) const _NOEXCEPT 635 {return const_iterator(0, 0);} 636 637 _LIBCPP_INLINE_VISIBILITY void operator&=(const __bitset&) _NOEXCEPT {} 638 _LIBCPP_INLINE_VISIBILITY void operator|=(const __bitset&) _NOEXCEPT {} 639 _LIBCPP_INLINE_VISIBILITY void operator^=(const __bitset&) _NOEXCEPT {} 640 641 _LIBCPP_INLINE_VISIBILITY void flip() _NOEXCEPT {} 642 643 _LIBCPP_INLINE_VISIBILITY unsigned long to_ulong() const {return 0;} 644 _LIBCPP_INLINE_VISIBILITY unsigned long long to_ullong() const {return 0;} 645 646 _LIBCPP_INLINE_VISIBILITY bool all() const _NOEXCEPT {return true;} 647 _LIBCPP_INLINE_VISIBILITY bool any() const _NOEXCEPT {return false;} 648 649 _LIBCPP_INLINE_VISIBILITY size_t __hash_code() const _NOEXCEPT {return 0;} 650 }; 651 652 inline 653 _LIBCPP_CONSTEXPR 654 __bitset<0, 0>::__bitset() _NOEXCEPT 655 { 656 } 657 658 inline 659 _LIBCPP_CONSTEXPR 660 __bitset<0, 0>::__bitset(unsigned long long) _NOEXCEPT 661 { 662 } 663 664 template <size_t _Size> class _LIBCPP_TEMPLATE_VIS bitset; 665 template <size_t _Size> struct hash<bitset<_Size> >; 666 667 template <size_t _Size> 668 class _LIBCPP_TEMPLATE_VIS bitset 669 : private __bitset<_Size == 0 ? 0 : (_Size - 1) / (sizeof(size_t) * CHAR_BIT) + 1, _Size> 670 { 671 public: 672 static const unsigned __n_words = _Size == 0 ? 0 : (_Size - 1) / (sizeof(size_t) * CHAR_BIT) + 1; 673 typedef __bitset<__n_words, _Size> base; 674 675 public: 676 typedef typename base::reference reference; 677 typedef typename base::const_reference const_reference; 678 679 // 23.3.5.1 constructors: 680 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR bitset() _NOEXCEPT {} 681 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 682 bitset(unsigned long long __v) _NOEXCEPT : base(__v) {} 683 template<class _CharT> 684 explicit bitset(const _CharT* __str, 685 typename basic_string<_CharT>::size_type __n = basic_string<_CharT>::npos, 686 _CharT __zero = _CharT('0'), _CharT __one = _CharT('1')); 687 template<class _CharT, class _Traits, class _Allocator> 688 explicit bitset(const basic_string<_CharT,_Traits,_Allocator>& __str, 689 typename basic_string<_CharT,_Traits,_Allocator>::size_type __pos = 0, 690 typename basic_string<_CharT,_Traits,_Allocator>::size_type __n = 691 (basic_string<_CharT,_Traits,_Allocator>::npos), 692 _CharT __zero = _CharT('0'), _CharT __one = _CharT('1')); 693 694 // 23.3.5.2 bitset operations: 695 _LIBCPP_INLINE_VISIBILITY 696 bitset& operator&=(const bitset& __rhs) _NOEXCEPT; 697 _LIBCPP_INLINE_VISIBILITY 698 bitset& operator|=(const bitset& __rhs) _NOEXCEPT; 699 _LIBCPP_INLINE_VISIBILITY 700 bitset& operator^=(const bitset& __rhs) _NOEXCEPT; 701 bitset& operator<<=(size_t __pos) _NOEXCEPT; 702 bitset& operator>>=(size_t __pos) _NOEXCEPT; 703 _LIBCPP_INLINE_VISIBILITY 704 bitset& set() _NOEXCEPT; 705 bitset& set(size_t __pos, bool __val = true); 706 _LIBCPP_INLINE_VISIBILITY 707 bitset& reset() _NOEXCEPT; 708 bitset& reset(size_t __pos); 709 _LIBCPP_INLINE_VISIBILITY 710 bitset operator~() const _NOEXCEPT; 711 _LIBCPP_INLINE_VISIBILITY 712 bitset& flip() _NOEXCEPT; 713 bitset& flip(size_t __pos); 714 715 // element access: 716 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR 717 const_reference operator[](size_t __p) const {return base::__make_ref(__p);} 718 _LIBCPP_INLINE_VISIBILITY reference operator[](size_t __p) {return base::__make_ref(__p);} 719 _LIBCPP_INLINE_VISIBILITY 720 unsigned long to_ulong() const; 721 _LIBCPP_INLINE_VISIBILITY 722 unsigned long long to_ullong() const; 723 template <class _CharT, class _Traits, class _Allocator> 724 basic_string<_CharT, _Traits, _Allocator> to_string(_CharT __zero = _CharT('0'), 725 _CharT __one = _CharT('1')) const; 726 template <class _CharT, class _Traits> 727 _LIBCPP_INLINE_VISIBILITY 728 basic_string<_CharT, _Traits, allocator<_CharT> > to_string(_CharT __zero = _CharT('0'), 729 _CharT __one = _CharT('1')) const; 730 template <class _CharT> 731 _LIBCPP_INLINE_VISIBILITY 732 basic_string<_CharT, char_traits<_CharT>, allocator<_CharT> > to_string(_CharT __zero = _CharT('0'), 733 _CharT __one = _CharT('1')) const; 734 _LIBCPP_INLINE_VISIBILITY 735 basic_string<char, char_traits<char>, allocator<char> > to_string(char __zero = '0', 736 char __one = '1') const; 737 _LIBCPP_INLINE_VISIBILITY 738 size_t count() const _NOEXCEPT; 739 _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR size_t size() const _NOEXCEPT {return _Size;} 740 _LIBCPP_INLINE_VISIBILITY 741 bool operator==(const bitset& __rhs) const _NOEXCEPT; 742 _LIBCPP_INLINE_VISIBILITY 743 bool operator!=(const bitset& __rhs) const _NOEXCEPT; 744 bool test(size_t __pos) const; 745 _LIBCPP_INLINE_VISIBILITY 746 bool all() const _NOEXCEPT; 747 _LIBCPP_INLINE_VISIBILITY 748 bool any() const _NOEXCEPT; 749 _LIBCPP_INLINE_VISIBILITY bool none() const _NOEXCEPT {return !any();} 750 _LIBCPP_INLINE_VISIBILITY 751 bitset operator<<(size_t __pos) const _NOEXCEPT; 752 _LIBCPP_INLINE_VISIBILITY 753 bitset operator>>(size_t __pos) const _NOEXCEPT; 754 755 private: 756 757 _LIBCPP_INLINE_VISIBILITY 758 size_t __hash_code() const _NOEXCEPT {return base::__hash_code();} 759 760 friend struct hash<bitset>; 761 }; 762 763 template <size_t _Size> 764 template<class _CharT> 765 bitset<_Size>::bitset(const _CharT* __str, 766 typename basic_string<_CharT>::size_type __n, 767 _CharT __zero, _CharT __one) 768 { 769 size_t __rlen = _VSTD::min(__n, char_traits<_CharT>::length(__str)); 770 for (size_t __i = 0; __i < __rlen; ++__i) 771 if (__str[__i] != __zero && __str[__i] != __one) 772 __throw_invalid_argument("bitset string ctor has invalid argument"); 773 774 size_t _Mp = _VSTD::min(__rlen, _Size); 775 size_t __i = 0; 776 for (; __i < _Mp; ++__i) 777 { 778 _CharT __c = __str[_Mp - 1 - __i]; 779 if (__c == __zero) 780 (*this)[__i] = false; 781 else 782 (*this)[__i] = true; 783 } 784 _VSTD::fill(base::__make_iter(__i), base::__make_iter(_Size), false); 785 } 786 787 template <size_t _Size> 788 template<class _CharT, class _Traits, class _Allocator> 789 bitset<_Size>::bitset(const basic_string<_CharT,_Traits,_Allocator>& __str, 790 typename basic_string<_CharT,_Traits,_Allocator>::size_type __pos, 791 typename basic_string<_CharT,_Traits,_Allocator>::size_type __n, 792 _CharT __zero, _CharT __one) 793 { 794 if (__pos > __str.size()) 795 __throw_out_of_range("bitset string pos out of range"); 796 797 size_t __rlen = _VSTD::min(__n, __str.size() - __pos); 798 for (size_t __i = __pos; __i < __pos + __rlen; ++__i) 799 if (!_Traits::eq(__str[__i], __zero) && !_Traits::eq(__str[__i], __one)) 800 __throw_invalid_argument("bitset string ctor has invalid argument"); 801 802 size_t _Mp = _VSTD::min(__rlen, _Size); 803 size_t __i = 0; 804 for (; __i < _Mp; ++__i) 805 { 806 _CharT __c = __str[__pos + _Mp - 1 - __i]; 807 if (_Traits::eq(__c, __zero)) 808 (*this)[__i] = false; 809 else 810 (*this)[__i] = true; 811 } 812 _VSTD::fill(base::__make_iter(__i), base::__make_iter(_Size), false); 813 } 814 815 template <size_t _Size> 816 inline 817 bitset<_Size>& 818 bitset<_Size>::operator&=(const bitset& __rhs) _NOEXCEPT 819 { 820 base::operator&=(__rhs); 821 return *this; 822 } 823 824 template <size_t _Size> 825 inline 826 bitset<_Size>& 827 bitset<_Size>::operator|=(const bitset& __rhs) _NOEXCEPT 828 { 829 base::operator|=(__rhs); 830 return *this; 831 } 832 833 template <size_t _Size> 834 inline 835 bitset<_Size>& 836 bitset<_Size>::operator^=(const bitset& __rhs) _NOEXCEPT 837 { 838 base::operator^=(__rhs); 839 return *this; 840 } 841 842 template <size_t _Size> 843 bitset<_Size>& 844 bitset<_Size>::operator<<=(size_t __pos) _NOEXCEPT 845 { 846 __pos = _VSTD::min(__pos, _Size); 847 _VSTD::copy_backward(base::__make_iter(0), base::__make_iter(_Size - __pos), base::__make_iter(_Size)); 848 _VSTD::fill_n(base::__make_iter(0), __pos, false); 849 return *this; 850 } 851 852 template <size_t _Size> 853 bitset<_Size>& 854 bitset<_Size>::operator>>=(size_t __pos) _NOEXCEPT 855 { 856 __pos = _VSTD::min(__pos, _Size); 857 _VSTD::copy(base::__make_iter(__pos), base::__make_iter(_Size), base::__make_iter(0)); 858 _VSTD::fill_n(base::__make_iter(_Size - __pos), __pos, false); 859 return *this; 860 } 861 862 template <size_t _Size> 863 inline 864 bitset<_Size>& 865 bitset<_Size>::set() _NOEXCEPT 866 { 867 _VSTD::fill_n(base::__make_iter(0), _Size, true); 868 return *this; 869 } 870 871 template <size_t _Size> 872 bitset<_Size>& 873 bitset<_Size>::set(size_t __pos, bool __val) 874 { 875 if (__pos >= _Size) 876 __throw_out_of_range("bitset set argument out of range"); 877 878 (*this)[__pos] = __val; 879 return *this; 880 } 881 882 template <size_t _Size> 883 inline 884 bitset<_Size>& 885 bitset<_Size>::reset() _NOEXCEPT 886 { 887 _VSTD::fill_n(base::__make_iter(0), _Size, false); 888 return *this; 889 } 890 891 template <size_t _Size> 892 bitset<_Size>& 893 bitset<_Size>::reset(size_t __pos) 894 { 895 if (__pos >= _Size) 896 __throw_out_of_range("bitset reset argument out of range"); 897 898 (*this)[__pos] = false; 899 return *this; 900 } 901 902 template <size_t _Size> 903 inline 904 bitset<_Size> 905 bitset<_Size>::operator~() const _NOEXCEPT 906 { 907 bitset __x(*this); 908 __x.flip(); 909 return __x; 910 } 911 912 template <size_t _Size> 913 inline 914 bitset<_Size>& 915 bitset<_Size>::flip() _NOEXCEPT 916 { 917 base::flip(); 918 return *this; 919 } 920 921 template <size_t _Size> 922 bitset<_Size>& 923 bitset<_Size>::flip(size_t __pos) 924 { 925 if (__pos >= _Size) 926 __throw_out_of_range("bitset flip argument out of range"); 927 928 reference r = base::__make_ref(__pos); 929 r = ~r; 930 return *this; 931 } 932 933 template <size_t _Size> 934 inline 935 unsigned long 936 bitset<_Size>::to_ulong() const 937 { 938 return base::to_ulong(); 939 } 940 941 template <size_t _Size> 942 inline 943 unsigned long long 944 bitset<_Size>::to_ullong() const 945 { 946 return base::to_ullong(); 947 } 948 949 template <size_t _Size> 950 template <class _CharT, class _Traits, class _Allocator> 951 basic_string<_CharT, _Traits, _Allocator> 952 bitset<_Size>::to_string(_CharT __zero, _CharT __one) const 953 { 954 basic_string<_CharT, _Traits, _Allocator> __r(_Size, __zero); 955 for (size_t __i = 0; __i < _Size; ++__i) 956 { 957 if ((*this)[__i]) 958 __r[_Size - 1 - __i] = __one; 959 } 960 return __r; 961 } 962 963 template <size_t _Size> 964 template <class _CharT, class _Traits> 965 inline 966 basic_string<_CharT, _Traits, allocator<_CharT> > 967 bitset<_Size>::to_string(_CharT __zero, _CharT __one) const 968 { 969 return to_string<_CharT, _Traits, allocator<_CharT> >(__zero, __one); 970 } 971 972 template <size_t _Size> 973 template <class _CharT> 974 inline 975 basic_string<_CharT, char_traits<_CharT>, allocator<_CharT> > 976 bitset<_Size>::to_string(_CharT __zero, _CharT __one) const 977 { 978 return to_string<_CharT, char_traits<_CharT>, allocator<_CharT> >(__zero, __one); 979 } 980 981 template <size_t _Size> 982 inline 983 basic_string<char, char_traits<char>, allocator<char> > 984 bitset<_Size>::to_string(char __zero, char __one) const 985 { 986 return to_string<char, char_traits<char>, allocator<char> >(__zero, __one); 987 } 988 989 template <size_t _Size> 990 inline 991 size_t 992 bitset<_Size>::count() const _NOEXCEPT 993 { 994 return static_cast<size_t>(_VSTD::count(base::__make_iter(0), base::__make_iter(_Size), true)); 995 } 996 997 template <size_t _Size> 998 inline 999 bool 1000 bitset<_Size>::operator==(const bitset& __rhs) const _NOEXCEPT 1001 { 1002 return _VSTD::equal(base::__make_iter(0), base::__make_iter(_Size), __rhs.__make_iter(0)); 1003 } 1004 1005 template <size_t _Size> 1006 inline 1007 bool 1008 bitset<_Size>::operator!=(const bitset& __rhs) const _NOEXCEPT 1009 { 1010 return !(*this == __rhs); 1011 } 1012 1013 template <size_t _Size> 1014 bool 1015 bitset<_Size>::test(size_t __pos) const 1016 { 1017 if (__pos >= _Size) 1018 __throw_out_of_range("bitset test argument out of range"); 1019 1020 return (*this)[__pos]; 1021 } 1022 1023 template <size_t _Size> 1024 inline 1025 bool 1026 bitset<_Size>::all() const _NOEXCEPT 1027 { 1028 return base::all(); 1029 } 1030 1031 template <size_t _Size> 1032 inline 1033 bool 1034 bitset<_Size>::any() const _NOEXCEPT 1035 { 1036 return base::any(); 1037 } 1038 1039 template <size_t _Size> 1040 inline 1041 bitset<_Size> 1042 bitset<_Size>::operator<<(size_t __pos) const _NOEXCEPT 1043 { 1044 bitset __r = *this; 1045 __r <<= __pos; 1046 return __r; 1047 } 1048 1049 template <size_t _Size> 1050 inline 1051 bitset<_Size> 1052 bitset<_Size>::operator>>(size_t __pos) const _NOEXCEPT 1053 { 1054 bitset __r = *this; 1055 __r >>= __pos; 1056 return __r; 1057 } 1058 1059 template <size_t _Size> 1060 inline _LIBCPP_INLINE_VISIBILITY 1061 bitset<_Size> 1062 operator&(const bitset<_Size>& __x, const bitset<_Size>& __y) _NOEXCEPT 1063 { 1064 bitset<_Size> __r = __x; 1065 __r &= __y; 1066 return __r; 1067 } 1068 1069 template <size_t _Size> 1070 inline _LIBCPP_INLINE_VISIBILITY 1071 bitset<_Size> 1072 operator|(const bitset<_Size>& __x, const bitset<_Size>& __y) _NOEXCEPT 1073 { 1074 bitset<_Size> __r = __x; 1075 __r |= __y; 1076 return __r; 1077 } 1078 1079 template <size_t _Size> 1080 inline _LIBCPP_INLINE_VISIBILITY 1081 bitset<_Size> 1082 operator^(const bitset<_Size>& __x, const bitset<_Size>& __y) _NOEXCEPT 1083 { 1084 bitset<_Size> __r = __x; 1085 __r ^= __y; 1086 return __r; 1087 } 1088 1089 template <size_t _Size> 1090 struct _LIBCPP_TEMPLATE_VIS hash<bitset<_Size> > 1091 : public unary_function<bitset<_Size>, size_t> 1092 { 1093 _LIBCPP_INLINE_VISIBILITY 1094 size_t operator()(const bitset<_Size>& __bs) const _NOEXCEPT 1095 {return __bs.__hash_code();} 1096 }; 1097 1098 template <class _CharT, class _Traits, size_t _Size> 1099 basic_istream<_CharT, _Traits>& 1100 operator>>(basic_istream<_CharT, _Traits>& __is, bitset<_Size>& __x); 1101 1102 template <class _CharT, class _Traits, size_t _Size> 1103 basic_ostream<_CharT, _Traits>& 1104 operator<<(basic_ostream<_CharT, _Traits>& __os, const bitset<_Size>& __x); 1105 1106 _LIBCPP_END_NAMESPACE_STD 1107 1108 _LIBCPP_POP_MACROS 1109 1110 #endif // _LIBCPP_BITSET 1111
