fix

Author: lrvideckis

tests/library_checker_aizu_tests/data_structures/bit.test.cpp

@@ -58,7 +58,7 @@ int main() {
       }
       return 1;
     };
-    assert(bit.walk(sum) == st.find_first(0, n, f));
+    assert(bit.walk2(sum) == st.find_first(0, n, f));
   }
   return 0;
 }

tests/library_checker_aizu_tests/data_structures/bit_ordered_set.test.cpp

@@ -40,7 +40,7 @@ int main() {
       x = get_compressed_idx(x);
       if (bit.query(x, x) == 1) bit.update(x, -1);
     } else if (type == 2) {
-      int res = bit.walk(x);
+      int res = bit.walk2(x);
       if (res == -1 || res == ssize(compress))
         cout << -1 << '\n';
       else cout << compress[res] << '\n';
@@ -49,12 +49,12 @@ int main() {
       cout << bit.query(x) << '\n';
     } else if (type == 4) {
       x = get_compressed_idx(x);
-      int res = bit.walk(bit.query(x));
+      int res = bit.walk2(bit.query(x));
       if (res == -1) cout << -1 << '\n';
       else cout << compress[res] << '\n';
     } else {
       x = get_compressed_idx(x);
-      int res = bit.walk(bit.query(x - 1) + 1);
+      int res = bit.walk2(bit.query(x - 1) + 1);
       if (res == ssize(bit.s)) cout << -1 << '\n';
       else cout << compress[res] << '\n';
     }

tests/library_checker_aizu_tests/handmade_tests/seg_tree_find.test.cpp

@@ -38,7 +38,7 @@ int main() {
       rngs.push_back({tl, tr, 1});
       return 1;
     };
-    int pos = min(bit.walk(bit.query(l) + sum), r);
+    int pos = min(bit.walk2(bit.query(l) + sum), r);
     reset();
     assert(pos == seg.find_first(l, r, f));
     assert(!empty(rngs));