Public Member Functions | |
| bitset () | |
| All bits set to zero. | |
| bitset (unsigned long __val) | |
| Initial bits bitwise-copied from a single word (others set to zero). | |
| template<class CharT, class Traits, class Alloc> | |
| bitset (const basic_string< CharT, Traits, Alloc > &s, size_t position=0) | |
| Use a subset of a string. | |
| template<class CharT, class Traits, class Alloc> | |
| bitset (const basic_string< CharT, Traits, Alloc > &s, size_t position, size_t n) | |
| Use a subset of a string. | |
| bitset< Nb > & | operator &= (const bitset< Nb > &__rhs) |
| Operations on bitsets. | |
| bitset< Nb > & | operator<<= (size_t position) |
| Operations on bitsets. | |
| bitset< Nb > & | Unchecked_set (size_t position) |
| bitset< Nb > & | set () |
| Sets every bit to true. | |
| bitset< Nb > & | set (size_t position, bool __val=true) |
| Sets a given bit to a particular value. | |
| bitset< Nb > & | reset () |
| Sets every bit to false. | |
| bitset< Nb > & | reset (size_t position) |
| Sets a given bit to false. | |
| bitset< Nb > & | flip () |
| Toggles every bit to its opposite value. | |
| bitset< Nb > & | flip (size_t position) |
| Toggles a given bit to its opposite value. | |
| bitset< Nb > | operator~ () const |
| See the no-argument flip(). | |
| reference | operator[] (size_t position) |
| Array-indexing support. | |
| unsigned long | to_ulong () const |
| Retuns a numerical interpretation of the bitset. | |
| template<class CharT, class Traits, class Alloc> | |
| basic_string< CharT, Traits, Alloc > | to_string () const |
| Retuns a character interpretation of the bitset. | |
| size_t | count () const |
| Returns the number of bits which are set. | |
| size_t | size () const |
| Returns the total number of bits. | |
| bool | operator== (const bitset< Nb > &__rhs) const |
| These comparisons for equality/inequality are, well, bitwise. | |
| bool | test (size_t position) const |
| Tests the value of a bit. | |
| bool | any () const |
| Tests whether any of the bits are on. | |
| bool | none () const |
| Tests whether any of the bits are on. | |
| bitset< Nb > | operator<< (size_t position) const |
| Self-explanatory. | |
| size_t | Find_first () const |
| Finds the index of the first "on" bit. | |
| size_t | Find_next (size_t __prev) const |
| Finds the index of the next "on" bit after prev. | |
Classes | |
| class | reference |
(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 603 of file bitset.
|
|||||||||
|
All bits set to zero.
|
|
||||||||||
|
Initial bits bitwise-copied from a single word (others set to zero).
|
|
||||||||||||||||||||
|
Use a subset of a string.
Definition at line 707 of file bitset. References std::basic_string< CharT, Traits, Alloc >::size(). |
|
||||||||||||||||||||||||
|
Use a subset of a string.
Definition at line 727 of file bitset. References std::basic_string< CharT, Traits, Alloc >::size(). |
|
|||||||||
|
Tests whether any of the bits are on.
|
|
|||||||||
|
Returns the number of bits which are set.
|
|
||||||||||
|
Toggles a given bit to its opposite value.
|
|
|||||||||
|
Toggles every bit to its opposite value.
|
|
|||||||||
|
Tests whether any of the bits are on.
|
|
||||||||||
|
Operations on bitsets.
|
|
||||||||||
|
Self-explanatory.
|
|
||||||||||
|
Operations on bitsets.
|
|
||||||||||
|
These comparisons for equality/inequality are, well, bitwise.
|
|
||||||||||
|
Array-indexing support.
|
|
|||||||||
|
See the no-argument flip().
|
|
||||||||||
|
Sets a given bit to false.
set(pos,false).
|
|
|||||||||
|
Sets every bit to false.
|
|
||||||||||||||||
|
Sets a given bit to a particular value.
|
|
|||||||||
|
Sets every bit to true.
|
|
|||||||||
|
Returns the total number of bits.
|
|
||||||||||
|
Tests the value of a bit.
|
|
|||||||||||||
|
Retuns a character interpretation of the bitset.
Also note that you must specify the string's template parameters explicitly. Given a bitset s = bs.to_string<char,char_traits<char>,allocator<char> >(); |
|
|||||||||
|
Retuns a numerical interpretation of the bitset.
|
1.4.2