rename self -> f

lrvideckis · lrvideckis · commit ab0348e6f4b5 · 2026-04-04T12:41:45.000-06:00
diff --git a/library/convolution/min_plus_convolution_convex_and_arbitrary.hpp b/library/convolution/min_plus_convolution_convex_and_arbitrary.hpp
@@ -9,7 +9,7 @@ vi min_plus(const vi& convex, const vi& arbitrary) {
   int n = sz(convex);
   int m = sz(arbitrary);
   vi res(n + m - 1, INT_MAX);
-  auto dnc = [&](auto&& self, int res_le, int res_ri,
+  auto dnc = [&](auto&& f, int res_le, int res_ri,
                int arb_le, int arb_ri) -> void {
     if (res_le >= res_ri) return;
     int mid_res = (res_le + res_ri) / 2;
@@ -22,9 +22,8 @@ vi min_plus(const vi& convex, const vi& arbitrary) {
         op_arb = i;
       }
     }
-    self(self, res_le, mid_res, arb_le,
-      min(arb_ri, op_arb + 1));
-    self(self, mid_res + 1, res_ri, op_arb, arb_ri);
+    f(f, res_le, mid_res, arb_le, min(arb_ri, op_arb + 1));
+    f(f, mid_res + 1, res_ri, op_arb, arb_ri);
   };
   dnc(dnc, 0, n + m - 1, 0, m);
   return res;
diff --git a/library/graphs/bcc_callback.hpp b/library/graphs/bcc_callback.hpp
@@ -44,11 +44,11 @@
 void bcc(const auto& adj, auto f) {
   int n = sz(adj), q = 0, s = 0;
   vi t(n), st(n);
-  auto dfs = [&](auto&& self, int u) -> int {
+  auto dfs = [&](auto&& f, int u) -> int {
     int l = t[u] = ++q;
     for (int v : adj[u]) {
       int siz = s, lu = 0;
-      l = min(l, t[v] ?: (lu = self(self, st[s++] = v)));
+      l = min(l, t[v] ?: (lu = f(f, st[s++] = v)));
       if (lu >= t[u]) {
         st[s++] = u;
         f({siz + all(st) - n + s});
diff --git a/library/graphs/euler_path.hpp b/library/graphs/euler_path.hpp
@@ -16,11 +16,11 @@
 vector<pii> euler_path(auto& adj, int m, int s) {
   vi vis(m);
   vector<pii> path;
-  auto dfs = [&](auto&& self, int u, int eu) -> void {
+  auto dfs = [&](auto&& f, int u, int eu) -> void {
     while (!empty(adj[u])) {
       auto [v, ev] = adj[u].back();
       adj[u].pop_back();
-      if (!vis[ev]) vis[ev] = 1, self(self, v, ev);
+      if (!vis[ev]) vis[ev] = 1, f(f, v, ev);
     }
     path.emplace_back(u, eu);
   };
diff --git a/library/graphs/hopcroft_karp.hpp b/library/graphs/hopcroft_karp.hpp
@@ -43,11 +43,11 @@ struct hopcroft_karp {
         }
       }
       if (!found) break;
-      auto dfs = [&](auto&& self, int u) -> bool {
+      auto dfs = [&](auto&& f, int u) -> bool {
         for (int v : adj[u]) {
           int w = to_l[v];
           if (w == -1 ||
-            (level[u] + 1 == level[w] && self(self, w))) {
+            (level[u] + 1 == level[w] && f(f, w))) {
             to_r[u] = v;
             to_l[v] = u;
             return 1;
diff --git a/library/graphs/scc.hpp b/library/graphs/scc.hpp
@@ -11,12 +11,11 @@
 auto scc(const auto& adj) {
   int n = sz(adj), num_sccs = 0, q = 0, s = 0;
   vi scc_id(n, -1), tin(n), st(n);
-  auto dfs = [&](auto&& self, int u) -> int {
+  auto dfs = [&](auto&& f, int u) -> int {
     int low = tin[u] = ++q;
     st[s++] = u;
     for (int v : adj[u])
-      if (scc_id[v] < 0)
-        low = min(low, tin[v] ?: self(self, v));
+      if (scc_id[v] < 0) low = min(low, tin[v] ?: f(f, v));
     if (tin[u] == low) {
       while (scc_id[u] < 0) scc_id[st[--s]] = num_sccs;
       num_sccs++;
diff --git a/library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp b/library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp
@@ -29,12 +29,12 @@ vector<pii> extra_edges(const auto& adj, int num_sccs,
     zero_in[scc_id[v]] = 0;
   }
   vector<bool> vis(num_sccs);
-  auto dfs = [&](auto&& self, int u) {
+  auto dfs = [&](auto&& f, int u) {
     if (empty(scc_adj[u])) return u;
     for (int v : scc_adj[u])
       if (!vis[v]) {
         vis[v] = 1;
-        int zero_out = self(self, v);
+        int zero_out = f(f, v);
         if (zero_out != -1) return zero_out;
       }
     return -1;
diff --git a/library/graphs/strongly_connected_components/offline_incremental_scc.hpp b/library/graphs/strongly_connected_components/offline_incremental_scc.hpp
@@ -16,8 +16,8 @@ vi offline_incremental_scc(vector<array<int, 2>> eds,
   vi ids(n, -1), joins(m, m), idx(m), vs(n), scc_id;
   iota(all(idx), 0);
   vector<vi> adj;
-  auto divide_and_conquer = [&](auto&& self, auto el,
-                              auto er, int tl, int tr) {
+  auto divide_and_conquer = [&](auto&& f, auto el, auto er,
+                              int tl, int tr) {
     adj.clear();
     int mid = midpoint(tl, tr);
     for (auto it = el; it != er; it++) {
@@ -42,8 +42,8 @@ vi offline_incremental_scc(vector<array<int, 2>> eds,
       auto& [u, v] = eds[*it];
       u = scc_id[u], v = scc_id[v];
     }
-    self(self, el, split, tl, mid);
-    self(self, split, er, mid, tr);
+    f(f, el, split, tl, mid);
+    f(f, split, er, mid, tr);
   };
   // uses -1 as the lower bound to correctly handle
   // self-edges
diff --git a/library/graphs/uncommon/bridges.hpp b/library/graphs/uncommon/bridges.hpp
@@ -18,12 +18,12 @@
 auto bridges(const auto& adj, int m) {
   int n = sz(adj), num_ccs = 0, q = 0, s = 0;
   vi br_id(n, -1), is_br(m), tin(n), st(n);
-  auto dfs = [&](auto&& self, int u, int p) -> int {
+  auto dfs = [&](auto&& f, int u, int p) -> int {
     int low = tin[u] = ++q;
     st[s++] = u;
     for (auto [v, e] : adj[u])
       if (e != p && br_id[v] < 0)
-        low = min(low, tin[v] ?: self(self, v, e));
+        low = min(low, tin[v] ?: f(f, v, e));
     if (tin[u] == low) {
       if (p != -1) is_br[p] = 1;
       while (br_id[u] < 0) br_id[st[--s]] = num_ccs;
diff --git a/library/graphs/uncommon/cuts.hpp b/library/graphs/uncommon/cuts.hpp
@@ -19,14 +19,14 @@
 auto cuts(const auto& adj, int m) {
   int n = sz(adj), num_bccs = 0, q = 0, s = 0;
   vi bcc_id(m, -1), is_cut(n), tin(n), st(m);
-  auto dfs = [&](auto&& self, int u, int p) -> int {
+  auto dfs = [&](auto&& elf, int u, int p) -> int {
     int low = tin[u] = ++q;
     for (auto [v, e] : adj[u]) {
       assert(u != v);
       if (e == p) continue;
       if (tin[v] < tin[u]) st[s++] = e;
       int lu = -1;
-      low = min(low, tin[v] ?: (lu = self(self, v, e)));
+      low = min(low, tin[v] ?: (lu = f(f, v, e)));
       if (lu >= tin[u]) {
         is_cut[u] = p >= 0 || tin[u] + 1 < tin[v];
         while (bcc_id[e] < 0) bcc_id[st[--s]] = num_bccs;
diff --git a/library/trees/centroid_decomp.hpp b/library/trees/centroid_decomp.hpp
@@ -7,12 +7,12 @@
 //! @space O(n)
 void centroid(auto& adj, const auto& f) {
   vi siz(sz(adj));
-  auto calc_sz = [&](auto&& self, int u, int p) -> void {
+  auto calc_sz = [&](auto&& f, int u, int p) -> void {
     siz[u] = 1;
     for (int v : adj[u])
-      if (v != p) self(self, v, u), siz[u] += siz[v];
+      if (v != p) f(f, v, u), siz[u] += siz[v];
   };
-  auto dfs = [&](auto&& self, int u, int p) -> void {
+  auto dfs = [&](auto&& f, int u, int p) -> void {
     calc_sz(calc_sz, u, -1);
     for (int w = -1, sz_root = siz[u];;) {
       auto big_ch = ranges::find_if(adj[u], [&](int v) {
@@ -25,7 +25,7 @@ void centroid(auto& adj, const auto& f) {
     for (int v : adj[u]) {
       iter_swap(ranges::find(adj[v], u), rbegin(adj[v]));
       adj[v].pop_back();
-      self(self, v, u);
+      f(f, v, u);
     }
   };
   dfs(dfs, 0, -1);
diff --git a/library/trees/edge_cd.hpp b/library/trees/edge_cd.hpp
@@ -16,20 +16,20 @@
 template<class G>
 void edge_cd(vector<G>& adj, const auto& f) {
   vi siz(sz(adj));
-  auto find_cent = [&](auto&& self, int u, int p,
+  auto find_cent = [&](auto&& f, int u, int p,
                      int m) -> int {
     siz[u] = 1;
     for (int v : adj[u])
       if (v != p) {
-        int cent = self(self, v, u, m);
+        int cent = f(f, v, u, m);
         if (cent != -1) return cent;
         siz[u] += siz[v];
       }
     return 2 * siz[u] > m
            ? p >= 0 && (siz[p] = m + 1 - siz[u]),
            u : -1;
   };
-  auto dfs = [&](auto&& self, int u, int m) -> void {
+  auto dfs = [&](auto&& f, int u, int m) -> void {
     if (m < 2) return;
     u = find_cent(find_cent, u, -1, m);
     int sum = 0;
@@ -40,9 +40,9 @@ void edge_cd(vector<G>& adj, const auto& f) {
     f(u, it - begin(adj[u]));
     G oth(it, end(adj[u]));
     adj[u].erase(it, end(adj[u]));
-    self(self, u, sum);
+    f(f, u, sum);
     swap(adj[u], oth);
-    self(self, u, m - sum);
+    f(f, u, m - sum);
   };
   dfs(dfs, 0, sz(adj) - 1);
 };
diff --git a/library/trees/hld.hpp b/library/trees/hld.hpp
@@ -15,23 +15,23 @@ template<bool VALS_EDGES> struct HLD {
   vi p, siz, rt, tin;
   HLD(auto& adj):
     n(sz(adj)), p(n), siz(n, 1), rt(n), tin(n) {
-    auto dfs1 = [&](auto&& self, int u) -> void {
+    auto dfs1 = [&](auto&& f, int u) -> void {
       for (int& v : adj[u]) {
         iter_swap(ranges::find(adj[v], u), rbegin(adj[v]));
         adj[v].pop_back();
         p[v] = u;
-        self(self, v);
+        f(f, v);
         siz[u] += siz[v];
         if (siz[v] > siz[adj[u][0]]) swap(v, adj[u][0]);
       }
     };
     dfs1(dfs1, 0);
     int tim = 0;
-    auto dfs2 = [&](auto&& self, int u) -> void {
+    auto dfs2 = [&](auto&& f, int u) -> void {
       tin[u] = tim++;
       for (int v : adj[u]) {
         rt[v] = (v == adj[u][0] ? rt[u] : v);
-        self(self, v);
+        f(f, v);
       }
     };
     dfs2(dfs2, 0);
diff --git a/library/trees/lca_rmq.hpp b/library/trees/lca_rmq.hpp
@@ -16,11 +16,11 @@ struct LCA {
   LCA(const auto& adj):
     n(sz(adj)), tin(n), siz(n, 1), d(n), p(n) {
     vi order;
-    auto dfs = [&](auto&& self, int u) -> void {
+    auto dfs = [&](auto&& f, int u) -> void {
       tin[u] = sz(order), order.push_back(u);
       for (int v : adj[u])
         if (v != p[u])
-          d[v] = d[p[v] = u] + 1, self(self, v),
+          d[v] = d[p[v] = u] + 1, f(f, v),
           siz[u] += siz[v];
     };
     dfs(dfs, 0);
diff --git a/library/trees/linear_lca.hpp b/library/trees/linear_lca.hpp
@@ -13,13 +13,13 @@ struct linear_lca {
   linear_lca(const auto& adj):
     n(sz(adj)), d(n), in(n), asc(n), head(n + 1) {
     vector<pii> order;
-    auto dfs = [&](auto&& self, int u, int p) -> void {
+    auto dfs = [&](auto&& f, int u, int p) -> void {
       order.emplace_back(u, p);
       in[u] = sz(order);
       for (int v : adj[u])
         if (v != p) {
           d[v] = 1 + d[u];
-          self(self, v, u);
+          f(f, v, u);
           head[in[v]] = u;
           if (lsb(in[u]) < lsb(in[v])) in[u] = in[v];
         }
diff --git a/library/trees/shallowest_decomp_tree.hpp b/library/trees/shallowest_decomp_tree.hpp
@@ -9,11 +9,11 @@
 //! @space O(n)
 void shallowest(auto& adj, auto f) {
   vector<vi> order(bit_width(size(adj)));
-  auto dfs = [&](auto&& self, int u, int p) -> int {
+  auto dfs = [&](auto&& f, int u, int p) -> int {
     int once = 0, twice = 0;
     for (int v : adj[u])
       if (v != p) {
-        int dp = self(self, v, u);
+        int dp = f(f, v, u);
         twice |= once & dp, once |= dp;
       }
     auto dp = (once | (bit_ceil(twice + 1u) - 1)) + 1;
diff --git a/library/trees/tree_lift.hpp b/library/trees/tree_lift.hpp
@@ -11,12 +11,12 @@
 struct tree_lift {
   vi d, p, j;
   tree_lift(const auto& adj): d(sz(adj)), p(d), j(d) {
-    auto dfs = [&](auto&& self, int u) -> void {
+    auto dfs = [&](auto&& f, int u) -> void {
       int up =
         d[u] + d[j[j[u]]] == 2 * d[j[u]] ? j[j[u]] : u;
       for (int v : adj[u])
         if (v != p[u])
-          d[v] = d[p[v] = u] + 1, j[v] = up, self(self, v);
+          d[v] = d[p[v] = u] + 1, j[v] = up, f(f, v);
     };
     dfs(dfs, 0);
   }
diff --git a/library/trees/uncommon/ladder_decomposition.hpp b/library/trees/uncommon/ladder_decomposition.hpp
@@ -17,12 +17,12 @@ struct ladder {
   //! @space O(n log n) for jmp. Everything else is O(n)
   ladder(const auto& adj):
     n(sz(adj)), d(n), p(n), leaf(n), idx(n), lad(2 * n) {
-    auto dfs = [&](auto&& self, int u) -> void {
+    auto dfs = [&](auto&& f, int u) -> void {
       leaf[u] = u;
       for (int v : adj[u])
         if (v != p[u]) {
           d[v] = d[p[v] = u] + 1;
-          self(self, v);
+          f(f, v);
           if (d[leaf[u]] < d[leaf[v]]) leaf[u] = leaf[v];
         }
     };
diff --git a/library/trees/uncommon/linear_kth_par.hpp b/library/trees/uncommon/linear_kth_par.hpp
@@ -21,14 +21,14 @@ template<int KAPPA = 2> struct linear_kth_par {
       jmp[t] = st[max(0, s - KAPPA * (t & -t))];
       t++;
     };
-    auto dfs = [&](auto&& self, int u, int p) -> void {
+    auto dfs = [&](auto&& f, int u, int p) -> void {
       int& l = leaf[u] = st[d[u]] = u;
       pos[u] = t;
       calc(d[u]);
       for (int v : adj[u])
         if (v != p) {
           d[v] = 1 + d[u];
-          self(self, v, u);
+          f(f, v, u);
           if (d[l] < d[leaf[v]]) l = leaf[v];
           calc(d[u]);
         }
diff --git a/library/trees/uncommon/subtree_isomorphism.hpp b/library/trees/uncommon/subtree_isomorphism.hpp
@@ -12,10 +12,10 @@
 auto subtree_iso(const auto& adj) {
   vi iso_id(sz(adj), -1);
   map<vi, int> hashes;
-  auto dfs = [&](auto&& self, int u, int p) -> int {
+  auto dfs = [&](auto&& f, int u, int p) -> int {
     vi ch_ids;
     for (int v : adj[u])
-      if (v != p) ch_ids.push_back(self(self, v, u));
+      if (v != p) ch_ids.push_back(f(f, v, u));
     ranges::sort(ch_ids);
     return iso_id[u] =
              hashes.try_emplace(ch_ids, sz(hashes))

Original file line number	Diff line number	Diff line change
`@@ -43,11 +43,11 @@ struct hopcroft_karp {`
`43`	`43`	`}`
`44`	`44`	`}`
`45`	`45`	`if (!found) break;`
`46`		`- auto dfs = [&](auto&& self, int u) -> bool {`
	`46`	`+ auto dfs = [&](auto&& f, int u) -> bool {`
`47`	`47`	`for (int v : adj[u]) {`
`48`	`48`	`int w = to_l[v];`
`49`	`49`	`if (w == -1 \|\|`
`50`		`- (level[u] + 1 == level[w] && self(self, w))) {`
	`50`	`+ (level[u] + 1 == level[w] && f(f, w))) {`
`51`	`51`	`to_r[u] = v;`
`52`	`52`	`to_l[v] = u;`
`53`	`53`	`return 1;`