123{
124
125 const int n = 21;
127 const int n_choose_p = 116280;
128
130
133 for (
size_t i = 0; i <
p; i++) b[i] = i;
134
135 for (size_t i = 0; i < n_choose_p; i++)
136 {
137 C.decode(i, a);
139 EXPECT_TRUE(C.isValid(a));
140 size_t j = C.encode(a);
141 EXPECT_EQ(i, j);
143 EXPECT_EQ(ret, i + 1 != n_choose_p);
144 }
145}
bool sameSubset(const Subset &a, const Subset &b)
static bool increment(size_t n, Subset &s)
Bijective integer encoding of q-subsets of {0, ..., n-1} via binomial(a_0, 1) + binomial(a_1,...
std::vector< size_t > Subset