revert deducing this in member-function lambdas (gcc 14/15 bug PR118291)

Author: Cameron Custer

tests/library_checker_aizu_tests/handmade_tests/functional_graph.test.cpp

@@ -63,33 +63,33 @@ struct functional_graph_processor {
         }
         cycle.push_back(c);
       }
-      auto dfs = [&](this auto &&self, int u2) -> void {
+      auto dfs = [&](auto self, int u2) -> void {
         if (was2[u2] == attempt) return;
         was2[u2] = attempt;
         int v2 = nxt[u2];
-        self(v2);
+        self(self, v2);
         root_of[u2] = root_of[v2];
         depth[u2] = depth[v2] + 1;
         abr[v2].push_back(u2);
       };
-      dfs(u);
+      dfs(dfs, u);
     }
     for (auto u = 0; u < n; ++u)
       if (~cycle_pos[u]) cycle_prev[nxt[u]] = u;
     for (const auto &c : cycle) {
-      auto dfs = [&](this auto &&self, int u) -> void {
+      auto dfs = [&](auto self, int u) -> void {
         size[u] = 1;
         pos[u] = sz(order);
         order.push_back(u);
         for (auto v : abr[u]) {
-          self(v);
+          self(self, v);
           size[u] += size[v];
         }
         end[u] = sz(order);
       };
       int csize = 0;
       for (auto u : c) {
-        dfs(u);
+        dfs(dfs, u);
         csize += size[u];
       }
       for (auto u : c)

tests/library_checker_aizu_tests/trees/edge_cd_contour_range_query.test.cpp

@@ -14,12 +14,12 @@ struct sum_adj {
   //! stack for dfs is O(n)
   sum_adj(const vector<vi>& adj, const vector<ll>& sum):
     n(sz(sum)), sum(sum), sum_ch(n), p(n, -1) {
-    auto dfs = [&](this auto&& self, int u) -> void {
+    auto dfs = [&](auto&& self, int u) -> void {
       for (int c : adj[u])
         if (c != p[u])
-          p[c] = u, sum_ch[u] += sum[c], self(c);
+          p[c] = u, sum_ch[u] += sum[c], self(self, c);
     };
-    dfs(0);
+    dfs(dfs, 0);
   }
   //! @param u node
   //! @param delta number to add
@@ -50,17 +50,17 @@ struct contour_range_query {
     n(sz(a)), sum_a(adj, a), info(n) {
     edge_cd(adj, [&](int cent, int split) {
       vector<vector<ll>> sum_num(2, vector<ll>(1));
-      auto dfs = [&](this auto&& self, int u, int p, int d,
+      auto dfs = [&](auto&& self, int u, int p, int d,
                    int side) -> void {
         info[u].push_back({int(sz(bits)), d, side});
         if (sz(sum_num[side]) == d)
           sum_num[side].push_back(0);
         sum_num[side][d] += a[u];
         for (int c : adj[u])
-          if (c != p) self(c, u, 1 + d, side);
+          if (c != p) self(self, c, u, 1 + d, side);
       };
       rep(i, 0, sz(adj[cent]))
-        dfs(adj[cent][i], cent, 1, i < split);
+        dfs(dfs, adj[cent][i], cent, 1, i < split);
       bits.push_back({BIT(sum_num[0]), BIT(sum_num[1])});
     });
   }

tests/library_checker_aizu_tests/trees/edge_cd_contour_range_update.test.cpp

@@ -14,12 +14,12 @@ struct sum_adj {
   //! stack for dfs is O(n)
   sum_adj(const vector<vi>& adj, const vector<ll>& sum):
     n(sz(sum)), sum(sum), sum_ch(n), p(n, -1) {
-    auto dfs = [&](this auto&& self, int u) -> void {
+    auto dfs = [&](auto&& self, int u) -> void {
       for (int c : adj[u])
         if (c != p[u])
-          p[c] = u, sum_ch[u] += sum[c], self(c);
+          p[c] = u, sum_ch[u] += sum[c], self(self, c);
     };
-    dfs(0);
+    dfs(dfs, 0);
   }
   //! @param u node
   //! @param delta number to add
@@ -53,15 +53,15 @@ struct contour_range_update {
     n(sz(a)), a(a), sum_a(adj, vector<ll>(n)), info(n) {
     edge_cd(adj, [&](int cent, int split) {
       array<int, 2> mx_d = {0, 0};
-      auto dfs = [&](this auto&& self, int u, int p, int d,
+      auto dfs = [&](auto&& self, int u, int p, int d,
                    int side) -> void {
         mx_d[side] = max(mx_d[side], d);
         info[u].push_back({int(sz(bits)), d, side});
         for (int v : adj[u])
-          if (v != p) self(v, u, 1 + d, side);
+          if (v != p) self(self, v, u, 1 + d, side);
       };
       rep(i, 0, sz(adj[cent]))
-        dfs(adj[cent][i], cent, 1, i < split);
+        dfs(dfs, adj[cent][i], cent, 1, i < split);
       bits.push_back(
         {bit_rupq(mx_d[0] + 1), bit_rupq(mx_d[1] + 1)});
     });