|
| constexpr | bitset () noexcept |
| |
| template<typename _CharT, typename = _Require<is_trivially_copyable<_CharT>, is_standard_layout<_CharT>, is_trivially_default_constructible<_CharT>, __not_<is_array<_CharT>>>> |
| constexpr | bitset (const _CharT *__str, typename __bitset::__string< _CharT >::size_type __n=__bitset::__string< _CharT >::npos, _CharT __zero=_CharT('0'), _CharT __one=_CharT('1')) |
| |
| template<class _CharT, class _Traits, class _Alloc> |
| constexpr | bitset (const std::basic_string< _CharT, _Traits, _Alloc > &__s, size_t __position, size_t __n) |
| |
| template<class _CharT, class _Traits, class _Alloc> |
| constexpr | bitset (const std::basic_string< _CharT, _Traits, _Alloc > &__s, size_t __position, size_t __n, _CharT __zero, _CharT __one=_CharT('1')) |
| |
| template<class _CharT, class _Traits, class _Alloc> |
| constexpr | bitset (const std::basic_string< _CharT, _Traits, _Alloc > &__s, size_t __position=0) |
| |
| constexpr | bitset (unsigned long long __val) noexcept |
| |
| constexpr size_t | _Find_first () const noexcept |
| |
| constexpr size_t | _Find_next (size_t __prev) const noexcept |
| |
| constexpr bool | all () const noexcept |
| |
| constexpr bool | any () const noexcept |
| |
| constexpr size_t | count () const noexcept |
| |
| constexpr bitset< _Nb > & | flip () noexcept |
| |
| constexpr bitset< _Nb > & | flip (size_t __position) |
| |
| constexpr bool | none () const noexcept |
| |
| constexpr bitset< _Nb > | operator~ () const noexcept |
| |
| constexpr bitset< _Nb > & | reset () noexcept |
| |
| constexpr bitset< _Nb > & | reset (size_t __position) |
| |
| constexpr bitset< _Nb > & | set () noexcept |
| |
| constexpr bitset< _Nb > & | set (size_t __position, bool __val=true) |
| |
| constexpr size_t | size () const noexcept |
| |
| constexpr bool | test (size_t __position) const |
| |
| template<class _CharT, class _Traits, class _Alloc> |
| constexpr std::basic_string< _CharT, _Traits, _Alloc > | to_string () const |
| |
| template<class _CharT, class _Traits> |
| constexpr std::basic_string< _CharT, _Traits, std::allocator< _CharT > > | to_string () const |
| |
| template<class _CharT> |
| constexpr std::basic_string< _CharT, std::char_traits< _CharT >, std::allocator< _CharT > > | to_string () const |
| |
| constexpr std::basic_string< char, std::char_traits< char >, std::allocator< char > > | to_string () const |
| |
| template<class _CharT, class _Traits, class _Alloc> |
| constexpr std::basic_string< _CharT, _Traits, _Alloc > | to_string (_CharT __zero, _CharT __one=_CharT('1')) const |
| |
| template<class _CharT, class _Traits> |
| constexpr std::basic_string< _CharT, _Traits, std::allocator< _CharT > > | to_string (_CharT __zero, _CharT __one=_CharT('1')) const |
| |
| template<class _CharT> |
| constexpr std::basic_string< _CharT, std::char_traits< _CharT >, std::allocator< _CharT > > | to_string (_CharT __zero, _CharT __one=_CharT('1')) const |
| |
| constexpr std::basic_string< char, std::char_traits< char >, std::allocator< char > > | to_string (char __zero, char __one='1') const |
| |
| constexpr unsigned long long | to_ullong () const |
| |
| constexpr unsigned long | to_ulong () const |
| |
|
| constexpr bitset< _Nb > & | operator&= (const bitset< _Nb > &__rhs) noexcept |
| |
| constexpr bitset< _Nb > & | operator|= (const bitset< _Nb > &__rhs) noexcept |
| |
| constexpr bitset< _Nb > & | operator^= (const bitset< _Nb > &__rhs) noexcept |
| |
|
| constexpr bitset< _Nb > & | operator<<= (size_t __position) noexcept |
| |
| constexpr bitset< _Nb > & | operator>>= (size_t __position) noexcept |
| |
|
| constexpr bitset< _Nb > & | _Unchecked_set (size_t __pos) noexcept |
| |
| constexpr bitset< _Nb > & | _Unchecked_set (size_t __pos, int __val) noexcept |
| |
| constexpr bitset< _Nb > & | _Unchecked_reset (size_t __pos) noexcept |
| |
| constexpr bitset< _Nb > & | _Unchecked_flip (size_t __pos) noexcept |
| |
| constexpr bool | _Unchecked_test (size_t __pos) const noexcept |
| |
|
| constexpr reference | operator[] (size_t __position) |
| |
| constexpr bool | operator[] (size_t __position) const |
| |
|
| constexpr bool | operator== (const bitset< _Nb > &__rhs) const noexcept |
| |
|
| constexpr bitset< _Nb > | operator<< (size_t __position) const noexcept |
| |
| constexpr bitset< _Nb > | operator>> (size_t __position) const noexcept |
| |
template<size_t _Nb>
class std::bitset< _Nb >
The bitset class represents a fixed-size sequence of bits.
(Note that bitset does not meet the formal requirements of a container. Mainly, it lacks iterators.)
The template argument, Nb, may be any non-negative number, specifying the number of bits (e.g., "0", "12", "1024*1024").
In the general unoptimized case, storage is allocated in word-sized blocks. Let B be the number of bits in a word, then (Nb+(B-1))/B words will be used for storage. B - NbB bits are unused. (They are the high-order bits in the highest word.) It is a class invariant that those unused bits are always zero.
If you think of bitset as a simple array of bits, be aware that your mental picture is reversed: a bitset behaves the same way as bits in integers do, with the bit at index 0 in the least significant / right-hand position, and the bit at index Nb-1 in the most significant / left-hand position. Thus, unlike other containers, a bitset's index counts from right to left, to put it very loosely.
This behavior is preserved when translating to and from strings. For example, the first line of the following program probably prints b('a') is 0001100001 on a modern ASCII system.
#include <bitset>
#include <iostream>
#include <sstream>
using namespace std;
int main()
{
long a = 'a';
bitset<10> b(a);
cout << "b('a') is " << b << endl;
ostringstream s;
s << b;
string str = s.str();
cout << "index 3 in the string is " << str[3] << " but\n"
<< "index 3 in the bitset is " << b[3] << endl;
}
Also see: https://gcc.gnu.org/onlinedocs/libstdc++/manual/ext_containers.html for a description of extensions.
Most of the actual code isn't contained in bitset<> itself, but in the base class _Base_bitset. The base class works with whole words, not with individual bits. This allows us to specialize _Base_bitset for the important special case where the bitset is only a single word.
Extra confusion can result due to the fact that the storage for _Base_bitset is a regular array, and is indexed as such. This is carefully encapsulated.
Definition at line 820 of file bitset.
1.13.2