Difference between revisions of "cpp/numeric/countr one"
From cppreference.com
Andreas Krug (Talk | contribs) m ({{c}}, fmt) |
m (fmt) |
||
Line 6: | Line 6: | ||
}} | }} | ||
− | Returns the number of consecutive 1 bits in the value of {{c|x}}, starting from the least significant bit ("right"). | + | Returns the number of consecutive {{c|1}} bits in the value of {{c|x}}, starting from the least significant bit ("right"). |
− | {{cpp/enable_if|{{tt|T}} is an unsigned integer type (that is, {{c|unsigned char}}, {{c|unsigned short}}, {{c|unsigned int}}, {{c|unsigned long}}, {{c|unsigned long long}}, or an extended unsigned integer type)}}. | + | {{cpp/enable_if|{{tt|T}} is an unsigned integer type (that is, {{c/core|unsigned char}}, {{c/core|unsigned short}}, {{c/core|unsigned int}}, {{c/core|unsigned long}}, {{c/core|unsigned long long}}, or an extended unsigned integer type)}}. |
===Parameters=== | ===Parameters=== | ||
Line 16: | Line 16: | ||
===Return value=== | ===Return value=== | ||
− | The number of consecutive 1 bits in the value of {{c|x}}, starting from the least significant bit. | + | The number of consecutive {{c|1}} bits in the value of {{c|x}}, starting from the least significant bit. |
===Notes=== | ===Notes=== | ||
− | {{feature test macro|__cpp_lib_bitops|std=C++20|value=201907L|[[cpp/numeric# | + | {{feature test macro|__cpp_lib_bitops|std=C++20|value=201907L|[[cpp/numeric#Bit manipulation (since C++20)|Bit operations]]}} |
− | === Example === | + | ===Example=== |
{{example | {{example | ||
|code= | |code= | ||
Line 42: | Line 42: | ||
}} | }} | ||
− | === See also === | + | ===See also=== |
{{dsc begin}} | {{dsc begin}} | ||
{{dsc inc|cpp/numeric/dsc countl_zero}} | {{dsc inc|cpp/numeric/dsc countl_zero}} |
Latest revision as of 14:14, 2 November 2024
Defined in header <bit>
|
||
template< class T > constexpr int 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, unsigned char, unsigned short, unsigned int, unsigned long, unsigned long long, 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 macro | Value | Std | Feature |
---|---|---|---|
__cpp_lib_bitops |
201907L | (C++20) | Bit operations |
[edit] Example
Run this code
#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
(C++20) |
counts the number of consecutive 0 bits, starting from the most significant bit (function template) |
(C++20) |
counts the number of consecutive 1 bits, starting from the most significant bit (function template) |
(C++20) |
counts the number of consecutive 0 bits, starting from the least significant bit (function template) |
(C++20) |
counts the number of 1 bits in an unsigned integer (function template) |
(C++20) |
checks if a number is an integral power of 2 (function template) |
returns the number of bits set to true (public member function of std::bitset<N> )
| |
checks if all, any or none of the bits are set to true (public member function of std::bitset<N> )
|