drifty/comaps
1
0
Fork 0
mirror of https://codeberg.org/comaps/comaps synced 2025-12-20 05:13:58 +00:00
Code Issues Packages Projects Releases Wiki Activity

Format all C++ and Java code via clang-format

Browse Source 
Signed-off-by: Konstantin Pastbin <konstantin.pastbin@gmail.com>
This commit is contained in:
Konstantin Pastbin
2025-08-17 14:32:37 +07:00
parent 9f0290c0ec
commit bfffa1fff4
2169 changed files with 56441 additions and 64188 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
libs/base/bits.hpp
View File

@@ -10,7 +10,8 @@ namespace bits
{
static constexpr int SELECT1_ERROR = -1;
template <typename T> unsigned int select1(T x, unsigned int i)
template <typename T>
unsigned int select1(T x, unsigned int i)
{
// TODO: Fast implementation of select1.
ASSERT(i > 0 && i <= sizeof(T) * 8, (i));
@@ -104,17 +105,27 @@ inline void SetBitTo1(void * p, uint32_t offset)
// Compute number of zero bits from the most significant bits side.
constexpr uint32_t NumHiZeroBits32(uint32_t n)
{
if (n == 0) return 32;
if (n == 0)
return 32;
uint32_t result = 0;
while ((n & (uint32_t{1} << 31)) == 0) { ++result; n <<= 1; }
while ((n & (uint32_t{1} << 31)) == 0)
{
++result;
n <<= 1;
}
return result;
}
constexpr uint32_t NumHiZeroBits64(uint64_t n)
{
if (n == 0) return 64;
if (n == 0)
return 64;
uint32_t result = 0;
while ((n & (uint64_t{1} << 63)) == 0) { ++result; n <<= 1; }
while ((n & (uint64_t{1} << 63)) == 0)
{
++result;
n <<= 1;
}
return result;
}
@@ -123,16 +134,22 @@ constexpr uint32_t NumHiZeroBits64(uint64_t n)
constexpr uint32_t NumUsedBits(uint64_t n)
{
uint32_t result = 0;
while (n != 0) { ++result; n >>= 1; }
while (n != 0)
{
++result;
n >>= 1;
}
return result;
}
constexpr uint64_t GetFullMask(uint8_t numBits)
{
ASSERT_LESS_OR_EQUAL(numBits, 64, ());
return numBits == 64 ? std::numeric_limits<uint64_t>::max()
: (static_cast<uint64_t>(1) << numBits) - 1;
return numBits == 64 ? std::numeric_limits<uint64_t>::max() : (static_cast<uint64_t>(1) << numBits) - 1;
}
constexpr bool IsPow2Minus1(uint64_t n) { return (n & (n + 1)) == 0; }
constexpr bool IsPow2Minus1(uint64_t n)
{
return (n & (n + 1)) == 0;
}
} // namespace bits