to retest it

Author: lrvideckis

library/data_structures_[l,r]/seg_tree_uncommon/walk.hpp

@@ -1,5 +1,5 @@
 int walk(int l, int r, const auto& f) {
-  if (T x = s[l + n]; f(x))
+  if (T x = s[l +n]; f(x))
     for (l++; l <= r;) {
       int u = l + n, v = __lg(min(u & -u, r - l + 1));
       if (T y = op(x, s[u >> v]); f(y)) l += 1 << v, x = y;