|
bitset
bitset . .
template <size_t N> class bitset;
N ( ) . .
bitset();
bitset(unsigned long bits);
explicit bitset(const string &s, size_t i = 0, size_t num = npos);
(), , bits. s, i. . num s.size()-i ( ). npos - , s.
bitset << >>.
bitset -.
| - |
|
| bool any() const; |
, (.. 1) ; |
| size_type count() const; |
|
| bitset<N> &flip(); |
() *this |
| bitset<N> &flip(size_ti); |
i *this |
| bool none() const; |
, |
| bool operator !=(const bitset<N> &op2) const; |
, , 2 |
| bool operator == (const bitset<N> &op2) const; |
, , 2 |
| bitset<N> &operator &= (const bitset<N> &op2); |
(AND) 2 ; *this |
| bitset<N> &operator ^= (const bitset<N> &op2); |
(XOR) 2 ; * this |
| bitset<N> &operator |= (const bitset<N> &op2); |
(OR) 2 ; *this |
| bitset<N> &operator ~=( ) const; |
() |
| bitset<N> &operator <<= (size_t num); |
num , ; *this |
| bitset<N> &operator >>= (size_t num); |
num , ; *this |
| reference operator[](size_type i); |
i |
| bitset<N> &reset(); |
*this |
| bitset<N> &reset(size_t i); |
i * this |
| bitset<N> &set(); |
* this |
| bitset<N> &set(size_t int val = 1); |
i , val, *this. val 1 |
| size_t size() const; |
, |
| bool test(size_t i); |
i |
| string to_string() const; |
, |
| unsigned long to_ulong() const; |
|
|