change push_back to += for basic strings

Author: lrvideckis

library/contest/dynamic_bitset.hpp

@@ -18,7 +18,7 @@ void f() {
   bs.push_back(0);
   cerr << bs << endl;
   for (int i = bs.find_first(); i != ssize(bs);
-       i = bs.find_next(i))
+    i = bs.find_next(i))
     cerr << i << endl;
   bs -= bs; // bs &= ~bs;
 }

library/data_structures/uncommon/priority_queue_of_updates.hpp

@@ -34,7 +34,7 @@ template<class DS, class... ARGS> struct pq_updates {
     vector<upd> extra;
     int idx = sz(upd_st) - 1, lowest_pri = INT_MAX;
     for (auto it = rbegin(mp);
-         2 * sz(extra) < sz(upd_st) - idx; it++) {
+      2 * sz(extra) < sz(upd_st) - idx; it++) {
       auto [pri, idx_sk] = *it;
       extra.push_back(upd_st[idx_sk]);
       idx = min(idx, idx_sk), lowest_pri = pri;

library/graphs/bridges_cuts/bridges.hpp

@@ -10,8 +10,8 @@
 //!     int u, v;
 //!     cin >> u >> v;
 //!     u--, v--;
-//!     adj[u].push_back({v, i});
-//!     adj[v].push_back({u, i});
+//!     adj[u] += {v, i};
+//!     adj[v] += {u, i};
 //!   }
 //!   auto [num_ccs, br_id, is_br] = bridges(adj, m);
 //! @endcode

library/graphs/bridges_cuts/cuts.hpp

@@ -11,8 +11,8 @@
 //!     cin >> u >> v;
 //!     u--, v--;
 //!     //self edges not allowed
-//!     adj[u].push_back({v, i});
-//!     adj[v].push_back({u, i});
+//!     adj[u] += {v, i};
+//!     adj[v] += {u, i};
 //!   }
 //!   auto [num_bccs, bcc_id, is_cut] = cuts(adj, m);
 //! @endcode

library/graphs/hopcroft_karp.hpp

@@ -7,7 +7,7 @@
 //!       mvc_l, mvc_r] = hopcroft_karp(adj, rsz);
 //!   }
 //!   vector<basic_string<int>> adj(lsz);
-//!   adj[l].push_back(r); // add edge l <-> r
+//!   adj[l] += r; // add edge l <-> r
 //!                        // 0<=l<lsz; 0<=r<rsz
 //!   auto [matching_size, to_r, to_l,
 //!     mvc_l, mvc_r] = hopcroft_karp(adj, rsz);

library/graphs/strongly_connected_components/offline_incremental_scc.hpp

@@ -29,7 +29,7 @@ vi offline_incremental_scc(vector<array<int, 2>> eds,
         adj.emplace_back();
       }
       u = ids[u], v = ids[v];
-      if (*it <= mid) adj[u].push_back(v);
+      if (*it <= mid) adj[u] += v;
     }
     rep(i, 0, sz(adj)) ids[vs[i]] = -1;
     scc_id = sccs(adj).second;

library/loops/chooses.hpp

@@ -5,4 +5,4 @@
 //! @time O(n choose k)
 //! @space O(1)
 for (int mask = (1 << k) - 1; mask < (1 << n);
-     mask = next_subset(mask))
+  mask = next_subset(mask))

library/loops/submasks.hpp

@@ -5,4 +5,4 @@
 //!   of every mask of size n
 //! @space O(1)
 for (int submask = mask; submask;
-     submask = (submask - 1) & mask)
+  submask = (submask - 1) & mask)

library/loops/supermasks.hpp

@@ -6,4 +6,4 @@
 //!   of every mask of size n
 //! @space O(1)
 for (int supermask = mask; supermask < (1 << n);
-     supermask = (supermask + 1) | mask)
+  supermask = (supermask + 1) | mask)

library/math/matrix_related/xor_basis_unordered.hpp

@@ -17,6 +17,6 @@ template<class T> struct basis {
     return v;
   }
   bool insert(T v) {
-    return (v = shrink(v)) ? b.push_back(v), 1 : 0;
+    return (v = shrink(v)) ? b += v, 1 : 0;
   }
 };