|
| |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
(C++20) | ||||
(C++23) | ||||
| Integral powers of2 | ||||
(C++20) | ||||
(C++20) | ||||
(C++20) | ||||
(C++20) | ||||
| Rotating | ||||
(C++20) | ||||
rotr (C++20) | ||||
| Counting | ||||
(C++20) | ||||
(C++20) | ||||
(C++20) | ||||
(C++20) | ||||
(C++20) | ||||
| Endian | ||||
(C++20) |
Defined in header <bit> | ||
template<class T> constexpr T rotr( T x,int s)noexcept; | (since C++20) | |
Computes the result of bitwise right-rotating the value ofx bys positions. This operation is also known as a rightcircular shift.
Formally, letN bestd::numeric_limits<T>::digits andr bes% N.
This overload participates in overload resolution only ifT is an unsigned integer type (that is,unsignedchar,unsignedshort,unsignedint,unsignedlong,unsignedlonglong, or an extended unsigned integer type).
Contents |
| x | - | value of unsigned integer type |
| s | - | number of positions to shift |
The result of bitwise right-rotatingx bys positions.
| Feature-test macro | Value | Std | Feature |
|---|---|---|---|
__cpp_lib_bitops | 201907L | (C++20) | Bit operations |
#include <bit>#include <bitset>#include <cstdint>#include <iostream> int main(){using bin=std::bitset<8>;conststd::uint8_t x{0b00011101};std::cout<< bin(x)<<" <- x\n";for(constint s:{0,1,9,-1,2})std::cout<< bin(std::rotr(x, s))<<" <- rotr(x, "<< s<<")\n";}
Output:
00011101 <- x00011101 <- rotr(x, 0)10001110 <- rotr(x, 1)10001110 <- rotr(x, 9)00111010 <- rotr(x, -1)01000111 <- rotr(x, 2)
(C++20) | computes the result of bitwise left-rotation (function template)[edit] |
| performs binary shift left and shift right (public member function of std::bitset<N>)[edit] |
