|
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Member types | ||||
| Member functions | ||||
(until C++20) | ||||
| Element access | ||||
| Capacity | ||||
| Modifiers | ||||
bitset::operator<<=bitset::operator>>=bitset::operator<<bitset::operator>> | ||||
| Conversions | ||||
(C++11) | ||||
| Non-member functions | ||||
| Helper classes | ||||
(C++11) | ||||
bitset operator<<(std::size_t pos)const; | (1) | (noexcept since C++11) (constexpr since C++23) |
bitset& operator<<=(std::size_t pos); | (2) | (noexcept since C++11) (constexpr since C++23) |
bitset operator>>(std::size_t pos)const; | (3) | (noexcept since C++11) (constexpr since C++23) |
bitset& operator>>=(std::size_t pos); | (4) | (noexcept since C++11) (constexpr since C++23) |
Performs binary shift left (towards higher index positions) and binary shift right (towards lower index positions). Zeroes are shifted in, and bits that would go to an index out of range are dropped (ignored).
Contents |
| pos | - | number of positions to shift the bits |
#include <bitset>#include <iostream> int main(){std::bitset<8> b{0b01110010};std::cout<< b<<" (initial value)\n"; for(; b.any(); b>>=1){while(!b.test(0)) b>>=1;std::cout<< b<<'\n';} std::cout<< b<<" (final value)\n";}
Output:
01110010 (initial value)0011100100000111000000110000000100000000 (final value)
(C++20) | computes the result of bitwise left-rotation (function template)[edit] |
(C++20) | computes the result of bitwise right-rotation (function template)[edit] |
| performs binary AND, OR, XOR and NOT (public member function)[edit] |
