std::countl_zero - cppreference.com (original) (raw)
| Defined in header | | | | ---------------------------------------------------------------- | | ------------- | | template< class T > constexpr int countl_zero( T x ) noexcept; | | (since C++20) |
Returns the number of consecutive 0 bits in the value of x, starting from the most significant bit (“left”).
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).
[edit] Parameters
x | - | value of unsigned integer type |
---|
[edit] Return value
The number of consecutive 0 bits in the value of x, starting from the most significant bit.
[edit] Notes
Feature-test macro | Value | Std | Feature |
---|---|---|---|
__cpp_lib_bitops | 201907L | (C++20) | Bit operations |
[edit] Example
#include #include #include #include int main() { for (const std::uint8_t i : {0, 0b11111111, 0b11110000, 0b00011110}) std::cout << "countl_zero( " << std::bitset<8>(i) << " ) = " << std::countl_zero(i) << '\n'; }
Output:
countl_zero( 00000000 ) = 8 countl_zero( 11111111 ) = 0 countl_zero( 11110000 ) = 0 countl_zero( 00011110 ) = 3
[edit] See also
countl_one(C++20) | counts the number of consecutive 1 bits, starting from the most significant bit (function template) [edit] |
---|---|
countr_zero(C++20) | counts the number of consecutive 0 bits, starting from the least significant bit (function template) [edit] |
countr_one(C++20) | counts the number of consecutive 1 bits, starting from the least significant bit (function template) [edit] |
popcount(C++20) | counts the number of 1 bits in an unsigned integer (function template) [edit] |
allanynone | checks if all, any or none of the bits are set to true (public member function of std::bitset) [edit] |
C documentation for stdc_leading_zeros |