You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 

52 lines
1.3 KiB

#ifndef ALGOIM_BOOLUARRAY_HPP
#define ALGOIM_BOOLUARRAY_HPP
// algoim::booluarray
#include <bitset>
#include "uvector.hpp"
namespace algoim
{
namespace booluarray_detail
{
constexpr int pow(int base, int exp) { return exp == 0 ? 1 : base * pow(base, exp - 1); }
template <int E, int N>
constexpr int furl(const uvector<int, N>& i) // 为什么这里可以是constexpr,uvector不是变量吗?
{
int ind = i(0);
for (int j = 1; j < N; ++j) ind = ind * E + i(j);
return ind;
}
} // namespace booluarray_detail
// booluarray implements a simple N-dimensional array of booleans, with
// compile-time extent E across all dimensions; it is essentially a basic
// specialisation of uarray<bool,N,E>
template <int N, int E>
class booluarray
{
constexpr static int size = booluarray_detail::pow(E, N);
public:
std::bitset<size> bits;
booluarray() {}
booluarray(bool val)
{
if (val) bits.set(); // 全部置为1
}
bool operator()(const uvector<int, N>& i) const { return bits[booluarray_detail::furl<E>(i)]; }
auto operator()(const uvector<int, N>& i) { return bits[booluarray_detail::furl<E>(i)]; }
// returns true iff the entire array is false
bool none() const { return bits.none(); }
};
} // namespace algoim
#endif