format

Author: lrvideckis

library/data_structures_[l,r)/seg_tree_uncommon/kth_smallest_query.hpp

@@ -20,8 +20,8 @@ struct kth_smallest {
   //! @space O(log(maxv - minv)) for recursion stack; no
   //! new nodes are allocated
   int query(int l, int r, int k) {
-    return query(k, pst.root_l, pst.root_r,
-      pst.roots[l], pst.roots[r]);
+    return query(k, pst.root_l, pst.root_r, pst.roots[l],
+      pst.roots[r]);
   }
   int query(int k, int tl, int tr, int vl, int vr) {
     if (tr - tl == 1) return tl;
@@ -31,7 +31,7 @@ struct kth_smallest {
     if (left_count >= k)
       return query(k, tl, tm, pst.tree[vl].lch,
         pst.tree[vr].lch);
-    return query(k - left_count, tm, tr,
-      pst.tree[vl].rch, pst.tree[vr].rch);
+    return query(k - left_count, tm, tr, pst.tree[vl].rch,
+      pst.tree[vr].rch);
   }
 };

library/data_structures_[l,r)/seg_tree_uncommon/merge_sort_tree.hpp

@@ -16,8 +16,8 @@ struct merge_sort_tree {
   int query(int l, int r, int vl, int vr) {
     return query(l, r, vl, vr, 0, n, 1);
   }
-  int query(int l, int r, int vl, int vr, int tl,
-    int tr, int v) {
+  int query(int l, int r, int vl, int vr, int tl, int tr,
+    int v) {
     if (r <= tl || tr <= l) return 0;
     if (l <= tl && tr <= r)
       return ranges::lower_bound(tree[v], vr) -

library/data_structures_[l,r)/seg_tree_uncommon/persistent.hpp

@@ -22,28 +22,25 @@ struct PST {
     root_l(root_l), root_r(root_r), roots(1),
     tree(1, {0LL, 0, 0}) {}
   void update(int idx, ll change, int version) {
-    roots.push_back(update(idx, change, root_l,
-      root_r, roots[version]));
+    roots.push_back(
+      update(idx, change, root_l, root_r, roots[version]));
   }
-  int update(int idx, ll change, int tl, int tr,
-    int v) {
+  int update(int idx, ll change, int tl, int tr, int v) {
     if (tr - tl == 1) {
       tree.emplace_back(tree[v].sum + change, 0, 0);
       return sz(tree) - 1;
     }
     int tm = tl + (tr - tl) / 2;
     int lch = tree[v].lch;
     int rch = tree[v].rch;
-    if (idx < tm)
-      lch = update(idx, change, tl, tm, lch);
+    if (idx < tm) lch = update(idx, change, tl, tm, lch);
     else rch = update(idx, change, tm, tr, rch);
     tree.emplace_back(tree[lch].sum + tree[rch].sum, lch,
       rch);
     return sz(tree) - 1;
   }
   ll query(int l, int r, int version) { // [l, r)
-    return query(l, r, root_l, root_r,
-      roots[version]);
+    return query(l, r, root_l, root_r, roots[version]);
   }
   ll query(int l, int r, int tl, int tr, int v) {
     if (v == 0 || r <= tl || tr <= l) return 0;