lokinet/llarp/util/bits.hpp

77 lines
1.6 KiB
C++
Raw Normal View History

#ifndef LLARP_BITS_HPP
#define LLARP_BITS_HPP
2019-02-07 00:22:54 +00:00
#include <bitset>
2018-12-15 16:21:52 +00:00
#include <cstddef>
2019-02-07 00:22:54 +00:00
#include <numeric>
#include <type_traits>
2019-02-07 12:31:14 +00:00
#include <limits>
2020-02-24 17:22:24 +00:00
#include <net/uint128.hpp>
#include <net/net_int.hpp>
2018-12-15 16:21:52 +00:00
namespace llarp
{
namespace bits
{
template <typename Int_t>
2018-12-15 16:21:52 +00:00
constexpr std::size_t
2019-02-07 00:22:54 +00:00
count_bits(Int_t i)
{
static_assert(std::is_integral<Int_t>::value, "Int_t should be an integer");
static_assert(std::is_unsigned<Int_t>::value, "Int_t should be unsigned");
return std::bitset<std::numeric_limits<Int_t>::digits>(i).count();
}
constexpr std::size_t
count_bits_128(const uint128_t& i)
{
return count_bits(i.upper) + count_bits(i.lower);
}
template <>
constexpr std::size_t
count_bits(huint32_t x)
{
return count_bits(x.h);
}
template <>
constexpr std::size_t
count_bits(nuint32_t x)
{
return count_bits(x.n);
}
template <>
constexpr std::size_t
count_bits(huint128_t x)
{
return count_bits_128(x.h);
}
template <>
constexpr std::size_t
count_bits(nuint128_t x)
{
return count_bits_128(x.n);
}
template <typename InputIt>
2018-12-15 16:21:52 +00:00
constexpr std::size_t
count_array_bits_impl(InputIt begin, InputIt end)
{
return std::accumulate(
begin, end, 0, [](auto acc, auto val) { return acc + count_bits(val); });
}
template <typename T>
2018-12-15 16:21:52 +00:00
constexpr std::size_t
count_array_bits(const T& array)
{
return count_array_bits_impl(std::begin(array), std::end(array));
}
} // namespace bits
} // namespace llarp
#endif