Namespaces
Variants
Actions

std::countr_one

From cppreference.com
< cpp‎ | numeric
 
 
 
 
Defined in header <bit>
template<class T >
constexprint countr_one( T x )noexcept;
(since C++20)

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, unsignedchar, unsignedshort, unsignedint, unsignedlong, unsignedlonglong, or an extended unsigned integer type).

Contents

[edit]Parameters

x - value of unsigned integer type

[edit]Return value

The number of consecutive 1 bits in the value of x, starting from the least significant bit.

[edit]Notes

Feature-test macroValueStdFeature
__cpp_lib_bitops201907L(C++20)Bit operations

[edit]Example

#include <bit>#include <bitset>#include <cstdint>#include <iostream>   int main(){for(conststd::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
(function template)[edit]
(C++20)
counts the number of consecutive 1 bits, starting from the most significant bit
(function template)[edit]
counts the number of consecutive 0 bits, starting from the least significant bit
(function template)[edit]
(C++20)
counts the number of 1 bits in an unsigned integer
(function template)[edit]
checks if a number is an integral power of 2
(function template)[edit]
returns the number of bits set to true
(public member function of std::bitset<N>)[edit]
checks if all, any or none of the bits are set to true
(public member function of std::bitset<N>)[edit]
close