Refactor xor_basis_walk test for fixed bitset size

Author: lrvideckis

tests/library_checker_aizu_tests/handmade_tests/xor_basis_walk.test.cpp

@@ -3,42 +3,41 @@
 #include "../template.hpp"
 #include "../../../library/contest/random.hpp"
 #include "../../../library/math/matrix_related/xor_basis_ordered.hpp"
-const int B = 18;
-vector<bitset<B>> get_all(const vector<bitset<B>>& basis) {
+vector<bitset<18>> get_all(const vector<bitset<18>>& basis) {
   int n = ssize(basis);
-  vector<bitset<B>> span;
+  vector<bitset<18>> span;
   for (int mask = 0; mask < (1 << n); mask++) {
-    bitset<B> curr_xor;
+    bitset<18> curr_xor;
     assert(curr_xor.none());
     for (int bit = 0; bit < n; bit++)
       if ((mask >> bit) & 1) curr_xor ^= basis[bit];
     span.push_back(curr_xor);
   }
-  ranges::sort(span, {}, [&](const bitset<B>& x) -> long {
+  ranges::sort(span, {}, [&](const bitset<18>& x) -> long {
     return x.to_ulong();
   });
   return span;
 }
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   for (int num_tests = 0; num_tests < 100; num_tests++) {
-    xor_basis<B> b;
+    xor_basis<18> b;
     int n = rnd(1, 16);
-    vector<bitset<B>> naive_basis;
+    vector<bitset<18>> naive_basis;
     for (int i = 0; i < n; i++) {
-      bitset<B> val = rnd(0, (1 << n) - 1);
+      bitset<18> val = rnd(0, (1 << n) - 1);
       if (b.insert(val)) naive_basis.push_back(val);
       assert(b.npivot + b.nfree == i + 1);
     }
     assert(ssize(naive_basis) == b.npivot);
-    vector<bitset<B>> fast_basis;
-    for (int i = 0; i < B; i++)
+    vector<bitset<18>> fast_basis;
+    for (int i = 0; i < 18; i++)
       if (b.basis[i][i]) fast_basis.push_back(b.basis[i]);
-    vector<bitset<B>> naive_span = get_all(naive_basis);
-    vector<bitset<B>> fast_span = get_all(fast_basis);
+    vector<bitset<18>> naive_span = get_all(naive_basis);
+    vector<bitset<18>> fast_span = get_all(fast_basis);
     assert(naive_span == fast_span);
     for (int i = 0; i < ssize(naive_span); i++) {
-      bitset<B> k = i;
+      bitset<18> k = i;
       assert(naive_span[i] == b.walk(k));
     }
   }