| Defined in header <bit>
|
||
| template< class T > constexpr T bit_ceil( T x ); |
(since C++20) | |
Calculates the smallest integral power of two that is not smaller than x.
If that value is not representable in T, the behavior is undefined. Call to this function is permitted in constant evaluation only if the undefined behavior does not occur.
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).
Parameters
| x | - | value of unsigned integer type |
Return value
The smallest integral power of two that is not smaller than x.
Exceptions
Throws nothing.
Notes
Prior to P1956R1, the proposed name for this function template was ceil2.
| Feature-test macro | Value | Std | Feature |
|---|---|---|---|
__cpp_lib_int_pow2 |
202002L |
(C++20) | Integral power-of-2 operations |
Possible implementation
See possible implementations in libstdc++ (gcc) and libc++ (clang).
|
Example
#include <bit>
#include <bitset>
#include <iostream>
int main()
{
using bin = std::bitset<8>;
for (auto x{0U}; 0XA != x; ++x)
std::cout << "bit_ceil( " << bin(x) << " ) = "
<< bin(std::bit_ceil(x)) << '\n';
}bit_ceil( 00000000 ) = 00000001
bit_ceil( 00000001 ) = 00000001
bit_ceil( 00000010 ) = 00000010
bit_ceil( 00000011 ) = 00000100
bit_ceil( 00000100 ) = 00000100
bit_ceil( 00000101 ) = 00001000
bit_ceil( 00000110 ) = 00001000
bit_ceil( 00000111 ) = 00001000
bit_ceil( 00001000 ) = 00001000
bit_ceil( 00001001 ) = 00010000See also
| (C++20) |
finds the largest integral power of 2 not greater than the given value (function template) |
Content from this page on cppreference.com, licensed under CC-BY-SA 3.0 and GFDL. Modified: restyled, site navigation removed, code windows added. Offline snapshot of 9 February 2025.