std::bitset< _Nb > Class Template Reference
[Containers]
The bitset class represents a
fixed-size sequence of bits.
More...
Inherits std::_Base_bitset<(( _Nb ) < 1 ? 0 : (( _Nb ) + numeric_limits<unsigned long>::digits - 1) / numeric_limits<unsigned long>::digits )>.
List of all members.
Classes
Public Member Functions
- size_t _Find_first () const
- size_t _Find_next (size_t __prev) const
-
template<class _CharT , class _Traits , class _Alloc > void _M_copy_from_string (const std::basic_string< _CharT, _Traits, _Alloc > &__s, size_t, size_t)
-
template<class _CharT , class _Traits , class _Alloc > void _M_copy_to_string (std::basic_string< _CharT, _Traits, _Alloc > &) const
- bool any () const
- template<class _CharT , class _Traits , class _Alloc > bitset (const std::basic_string< _CharT, _Traits, _Alloc > &__s, size_t __position, size_t __n)
- template<class _CharT , class _Traits , class _Alloc > bitset (const std::basic_string< _CharT, _Traits, _Alloc > &__s, size_t __position=0)
- bitset (unsigned long __val)
- bitset ()
- size_t count () const
- bitset< _Nb > & flip (size_t __position)
- bitset< _Nb > & flip ()
- bool none () const
- bitset< _Nb > operator~ () const
- bitset< _Nb > & reset (size_t __position)
- bitset< _Nb > & reset ()
- bitset< _Nb > & set (size_t __position, bool __val=true)
- bitset< _Nb > & set ()
- size_t size () const
- bool test (size_t __position) const
-
std::basic_string< char,
std::char_traits< char >
, std::allocator< char > > to_string () const
-
template<class _CharT > std::basic_string< _CharT,
std::char_traits< _CharT >
, std::allocator< _CharT > > to_string () const
-
template<class _CharT , class _Traits > std::basic_string< _CharT,
_Traits, std::allocator
< _CharT > > to_string () const
- template<class _CharT , class _Traits , class _Alloc > std::basic_string< _CharT,
_Traits, _Alloc > to_string () const
- unsigned long to_ulong () const
|
|
-
template<> bitset< 0 > & flip (size_t)
-
template<> bitset< 0 > & reset (size_t)
-
template<> bitset< 0 > & set (size_t, bool)
-
template<> bool test (size_t) const
|
|
|
|
|
Private Types
-
typedef unsigned long _WordT
Private Member Functions
-
void _M_do_and (const _Base_bitset< _Nw > &__x)
-
size_t _M_do_count () const
-
size_t _M_do_find_first (size_t __not_found) const
-
size_t _M_do_find_next (size_t __prev, size_t __not_found) const
-
void _M_do_flip ()
-
void _M_do_left_shift (size_t __shift)
-
void _M_do_or (const _Base_bitset< _Nw > &__x)
-
void _M_do_reset ()
-
void _M_do_right_shift (size_t __shift)
-
void _M_do_set ()
-
unsigned long _M_do_to_ulong () const
-
void _M_do_xor (const _Base_bitset< _Nw > &__x)
-
_WordT _M_getword (size_t __pos) const
-
_WordT & _M_getword (size_t __pos)
-
_WordT _M_hiword () const
-
_WordT & _M_hiword ()
-
bool _M_is_any () const
-
bool _M_is_equal (const _Base_bitset< _Nw > &__x) const
Static Private Member Functions
-
static _WordT _S_maskbit (size_t __pos)
-
static size_t _S_whichbit (size_t __pos)
-
static size_t _S_whichbyte (size_t __pos)
-
static size_t _S_whichword (size_t __pos)
Private Attributes
Friends
Detailed Description
template<size_t _Nb>
class std::bitset< _Nb >
(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 http://gcc.gnu.org/onlinedocs/libstdc++/ext/sgiexts.html#ch23 for a description of extensions.
Definition at line 646 of file bitset.
Constructor & Destructor Documentation
All bits set to zero.
Definition at line 736 of file bitset.
Initial bits bitwise-copied from a single word (others set to zero).
Definition at line 740 of file bitset.
template<size_t _Nb>
template<class _CharT , class _Traits , class _Alloc >
Use a subset of a string.
- Parameters:
-
| s | A string of '0' and '1' characters. |
| position | Index of the first character in s to use; defaults to zero. |
- Exceptions:
-
Definition at line 755 of file bitset.
template<size_t _Nb>
template<class _CharT , class _Traits , class _Alloc >
Use a subset of a string.
- Parameters:
-
| s | A string of '0' and '1' characters. |
| position | Index of the first character in s to use. |
| n | The number of characters to copy. |
- Exceptions:
-
Definition at line 776 of file bitset.
Member Function Documentation
These versions of single-bit set, reset, flip, and test are extensions from the SGI version. They do no range checking.
Definition at line 881 of file bitset.
These versions of single-bit set, reset, flip, and test are extensions from the SGI version. They do no range checking.
Definition at line 874 of file bitset.
These versions of single-bit set, reset, flip, and test are extensions from the SGI version. They do no range checking.
Definition at line 864 of file bitset.
template<size_t _Nb>
bool std::bitset< _Nb >::_Unchecked_test |
( |
size_t |
__pos |
) |
const [inline] |
These versions of single-bit set, reset, flip, and test are extensions from the SGI version. They do no range checking.
Definition at line 888 of file bitset.
Tests whether any of the bits are on.
- Returns:
- True if at least one bit is set.
Definition at line 1100 of file bitset.
Returns the number of bits which are set.
Definition at line 1062 of file bitset.
Toggles a given bit to its opposite value.
- Parameters:
-
| position | The index of the bit. |
- Exceptions:
-
Definition at line 961 of file bitset.
Toggles every bit to its opposite value.
Definition at line 948 of file bitset.
Tests whether any of the bits are on.
- Returns:
- True if none of the bits are set.
Definition at line 1108 of file bitset.
These comparisons for equality/inequality are, well, bitwise.
Definition at line 1077 of file bitset.
Operations on bitsets.
- Parameters:
-
These should be self-explanatory.
Definition at line 795 of file bitset.
Self-explanatory.
Definition at line 1114 of file bitset.
Operations on bitsets.
- Parameters:
-
| position | The number of places to shift. |
These should be self-explanatory.
Definition at line 824 of file bitset.
These comparisons for equality/inequality are, well, bitwise.
Definition at line 1073 of file bitset.
Self-explanatory.
Definition at line 1118 of file bitset.
Operations on bitsets.
- Parameters:
-
| position | The number of places to shift. |
These should be self-explanatory.
Definition at line 837 of file bitset.
template<size_t _Nb>
bool std::bitset< _Nb >::operator[] |
( |
size_t |
__position |
) |
const [inline] |
Array-indexing support.
- Parameters:
-
| position | Index into the bitset. |
- Returns:
- A bool for a 'const bitset'. For non-const bitsets, an instance of the reference proxy class.
- Note:
- These operators do no range checking and throw no exceptions, as required by DR 11 to the standard.
Definition at line 995 of file bitset.
Array-indexing support.
- Parameters:
-
| position | Index into the bitset. |
- Returns:
- A bool for a 'const bitset'. For non-const bitsets, an instance of the reference proxy class.
- Note:
- These operators do no range checking and throw no exceptions, as required by DR 11 to the standard.
Definition at line 991 of file bitset.
Operations on bitsets.
- Parameters:
-
These should be self-explanatory.
Definition at line 809 of file bitset.
Operations on bitsets.
- Parameters:
-
These should be self-explanatory.
Definition at line 802 of file bitset.
Sets a given bit to false.
- Parameters:
-
| position | The index of the bit. |
- Exceptions:
-
Same as writing
set(pos,false)
.
Definition at line 937 of file bitset.
Sets every bit to false.
Definition at line 923 of file bitset.
Sets a given bit to a particular value.
- Parameters:
-
| position | The index of the bit. |
| val | Either true or false, defaults to true. |
- Exceptions:
-
Definition at line 912 of file bitset.
Sets every bit to true.
Definition at line 898 of file bitset.
Returns the total number of bits.
Definition at line 1067 of file bitset.
template<size_t _Nb>
bool std::bitset< _Nb >::test |
( |
size_t |
__position |
) |
const [inline] |
Tests the value of a bit.
- Parameters:
-
| position | The index of a bit. |
- Returns:
- The value at pos.
- Exceptions:
-
Definition at line 1088 of file bitset.
template<size_t _Nb>
template<class _CharT , class _Traits , class _Alloc >
Retuns a character interpretation of the bitset.
- Returns:
- The string equivalent of the bits.
Note the ordering of the bits: decreasing character positions correspond to increasing bit positions (see the main class notes for an example).
Definition at line 1019 of file bitset.
template<size_t _Nb>
unsigned long std::bitset< _Nb >::to_ulong |
( |
|
) |
const [inline] |
Retuns a numerical interpretation of the bitset.
- Returns:
- The integral equivalent of the bits.
- Exceptions:
-
Definition at line 1006 of file bitset.
The documentation for this class was generated from the following file: