drifty/comaps
1
0
Fork 0
mirror of https://codeberg.org/comaps/comaps synced 2025-12-19 21:13:35 +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

17
libs/base/math.hpp
View File

@@ -2,9 +2,9 @@
#include "base/assert.hpp"
#include <algorithm> // std::max
#include <algorithm> // std::max
#include <cmath>
#include <functional> // std::hash
#include <functional> // std::hash
#include <type_traits>
namespace math
@@ -25,9 +25,8 @@ T Abs(T x)
return (x < 0 ? -x : x);
}
template <typename Number,
typename EnableIf = typename std::enable_if_t<
std::is_integral_v<Number> || std::is_floating_point_v<Number>, void>>
template <typename Number, typename EnableIf = typename std::enable_if_t<
std::is_integral_v<Number> || std::is_floating_point_v<Number>, void>>
int constexpr Sign(Number const number) noexcept
{
return number == 0 ? 0 : number > 0 ? 1 : -1;
@@ -110,10 +109,8 @@ T PowUint(T x, uint64_t n)
{
T res = 1;
for (T t = x; n > 0; n >>= 1, t *= t)
{
if (n & 1)
res *= t;
}
return res;
}
@@ -150,16 +147,14 @@ inline uint32_t NextPowOf2(uint32_t v)
}
// Greatest Common Divisor.
template <typename Number,
typename EnableIf = typename std::enable_if_t<std::is_integral_v<Number>, void>>
template <typename Number, typename EnableIf = typename std::enable_if_t<std::is_integral_v<Number>, void>>
Number constexpr GCD(Number const a, Number const b)
{
return b == 0 ? a : GCD(b, a % b);
}
// Least Common Multiple.
template <typename Number,
typename EnableIf = typename std::enable_if_t<std::is_integral_v<Number>, void>>
template <typename Number, typename EnableIf = typename std::enable_if_t<std::is_integral_v<Number>, void>>
Number constexpr LCM(Number const a, Number const b)
{
return a / GCD(a, b) * b;