template< class T >
constexpr int countr_one( T x ) noexcept;
Returns the number of consecutive 1 bits in the value of x, starting from the least significant bit (ârightâ).
This overload participates in overload resolution only if T is an unsigned integer type (that is, unsigned char, unsigned short, unsigned int, unsigned long, unsigned long long, or an extended unsigned integer type).
The number of consecutive 1 bits in the value of x, starting from the least significant bit.
[edit] Notes [edit] Example#include <bit>
#include <bitset>
#include <cstdint>
#include <iostream>
int main()
{
for (const std::uint8_t i : {0, 0b11111111, 0b11111110, 0b11100011})
std::cout << "countr_one( " << std::bitset<8>(i) << " ) = "
<< std::countr_one(i) << '\n';
}
Output:
countr_one( 00000000 ) = 0 countr_one( 11111111 ) = 8 countr_one( 11111110 ) = 0 countr_one( 11100011 ) = 2[edit] See also counts the number of consecutive â0â bits, starting from the most significant bit
std::bitset<N>) [edit] checks if all, any or none of the bits are set to true
std::bitset<N>) [edit]
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4