data_structures: use >> 1 instead of / 2 for non-negative halving

Author: cameroncuster

library/data_structures_[l,r)/bit_uncommon/walk.hpp

@@ -1,7 +1,7 @@
 int walk(ll sum) {
   if (sum <= 0) return -1;
   int r = 0;
-  for (int i = bit_floor(size(s)); i; i /= 2)
+  for (int i = bit_floor(size(s)); i; i >>= 1)
     if (r + i <= sz(s) && s[r + i - 1] < sum)
       sum -= s[(r += i) - 1];
   return r;

library/data_structures_[l,r)/seg_tree.hpp

@@ -27,12 +27,12 @@ template<class T, class F> struct tree {
   tree(int n, T unit, F op):
     n(n), unit(unit), op(op), s(2 * n, unit) {}
   void update(int i, T val) {
-    for (s[i += n] = val; i /= 2;)
+    for (s[i += n] = val; i >>= 1;)
       s[i] = op(s[2 * i], s[2 * i + 1]);
   }
   T query(int l, int r) {
     T x = unit, y = unit;
-    for (l += n, r += n; l < r; l /= 2, r /= 2) {
+    for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
       if (l % 2) x = op(x, s[l++]);
       if (r % 2) y = op(s[--r], y);
     }

library/data_structures_[l,r)/seg_tree_midpoint.hpp

@@ -2,5 +2,5 @@
 //! https://codeforces.com/blog/entry/112755
 int split(int tl, int tr) {
   int pw2 = bit_floor(tr - tl + 0u);
-  return min(tl + pw2, tr - pw2 / 2);
+  return min(tl + pw2, tr - (pw2 >> 1));
 }

library/data_structures_[l,r)/uncommon/deque_op.hpp

@@ -10,7 +10,7 @@ template<class T, class F> struct deq {
   F op;
   vector<dt> l, r;
   deq(const vector<T>& a, F op): op(op) {
-    rebuild(a, sz(a) / 2);
+    rebuild(a, sz(a) >> 1);
   }
   T query() {
     if (empty(l)) return r.back()[1];
@@ -33,7 +33,7 @@ template<class T, class F> struct deq {
       vector<T> a(sz(l));
       ranges::transform(l, rbegin(a),
         [](dt& x) { return x[0]; });
-      rebuild(a, sz(a) / 2);
+      rebuild(a, sz(a) >> 1);
     }
     r.pop_back();
   }
@@ -46,7 +46,7 @@ template<class T, class F> struct deq {
       vector<T> a(sz(r));
       ranges::transform(r, begin(a),
         [](dt& x) { return x[0]; });
-      rebuild(a, (sz(a) + 1) / 2);
+      rebuild(a, (sz(a) + 1) >> 1);
     }
     l.pop_back();
   }

library/data_structures_[l,r)/uncommon/hilbert_mos.hpp

@@ -11,7 +11,7 @@
 ll hilbert(int x, int y) {
   ll d = 0, mx = 1;
   while (mx <= max(x, y)) mx *= 4;
-  for (int s = mx / 2; s; s /= 2) {
+  for (int s = mx >> 1; s; s >>= 1) {
     bool rx = x & s, ry = y & s;
     d = d * 4 | (ry * 3 ^ rx);
     if (!rx) {

library/data_structures_[l,r]/seg_tree.hpp

@@ -30,7 +30,7 @@ template<class T, class F> struct tree {
     n(n), op(op), s(2 * n, unit) {}
 #include "seg_tree_uncommon/init.hpp"
   void update(int i, T val) {
-    for (s[i += n] = val; i /= 2;)
+    for (s[i += n] = val; i >>= 1;)
       s[i] = op(s[2 * i], s[2 * i + 1]);
   }
   T query(int l, int r) {

library/data_structures_[l,r]/seg_tree_midpoint.hpp

@@ -6,5 +6,5 @@
 //! @endcode
 int split(int tl, int tr) {
   int pw2 = bit_floor(tr - tl + 1u);
-  return min(tl + pw2 - 1, tr - pw2 / 2);
+  return min(tl + pw2 - 1, tr - (pw2 >> 1));
 }