Cider Isn't Darwin Emulation, Really
Something went wrong. Try again.
33 kB · 1097 lines
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098// -*- C++ -*-//===---------------------------- bitset ----------------------------------===////// The LLVM Compiler Infrastructure//// This file is dual licensed under the MIT and the University of Illinois Open// Source Licenses. See LICENSE.TXT for details.////===----------------------------------------------------------------------===//#ifndef _LIBCPP_BITSET#define _LIBCPP_BITSET/* bitset synopsisnamespace std{namespace std {template <size_t N>class bitset{public: // bit reference: class reference { friend class bitset; reference() noexcept; public: ~reference() noexcept; reference& operator=(bool x) noexcept; // for b[i] = x; reference& operator=(const reference&) noexcept; // for b[i] = b[j]; bool operator~() const noexcept; // flips the bit operator bool() const noexcept; // for x = b[i]; reference& flip() noexcept; // for b[i].flip(); }; // 23.3.5.1 constructors: constexpr bitset() noexcept; constexpr bitset(unsigned long long val) noexcept; template <class charT> explicit bitset(const charT* str, typename basic_string<charT>::size_type n = basic_string<charT>::npos, charT zero = charT('0'), charT one = charT('1')); template<class charT, class traits, class Allocator> explicit bitset(const basic_string<charT,traits,Allocator>& str, typename basic_string<charT,traits,Allocator>::size_type pos = 0, typename basic_string<charT,traits,Allocator>::size_type n = basic_string<charT,traits,Allocator>::npos, charT zero = charT('0'), charT one = charT('1')); // 23.3.5.2 bitset operations: bitset& operator&=(const bitset& rhs) noexcept; bitset& operator|=(const bitset& rhs) noexcept; bitset& operator^=(const bitset& rhs) noexcept; bitset& operator<<=(size_t pos) noexcept; bitset& operator>>=(size_t pos) noexcept; bitset& set() noexcept; bitset& set(size_t pos, bool val = true); bitset& reset() noexcept; bitset& reset(size_t pos); bitset operator~() const noexcept; bitset& flip() noexcept; bitset& flip(size_t pos); // element access: constexpr bool operator[](size_t pos) const; // for b[i]; reference operator[](size_t pos); // for b[i]; unsigned long to_ulong() const; unsigned long long to_ullong() const; template <class charT, class traits, class Allocator> basic_string<charT, traits, Allocator> to_string(charT zero = charT('0'), charT one = charT('1')) const; template <class charT, class traits> basic_string<charT, traits, allocator<charT> > to_string(charT zero = charT('0'), charT one = charT('1')) const; template <class charT> basic_string<charT, char_traits<charT>, allocator<charT> > to_string(charT zero = charT('0'), charT one = charT('1')) const; basic_string<char, char_traits<char>, allocator<char> > to_string(char zero = '0', char one = '1') const; size_t count() const noexcept; constexpr size_t size() const noexcept; bool operator==(const bitset& rhs) const noexcept; bool operator!=(const bitset& rhs) const noexcept; bool test(size_t pos) const; bool all() const noexcept; bool any() const noexcept; bool none() const noexcept; bitset operator<<(size_t pos) const noexcept; bitset operator>>(size_t pos) const noexcept;};// 23.3.5.3 bitset operators:template <size_t N>bitset<N> operator&(const bitset<N>&, const bitset<N>&) noexcept;template <size_t N>bitset<N> operator|(const bitset<N>&, const bitset<N>&) noexcept;template <size_t N>bitset<N> operator^(const bitset<N>&, const bitset<N>&) noexcept;template <class charT, class traits, size_t N>basic_istream<charT, traits>&operator>>(basic_istream<charT, traits>& is, bitset<N>& x);template <class charT, class traits, size_t N>basic_ostream<charT, traits>&operator<<(basic_ostream<charT, traits>& os, const bitset<N>& x);template <size_t N> struct hash<std::bitset<N>>;} // std*/#include <__config>#include <__bit_reference>#include <cstddef>#include <climits>#include <string>#include <stdexcept>#include <iosfwd>#include <__functional_base>#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)#pragma GCC system_header#endif_LIBCPP_PUSH_MACROS#include <__undef_macros>_LIBCPP_BEGIN_NAMESPACE_STDtemplate <size_t _N_words, size_t _Size>class __bitset;template <size_t _N_words, size_t _Size>struct __has_storage_type<__bitset<_N_words, _Size> >{ static const bool value = true;};template <size_t _N_words, size_t _Size>class __bitset{public: typedef ptrdiff_t difference_type; typedef size_t size_type; typedef size_type __storage_type;protected: typedef __bitset __self; typedef __storage_type* __storage_pointer; typedef const __storage_type* __const_storage_pointer; static const unsigned __bits_per_word = static_cast<unsigned>(sizeof(__storage_type) * CHAR_BIT); friend class __bit_reference<__bitset>; friend class __bit_const_reference<__bitset>; friend class __bit_iterator<__bitset, false>; friend class __bit_iterator<__bitset, true>; friend struct __bit_array<__bitset>; __storage_type __first_[_N_words]; typedef __bit_reference<__bitset> reference; typedef __bit_const_reference<__bitset> const_reference; typedef __bit_iterator<__bitset, false> iterator; typedef __bit_iterator<__bitset, true> const_iterator; _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR __bitset() _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY explicit _LIBCPP_CONSTEXPR __bitset(unsigned long long __v) _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY reference __make_ref(size_t __pos) _NOEXCEPT {return reference(__first_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word);} _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR const_reference __make_ref(size_t __pos) const _NOEXCEPT {return const_reference(__first_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word);} _LIBCPP_INLINE_VISIBILITY iterator __make_iter(size_t __pos) _NOEXCEPT {return iterator(__first_ + __pos / __bits_per_word, __pos % __bits_per_word);} _LIBCPP_INLINE_VISIBILITY const_iterator __make_iter(size_t __pos) const _NOEXCEPT {return const_iterator(__first_ + __pos / __bits_per_word, __pos % __bits_per_word);} _LIBCPP_INLINE_VISIBILITY void operator&=(const __bitset& __v) _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY void operator|=(const __bitset& __v) _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY void operator^=(const __bitset& __v) _NOEXCEPT; void flip() _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY unsigned long to_ulong() const {return to_ulong(integral_constant<bool, _Size < sizeof(unsigned long) * CHAR_BIT>());} _LIBCPP_INLINE_VISIBILITY unsigned long long to_ullong() const {return to_ullong(integral_constant<bool, _Size < sizeof(unsigned long long) * CHAR_BIT>());} bool all() const _NOEXCEPT; bool any() const _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY size_t __hash_code() const _NOEXCEPT;private:#ifdef _LIBCPP_CXX03_LANG void __init(unsigned long long __v, false_type) _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY void __init(unsigned long long __v, true_type) _NOEXCEPT;#endif // _LIBCPP_CXX03_LANG unsigned long to_ulong(false_type) const; _LIBCPP_INLINE_VISIBILITY unsigned long to_ulong(true_type) const; unsigned long long to_ullong(false_type) const; _LIBCPP_INLINE_VISIBILITY unsigned long long to_ullong(true_type) const; _LIBCPP_INLINE_VISIBILITY unsigned long long to_ullong(true_type, false_type) const; unsigned long long to_ullong(true_type, true_type) const;};template <size_t _N_words, size_t _Size>inline_LIBCPP_CONSTEXPR__bitset<_N_words, _Size>::__bitset() _NOEXCEPT#ifndef _LIBCPP_CXX03_LANG : __first_{0}#endif{#ifdef _LIBCPP_CXX03_LANG _VSTD::fill_n(__first_, _N_words, __storage_type(0));#endif}#ifdef _LIBCPP_CXX03_LANGtemplate <size_t _N_words, size_t _Size>void__bitset<_N_words, _Size>::__init(unsigned long long __v, false_type) _NOEXCEPT{ __storage_type __t[sizeof(unsigned long long) / sizeof(__storage_type)]; for (size_t __i = 0; __i < sizeof(__t)/sizeof(__t[0]); ++__i, __v >>= __bits_per_word) __t[__i] = static_cast<__storage_type>(__v); _VSTD::copy(__t, __t + sizeof(__t)/sizeof(__t[0]), __first_); _VSTD::fill(__first_ + sizeof(__t)/sizeof(__t[0]), __first_ + sizeof(__first_)/sizeof(__first_[0]), __storage_type(0));}template <size_t _N_words, size_t _Size>inline _LIBCPP_INLINE_VISIBILITYvoid__bitset<_N_words, _Size>::__init(unsigned long long __v, true_type) _NOEXCEPT{ __first_[0] = __v; _VSTD::fill(__first_ + 1, __first_ + sizeof(__first_)/sizeof(__first_[0]), __storage_type(0));}#endif // _LIBCPP_CXX03_LANGtemplate <size_t _N_words, size_t _Size>inline_LIBCPP_CONSTEXPR__bitset<_N_words, _Size>::__bitset(unsigned long long __v) _NOEXCEPT#ifndef _LIBCPP_CXX03_LANG#if __SIZEOF_SIZE_T__ == 8 : __first_{__v}#elif __SIZEOF_SIZE_T__ == 4 : __first_{static_cast<__storage_type>(__v), static_cast<__storage_type>(__v >> __bits_per_word)}#else#error This constructor has not been ported to this platform#endif#endif{#ifdef _LIBCPP_CXX03_LANG __init(__v, integral_constant<bool, sizeof(unsigned long long) == sizeof(__storage_type)>());#endif}template <size_t _N_words, size_t _Size>inlinevoid__bitset<_N_words, _Size>::operator&=(const __bitset& __v) _NOEXCEPT{ for (size_type __i = 0; __i < _N_words; ++__i) __first_[__i] &= __v.__first_[__i];}template <size_t _N_words, size_t _Size>inlinevoid__bitset<_N_words, _Size>::operator|=(const __bitset& __v) _NOEXCEPT{ for (size_type __i = 0; __i < _N_words; ++__i) __first_[__i] |= __v.__first_[__i];}template <size_t _N_words, size_t _Size>inlinevoid__bitset<_N_words, _Size>::operator^=(const __bitset& __v) _NOEXCEPT{ for (size_type __i = 0; __i < _N_words; ++__i) __first_[__i] ^= __v.__first_[__i];}template <size_t _N_words, size_t _Size>void__bitset<_N_words, _Size>::flip() _NOEXCEPT{ // do middle whole words size_type __n = _Size; __storage_pointer __p = __first_; for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word) *__p = ~*__p; // do last partial word if (__n > 0) { __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n); __storage_type __b = *__p & __m; *__p &= ~__m; *__p |= ~__b & __m; }}template <size_t _N_words, size_t _Size>unsigned long__bitset<_N_words, _Size>::to_ulong(false_type) const{ const_iterator __e = __make_iter(_Size); const_iterator __i = _VSTD::find(__make_iter(sizeof(unsigned long) * CHAR_BIT), __e, true); if (__i != __e) __throw_overflow_error("bitset to_ulong overflow error"); return __first_[0];}template <size_t _N_words, size_t _Size>inlineunsigned long__bitset<_N_words, _Size>::to_ulong(true_type) const{ return __first_[0];}template <size_t _N_words, size_t _Size>unsigned long long__bitset<_N_words, _Size>::to_ullong(false_type) const{ const_iterator __e = __make_iter(_Size); const_iterator __i = _VSTD::find(__make_iter(sizeof(unsigned long long) * CHAR_BIT), __e, true); if (__i != __e) __throw_overflow_error("bitset to_ullong overflow error"); return to_ullong(true_type());}template <size_t _N_words, size_t _Size>inlineunsigned long long__bitset<_N_words, _Size>::to_ullong(true_type) const{ return to_ullong(true_type(), integral_constant<bool, sizeof(__storage_type) < sizeof(unsigned long long)>());}template <size_t _N_words, size_t _Size>inlineunsigned long long__bitset<_N_words, _Size>::to_ullong(true_type, false_type) const{ return __first_[0];}template <size_t _N_words, size_t _Size>unsigned long long__bitset<_N_words, _Size>::to_ullong(true_type, true_type) const{ unsigned long long __r = __first_[0]; for (std::size_t __i = 1; __i < sizeof(unsigned long long) / sizeof(__storage_type); ++__i) __r |= static_cast<unsigned long long>(__first_[__i]) << (sizeof(__storage_type) * CHAR_BIT); return __r;}template <size_t _N_words, size_t _Size>bool__bitset<_N_words, _Size>::all() const _NOEXCEPT{ // do middle whole words size_type __n = _Size; __const_storage_pointer __p = __first_; for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word) if (~*__p) return false; // do last partial word if (__n > 0) { __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n); if (~*__p & __m) return false; } return true;}template <size_t _N_words, size_t _Size>bool__bitset<_N_words, _Size>::any() const _NOEXCEPT{ // do middle whole words size_type __n = _Size; __const_storage_pointer __p = __first_; for (; __n >= __bits_per_word; ++__p, __n -= __bits_per_word) if (*__p) return true; // do last partial word if (__n > 0) { __storage_type __m = ~__storage_type(0) >> (__bits_per_word - __n); if (*__p & __m) return true; } return false;}template <size_t _N_words, size_t _Size>inlinesize_t__bitset<_N_words, _Size>::__hash_code() const _NOEXCEPT{ size_t __h = 0; for (size_type __i = 0; __i < _N_words; ++__i) __h ^= __first_[__i]; return __h;}template <size_t _Size>class __bitset<1, _Size>{public: typedef ptrdiff_t difference_type; typedef size_t size_type; typedef size_type __storage_type;protected: typedef __bitset __self; typedef __storage_type* __storage_pointer; typedef const __storage_type* __const_storage_pointer; static const unsigned __bits_per_word = static_cast<unsigned>(sizeof(__storage_type) * CHAR_BIT); friend class __bit_reference<__bitset>; friend class __bit_const_reference<__bitset>; friend class __bit_iterator<__bitset, false>; friend class __bit_iterator<__bitset, true>; friend struct __bit_array<__bitset>; __storage_type __first_; typedef __bit_reference<__bitset> reference; typedef __bit_const_reference<__bitset> const_reference; typedef __bit_iterator<__bitset, false> iterator; typedef __bit_iterator<__bitset, true> const_iterator; _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR __bitset() _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY explicit _LIBCPP_CONSTEXPR __bitset(unsigned long long __v) _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY reference __make_ref(size_t __pos) _NOEXCEPT {return reference(&__first_, __storage_type(1) << __pos);} _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR const_reference __make_ref(size_t __pos) const _NOEXCEPT {return const_reference(&__first_, __storage_type(1) << __pos);} _LIBCPP_INLINE_VISIBILITY iterator __make_iter(size_t __pos) _NOEXCEPT {return iterator(&__first_ + __pos / __bits_per_word, __pos % __bits_per_word);} _LIBCPP_INLINE_VISIBILITY const_iterator __make_iter(size_t __pos) const _NOEXCEPT {return const_iterator(&__first_ + __pos / __bits_per_word, __pos % __bits_per_word);} _LIBCPP_INLINE_VISIBILITY void operator&=(const __bitset& __v) _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY void operator|=(const __bitset& __v) _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY void operator^=(const __bitset& __v) _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY void flip() _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY unsigned long to_ulong() const; _LIBCPP_INLINE_VISIBILITY unsigned long long to_ullong() const; _LIBCPP_INLINE_VISIBILITY bool all() const _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY bool any() const _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY size_t __hash_code() const _NOEXCEPT;};template <size_t _Size>inline_LIBCPP_CONSTEXPR__bitset<1, _Size>::__bitset() _NOEXCEPT : __first_(0){}template <size_t _Size>inline_LIBCPP_CONSTEXPR__bitset<1, _Size>::__bitset(unsigned long long __v) _NOEXCEPT : __first_(static_cast<__storage_type>(__v)){}template <size_t _Size>inlinevoid__bitset<1, _Size>::operator&=(const __bitset& __v) _NOEXCEPT{ __first_ &= __v.__first_;}template <size_t _Size>inlinevoid__bitset<1, _Size>::operator|=(const __bitset& __v) _NOEXCEPT{ __first_ |= __v.__first_;}template <size_t _Size>inlinevoid__bitset<1, _Size>::operator^=(const __bitset& __v) _NOEXCEPT{ __first_ ^= __v.__first_;}template <size_t _Size>inlinevoid__bitset<1, _Size>::flip() _NOEXCEPT{ __storage_type __m = ~__storage_type(0) >> (__bits_per_word - _Size); __first_ = ~__first_; __first_ &= __m;}template <size_t _Size>inlineunsigned long__bitset<1, _Size>::to_ulong() const{ return __first_;}template <size_t _Size>inlineunsigned long long__bitset<1, _Size>::to_ullong() const{ return __first_;}template <size_t _Size>inlinebool__bitset<1, _Size>::all() const _NOEXCEPT{ __storage_type __m = ~__storage_type(0) >> (__bits_per_word - _Size); return !(~__first_ & __m);}template <size_t _Size>inlinebool__bitset<1, _Size>::any() const _NOEXCEPT{ __storage_type __m = ~__storage_type(0) >> (__bits_per_word - _Size); return __first_ & __m;}template <size_t _Size>inlinesize_t__bitset<1, _Size>::__hash_code() const _NOEXCEPT{ return __first_;}template <>class __bitset<0, 0>{public: typedef ptrdiff_t difference_type; typedef size_t size_type; typedef size_type __storage_type;protected: typedef __bitset __self; typedef __storage_type* __storage_pointer; typedef const __storage_type* __const_storage_pointer; static const unsigned __bits_per_word = static_cast<unsigned>(sizeof(__storage_type) * CHAR_BIT); friend class __bit_reference<__bitset>; friend class __bit_const_reference<__bitset>; friend class __bit_iterator<__bitset, false>; friend class __bit_iterator<__bitset, true>; friend struct __bit_array<__bitset>; typedef __bit_reference<__bitset> reference; typedef __bit_const_reference<__bitset> const_reference; typedef __bit_iterator<__bitset, false> iterator; typedef __bit_iterator<__bitset, true> const_iterator; _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR __bitset() _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY explicit _LIBCPP_CONSTEXPR __bitset(unsigned long long) _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY reference __make_ref(size_t) _NOEXCEPT {return reference(0, 1);} _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR const_reference __make_ref(size_t) const _NOEXCEPT {return const_reference(0, 1);} _LIBCPP_INLINE_VISIBILITY iterator __make_iter(size_t) _NOEXCEPT {return iterator(0, 0);} _LIBCPP_INLINE_VISIBILITY const_iterator __make_iter(size_t) const _NOEXCEPT {return const_iterator(0, 0);} _LIBCPP_INLINE_VISIBILITY void operator&=(const __bitset&) _NOEXCEPT {} _LIBCPP_INLINE_VISIBILITY void operator|=(const __bitset&) _NOEXCEPT {} _LIBCPP_INLINE_VISIBILITY void operator^=(const __bitset&) _NOEXCEPT {} _LIBCPP_INLINE_VISIBILITY void flip() _NOEXCEPT {} _LIBCPP_INLINE_VISIBILITY unsigned long to_ulong() const {return 0;} _LIBCPP_INLINE_VISIBILITY unsigned long long to_ullong() const {return 0;} _LIBCPP_INLINE_VISIBILITY bool all() const _NOEXCEPT {return true;} _LIBCPP_INLINE_VISIBILITY bool any() const _NOEXCEPT {return false;} _LIBCPP_INLINE_VISIBILITY size_t __hash_code() const _NOEXCEPT {return 0;}};inline_LIBCPP_CONSTEXPR__bitset<0, 0>::__bitset() _NOEXCEPT{}inline_LIBCPP_CONSTEXPR__bitset<0, 0>::__bitset(unsigned long long) _NOEXCEPT{}template <size_t _Size> class _LIBCPP_TEMPLATE_VIS bitset;template <size_t _Size> struct hash<bitset<_Size> >;template <size_t _Size>class _LIBCPP_TEMPLATE_VIS bitset : private __bitset<_Size == 0 ? 0 : (_Size - 1) / (sizeof(size_t) * CHAR_BIT) + 1, _Size>{public: static const unsigned __n_words = _Size == 0 ? 0 : (_Size - 1) / (sizeof(size_t) * CHAR_BIT) + 1; typedef __bitset<__n_words, _Size> base;public: typedef typename base::reference reference; typedef typename base::const_reference const_reference; // 23.3.5.1 constructors: _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR bitset() _NOEXCEPT {} _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR bitset(unsigned long long __v) _NOEXCEPT : base(__v) {} template<class _CharT> explicit bitset(const _CharT* __str, typename basic_string<_CharT>::size_type __n = basic_string<_CharT>::npos, _CharT __zero = _CharT('0'), _CharT __one = _CharT('1')); template<class _CharT, class _Traits, class _Allocator> explicit bitset(const basic_string<_CharT,_Traits,_Allocator>& __str, typename basic_string<_CharT,_Traits,_Allocator>::size_type __pos = 0, typename basic_string<_CharT,_Traits,_Allocator>::size_type __n = (basic_string<_CharT,_Traits,_Allocator>::npos), _CharT __zero = _CharT('0'), _CharT __one = _CharT('1')); // 23.3.5.2 bitset operations: _LIBCPP_INLINE_VISIBILITY bitset& operator&=(const bitset& __rhs) _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY bitset& operator|=(const bitset& __rhs) _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY bitset& operator^=(const bitset& __rhs) _NOEXCEPT; bitset& operator<<=(size_t __pos) _NOEXCEPT; bitset& operator>>=(size_t __pos) _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY bitset& set() _NOEXCEPT; bitset& set(size_t __pos, bool __val = true); _LIBCPP_INLINE_VISIBILITY bitset& reset() _NOEXCEPT; bitset& reset(size_t __pos); _LIBCPP_INLINE_VISIBILITY bitset operator~() const _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY bitset& flip() _NOEXCEPT; bitset& flip(size_t __pos); // element access: _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR const_reference operator[](size_t __p) const {return base::__make_ref(__p);} _LIBCPP_INLINE_VISIBILITY reference operator[](size_t __p) {return base::__make_ref(__p);} _LIBCPP_INLINE_VISIBILITY unsigned long to_ulong() const; _LIBCPP_INLINE_VISIBILITY unsigned long long to_ullong() const; template <class _CharT, class _Traits, class _Allocator> basic_string<_CharT, _Traits, _Allocator> to_string(_CharT __zero = _CharT('0'), _CharT __one = _CharT('1')) const; template <class _CharT, class _Traits> _LIBCPP_INLINE_VISIBILITY basic_string<_CharT, _Traits, allocator<_CharT> > to_string(_CharT __zero = _CharT('0'), _CharT __one = _CharT('1')) const; template <class _CharT> _LIBCPP_INLINE_VISIBILITY basic_string<_CharT, char_traits<_CharT>, allocator<_CharT> > to_string(_CharT __zero = _CharT('0'), _CharT __one = _CharT('1')) const; _LIBCPP_INLINE_VISIBILITY basic_string<char, char_traits<char>, allocator<char> > to_string(char __zero = '0', char __one = '1') const; _LIBCPP_INLINE_VISIBILITY size_t count() const _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY _LIBCPP_CONSTEXPR size_t size() const _NOEXCEPT {return _Size;} _LIBCPP_INLINE_VISIBILITY bool operator==(const bitset& __rhs) const _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY bool operator!=(const bitset& __rhs) const _NOEXCEPT; bool test(size_t __pos) const; _LIBCPP_INLINE_VISIBILITY bool all() const _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY bool any() const _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY bool none() const _NOEXCEPT {return !any();} _LIBCPP_INLINE_VISIBILITY bitset operator<<(size_t __pos) const _NOEXCEPT; _LIBCPP_INLINE_VISIBILITY bitset operator>>(size_t __pos) const _NOEXCEPT;private: _LIBCPP_INLINE_VISIBILITY size_t __hash_code() const _NOEXCEPT {return base::__hash_code();} friend struct hash<bitset>;};template <size_t _Size>template<class _CharT>bitset<_Size>::bitset(const _CharT* __str, typename basic_string<_CharT>::size_type __n, _CharT __zero, _CharT __one){ size_t __rlen = _VSTD::min(__n, char_traits<_CharT>::length(__str)); for (size_t __i = 0; __i < __rlen; ++__i) if (__str[__i] != __zero && __str[__i] != __one) __throw_invalid_argument("bitset string ctor has invalid argument"); size_t _Mp = _VSTD::min(__rlen, _Size); size_t __i = 0; for (; __i < _Mp; ++__i) { _CharT __c = __str[_Mp - 1 - __i]; if (__c == __zero) (*this)[__i] = false; else (*this)[__i] = true; } _VSTD::fill(base::__make_iter(__i), base::__make_iter(_Size), false);}template <size_t _Size>template<class _CharT, class _Traits, class _Allocator>bitset<_Size>::bitset(const basic_string<_CharT,_Traits,_Allocator>& __str, typename basic_string<_CharT,_Traits,_Allocator>::size_type __pos, typename basic_string<_CharT,_Traits,_Allocator>::size_type __n, _CharT __zero, _CharT __one){ if (__pos > __str.size()) __throw_out_of_range("bitset string pos out of range"); size_t __rlen = _VSTD::min(__n, __str.size() - __pos); for (size_t __i = __pos; __i < __pos + __rlen; ++__i) if (!_Traits::eq(__str[__i], __zero) && !_Traits::eq(__str[__i], __one)) __throw_invalid_argument("bitset string ctor has invalid argument"); size_t _Mp = _VSTD::min(__rlen, _Size); size_t __i = 0; for (; __i < _Mp; ++__i) { _CharT __c = __str[__pos + _Mp - 1 - __i]; if (_Traits::eq(__c, __zero)) (*this)[__i] = false; else (*this)[__i] = true; } _VSTD::fill(base::__make_iter(__i), base::__make_iter(_Size), false);}template <size_t _Size>inlinebitset<_Size>&bitset<_Size>::operator&=(const bitset& __rhs) _NOEXCEPT{ base::operator&=(__rhs); return *this;}template <size_t _Size>inlinebitset<_Size>&bitset<_Size>::operator|=(const bitset& __rhs) _NOEXCEPT{ base::operator|=(__rhs); return *this;}template <size_t _Size>inlinebitset<_Size>&bitset<_Size>::operator^=(const bitset& __rhs) _NOEXCEPT{ base::operator^=(__rhs); return *this;}template <size_t _Size>bitset<_Size>&bitset<_Size>::operator<<=(size_t __pos) _NOEXCEPT{ __pos = _VSTD::min(__pos, _Size); _VSTD::copy_backward(base::__make_iter(0), base::__make_iter(_Size - __pos), base::__make_iter(_Size)); _VSTD::fill_n(base::__make_iter(0), __pos, false); return *this;}template <size_t _Size>bitset<_Size>&bitset<_Size>::operator>>=(size_t __pos) _NOEXCEPT{ __pos = _VSTD::min(__pos, _Size); _VSTD::copy(base::__make_iter(__pos), base::__make_iter(_Size), base::__make_iter(0)); _VSTD::fill_n(base::__make_iter(_Size - __pos), __pos, false); return *this;}template <size_t _Size>inlinebitset<_Size>&bitset<_Size>::set() _NOEXCEPT{ _VSTD::fill_n(base::__make_iter(0), _Size, true); return *this;}template <size_t _Size>bitset<_Size>&bitset<_Size>::set(size_t __pos, bool __val){ if (__pos >= _Size) __throw_out_of_range("bitset set argument out of range"); (*this)[__pos] = __val; return *this;}template <size_t _Size>inlinebitset<_Size>&bitset<_Size>::reset() _NOEXCEPT{ _VSTD::fill_n(base::__make_iter(0), _Size, false); return *this;}template <size_t _Size>bitset<_Size>&bitset<_Size>::reset(size_t __pos){ if (__pos >= _Size) __throw_out_of_range("bitset reset argument out of range"); (*this)[__pos] = false; return *this;}template <size_t _Size>inlinebitset<_Size>bitset<_Size>::operator~() const _NOEXCEPT{ bitset __x(*this); __x.flip(); return __x;}template <size_t _Size>inlinebitset<_Size>&bitset<_Size>::flip() _NOEXCEPT{ base::flip(); return *this;}template <size_t _Size>bitset<_Size>&bitset<_Size>::flip(size_t __pos){ if (__pos >= _Size) __throw_out_of_range("bitset flip argument out of range"); reference r = base::__make_ref(__pos); r = ~r; return *this;}template <size_t _Size>inlineunsigned longbitset<_Size>::to_ulong() const{ return base::to_ulong();}template <size_t _Size>inlineunsigned long longbitset<_Size>::to_ullong() const{ return base::to_ullong();}template <size_t _Size>template <class _CharT, class _Traits, class _Allocator>basic_string<_CharT, _Traits, _Allocator>bitset<_Size>::to_string(_CharT __zero, _CharT __one) const{ basic_string<_CharT, _Traits, _Allocator> __r(_Size, __zero); for (size_t __i = 0; __i < _Size; ++__i) { if ((*this)[__i]) __r[_Size - 1 - __i] = __one; } return __r;}template <size_t _Size>template <class _CharT, class _Traits>inlinebasic_string<_CharT, _Traits, allocator<_CharT> >bitset<_Size>::to_string(_CharT __zero, _CharT __one) const{ return to_string<_CharT, _Traits, allocator<_CharT> >(__zero, __one);}template <size_t _Size>template <class _CharT>inlinebasic_string<_CharT, char_traits<_CharT>, allocator<_CharT> >bitset<_Size>::to_string(_CharT __zero, _CharT __one) const{ return to_string<_CharT, char_traits<_CharT>, allocator<_CharT> >(__zero, __one);}template <size_t _Size>inlinebasic_string<char, char_traits<char>, allocator<char> >bitset<_Size>::to_string(char __zero, char __one) const{ return to_string<char, char_traits<char>, allocator<char> >(__zero, __one);}template <size_t _Size>inlinesize_tbitset<_Size>::count() const _NOEXCEPT{ return static_cast<size_t>(_VSTD::count(base::__make_iter(0), base::__make_iter(_Size), true));}template <size_t _Size>inlineboolbitset<_Size>::operator==(const bitset& __rhs) const _NOEXCEPT{ return _VSTD::equal(base::__make_iter(0), base::__make_iter(_Size), __rhs.__make_iter(0));}template <size_t _Size>inlineboolbitset<_Size>::operator!=(const bitset& __rhs) const _NOEXCEPT{ return !(*this == __rhs);}template <size_t _Size>boolbitset<_Size>::test(size_t __pos) const{ if (__pos >= _Size) __throw_out_of_range("bitset test argument out of range"); return (*this)[__pos];}template <size_t _Size>inlineboolbitset<_Size>::all() const _NOEXCEPT{ return base::all();}template <size_t _Size>inlineboolbitset<_Size>::any() const _NOEXCEPT{ return base::any();}template <size_t _Size>inlinebitset<_Size>bitset<_Size>::operator<<(size_t __pos) const _NOEXCEPT{ bitset __r = *this; __r <<= __pos; return __r;}template <size_t _Size>inlinebitset<_Size>bitset<_Size>::operator>>(size_t __pos) const _NOEXCEPT{ bitset __r = *this; __r >>= __pos; return __r;}template <size_t _Size>inline _LIBCPP_INLINE_VISIBILITYbitset<_Size>operator&(const bitset<_Size>& __x, const bitset<_Size>& __y) _NOEXCEPT{ bitset<_Size> __r = __x; __r &= __y; return __r;}template <size_t _Size>inline _LIBCPP_INLINE_VISIBILITYbitset<_Size>operator|(const bitset<_Size>& __x, const bitset<_Size>& __y) _NOEXCEPT{ bitset<_Size> __r = __x; __r |= __y; return __r;}template <size_t _Size>inline _LIBCPP_INLINE_VISIBILITYbitset<_Size>operator^(const bitset<_Size>& __x, const bitset<_Size>& __y) _NOEXCEPT{ bitset<_Size> __r = __x; __r ^= __y; return __r;}template <size_t _Size>struct _LIBCPP_TEMPLATE_VIS hash<bitset<_Size> > : public unary_function<bitset<_Size>, size_t>{ _LIBCPP_INLINE_VISIBILITY size_t operator()(const bitset<_Size>& __bs) const _NOEXCEPT {return __bs.__hash_code();}};template <class _CharT, class _Traits, size_t _Size>basic_istream<_CharT, _Traits>&operator>>(basic_istream<_CharT, _Traits>& __is, bitset<_Size>& __x);template <class _CharT, class _Traits, size_t _Size>basic_ostream<_CharT, _Traits>&operator<<(basic_ostream<_CharT, _Traits>& __os, const bitset<_Size>& __x);_LIBCPP_END_NAMESPACE_STD_LIBCPP_POP_MACROS#endif // _LIBCPP_BITSET