28inline size_t exp2(
size_t k) {
return size_t(1) << k; }
35long long div_ceil(
long long x,
long long y);
39std::string
FORMAT(
const std::string &prefix,
const char*
format, ...);
42template<
typename ... Types>
46#define FMT libff::FORMAT
48#define FMT(...) (libff::UNUSED(__VA_ARGS__), "")
57#define ARRAY_SIZE(arr) (sizeof(arr)/sizeof(arr[0]))
61#include <libff/common/utils.tcc>
void deserialize_bit_vector(std::istream &in, bit_vector &v)
size_t bitreverse(size_t n, const size_t l)
size_t size_in_bits(const std::vector< T > &v)
size_t get_power_of_two(size_t n)
std::vector< bool > bit_vector
size_t log2(size_t n)
returns ceil(log2(n)), so 1ul<<log2(n) is the smallest power of 2, that is not less than n
std::string FORMAT(const std::string &prefix, const char *format,...)
bit_vector int_list_to_bits(const std::initializer_list< unsigned long > &l, const size_t wordsize)
size_t to_twos_complement(int i, size_t w)
int from_twos_complement(size_t i, size_t w)
void serialize_bit_vector(std::ostream &out, const bit_vector &v)
long long div_ceil(long long x, long long y)