From 440b31b084a15424f09a58e255b613ba5cce42ef Mon Sep 17 00:00:00 2001 From: Cameron Custer Date: Mon, 6 Jul 2026 09:57:36 -0700 Subject: [PATCH 1/3] pass recursive lambda self param by reference --- .../convolution/min_plus_convolution_convex_and_arbitrary.hpp | 2 +- library/graphs/bcc_callback.hpp | 2 +- library/graphs/euler_path.hpp | 2 +- library/graphs/scc.hpp | 2 +- .../add_edges_strongly_connected.hpp | 2 +- .../strongly_connected_components/offline_incremental_scc.hpp | 2 +- library/graphs/uncommon/bridges.hpp | 2 +- library/graphs/uncommon/cuts.hpp | 2 +- library/trees/centroid_decomp.hpp | 4 ++-- library/trees/edge_cd.hpp | 4 ++-- library/trees/lca_rmq.hpp | 2 +- library/trees/linear_lca.hpp | 2 +- library/trees/shallowest_decomp_tree.hpp | 2 +- library/trees/tree_lift.hpp | 2 +- library/trees/uncommon/hagerup_kth_par.hpp | 2 +- library/trees/uncommon/ladder_decomposition.hpp | 2 +- library/trees/uncommon/linear_kth_par.hpp | 2 +- library/trees/uncommon/subtree_isomorphism.hpp | 2 +- 18 files changed, 20 insertions(+), 20 deletions(-) diff --git a/library/convolution/min_plus_convolution_convex_and_arbitrary.hpp b/library/convolution/min_plus_convolution_convex_and_arbitrary.hpp index 9253c93c..496f8c39 100644 --- 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 dnc, int res_le, int res_ri, + auto dnc = [&](auto&& dnc, int res_le, int res_ri, int arb_le, int arb_ri) { if (res_le >= res_ri) return; int mid_res = (res_le + res_ri) / 2; diff --git a/library/graphs/bcc_callback.hpp b/library/graphs/bcc_callback.hpp index f2646f77..268bdd80 100644 --- a/library/graphs/bcc_callback.hpp +++ b/library/graphs/bcc_callback.hpp @@ -44,7 +44,7 @@ void bcc(const auto& g, auto f) { int n = sz(g), q = 0, s = 0; vi t(n), st(n); - auto dfs = [&](auto dfs, int u) -> int { + auto dfs = [&](auto&& dfs, int u) -> int { int l = t[u] = ++q; for (int v : g[u]) { int siz = s, lu = 0; diff --git a/library/graphs/euler_path.hpp b/library/graphs/euler_path.hpp index 127e192e..e0ab350f 100644 --- a/library/graphs/euler_path.hpp +++ b/library/graphs/euler_path.hpp @@ -16,7 +16,7 @@ vector euler_path(auto& g, int m, int s) { vi vis(m); vector path; - auto dfs = [&](auto dfs, int u, int eu) -> void { + auto dfs = [&](auto&& dfs, int u, int eu) -> void { while (!empty(g[u])) { auto [v, ev] = g[u].back(); g[u].pop_back(); diff --git a/library/graphs/scc.hpp b/library/graphs/scc.hpp index f2bdc878..fc2673cf 100644 --- a/library/graphs/scc.hpp +++ b/library/graphs/scc.hpp @@ -11,7 +11,7 @@ auto scc(const auto& g) { int n = sz(g), num_sccs = 0, q = 0, s = 0; vi scc_id(n, -1), tin(n), st(n); - auto dfs = [&](auto dfs, int u) -> int { + auto dfs = [&](auto&& dfs, int u) -> int { int low = tin[u] = ++q; st[s++] = u; for (int v : g[u]) diff --git a/library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp b/library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp index e838ff4f..01dc54b6 100644 --- a/library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp +++ b/library/graphs/strongly_connected_components/add_edges_strongly_connected.hpp @@ -29,7 +29,7 @@ vector extra_edges(const auto& g, int num_sccs, zero_in[scc_id[v]] = 0; } vector vis(num_sccs); - auto dfs = [&](auto dfs, int u) { + auto dfs = [&](auto&& dfs, int u) { if (empty(scc_g[u])) return u; for (int v : scc_g[u]) if (!vis[v]) { diff --git a/library/graphs/strongly_connected_components/offline_incremental_scc.hpp b/library/graphs/strongly_connected_components/offline_incremental_scc.hpp index 9d9514e7..ae03effe 100644 --- a/library/graphs/strongly_connected_components/offline_incremental_scc.hpp +++ b/library/graphs/strongly_connected_components/offline_incremental_scc.hpp @@ -16,7 +16,7 @@ vi offline_incremental_scc(vector> eds, vi ids(n, -1), joins(m, m), idx(m), vs(n), scc_id; iota(all(idx), 0); vector g; - auto dnc = [&](auto dnc, auto el, auto er, int tl, + auto dnc = [&](auto&& dnc, auto el, auto er, int tl, int tr) { g.clear(); int mid = midpoint(tl, tr); diff --git a/library/graphs/uncommon/bridges.hpp b/library/graphs/uncommon/bridges.hpp index 050ebe33..01d5f786 100644 --- a/library/graphs/uncommon/bridges.hpp +++ b/library/graphs/uncommon/bridges.hpp @@ -18,7 +18,7 @@ auto bridges(const auto& g, int m) { int n = sz(g), num_ccs = 0, q = 0, s = 0; vi br_id(n, -1), is_br(m), tin(n), st(n); - auto dfs = [&](auto dfs, int u, int p) -> int { + auto dfs = [&](auto&& dfs, int u, int p) -> int { int low = tin[u] = ++q; st[s++] = u; for (auto [v, e] : g[u]) diff --git a/library/graphs/uncommon/cuts.hpp b/library/graphs/uncommon/cuts.hpp index 03cb3889..8986ae2b 100644 --- a/library/graphs/uncommon/cuts.hpp +++ b/library/graphs/uncommon/cuts.hpp @@ -19,7 +19,7 @@ auto cuts(const auto& g, int m) { int n = sz(g), num_bccs = 0, q = 0, s = 0; vi bcc_id(m, -1), is_cut(n), tin(n), st(m); - auto dfs = [&](auto dfs, int u, int p) -> int { + auto dfs = [&](auto&& dfs, int u, int p) -> int { int low = tin[u] = ++q; for (auto [v, e] : g[u]) { assert(u != v); diff --git a/library/trees/centroid_decomp.hpp b/library/trees/centroid_decomp.hpp index a347b6bc..8918fe40 100644 --- a/library/trees/centroid_decomp.hpp +++ b/library/trees/centroid_decomp.hpp @@ -8,7 +8,7 @@ //! @space O(n) vi cd(auto& g, auto f) { vi p(sz(g), -1), s(sz(g), sz(g)); - auto ctd = [&](auto ctd, int u, int p, int n) -> int { + auto ctd = [&](auto&& ctd, int u, int p, int n) -> int { s[u] = 1; for (int v : g[u]) if (v != p) { @@ -17,7 +17,7 @@ vi cd(auto& g, auto f) { } return 2 * s[u] >= n ? s[p] = n - s[u], u : -1; }; - auto dfs = [&](auto dfs, int u) -> int { + auto dfs = [&](auto&& dfs, int u) -> int { f(u = ctd(ctd, u, u, s[u])); for (int v : g[u]) erase(g[v], u), p[dfs(dfs, v)] = u; return u; diff --git a/library/trees/edge_cd.hpp b/library/trees/edge_cd.hpp index 6ab3679b..b7ed52c8 100644 --- a/library/trees/edge_cd.hpp +++ b/library/trees/edge_cd.hpp @@ -15,7 +15,7 @@ //! @space O(n) template void edge_cd(vector& g, auto f) { vi s(sz(g)); - auto ctd = [&](auto ctd, int u, int p, int m) -> int { + auto ctd = [&](auto&& ctd, int u, int p, int m) -> int { s[u] = 1; for (int v : g[u]) if (v != p) { @@ -24,7 +24,7 @@ template void edge_cd(vector& g, auto f) { } return 2 * s[u] > m ? s[p] = m + 1 - s[u], u : -1; }; - auto dfs = [&](auto dfs, int u, int m) { + auto dfs = [&](auto&& dfs, int u, int m) { if (m < 2) return; u = ctd(ctd, u, u, m); int sum = 0; diff --git a/library/trees/lca_rmq.hpp b/library/trees/lca_rmq.hpp index ea3bc660..1b87f7ef 100644 --- a/library/trees/lca_rmq.hpp +++ b/library/trees/lca_rmq.hpp @@ -16,7 +16,7 @@ struct LCA { LCA(const auto& g): n(sz(g)), tin(n), siz(n, 1), d(n), p(n) { vi order; - auto dfs = [&](auto dfs, int u) -> void { + auto dfs = [&](auto&& dfs, int u) -> void { tin[u] = sz(order), order.push_back(u); for (int v : g[u]) if (v != p[u]) diff --git a/library/trees/linear_lca.hpp b/library/trees/linear_lca.hpp index 8ea6b5f8..9fa513ca 100644 --- a/library/trees/linear_lca.hpp +++ b/library/trees/linear_lca.hpp @@ -13,7 +13,7 @@ struct linear_lca { linear_lca(const auto& g): n(sz(g)), d(n), in(n), asc(n), head(n + 1) { vector order; - auto dfs = [&](auto dfs, int u, int p) -> void { + auto dfs = [&](auto&& dfs, int u, int p) -> void { order.emplace_back(u, p), in[u] = sz(order); for (int v : g[u]) if (v != p) { diff --git a/library/trees/shallowest_decomp_tree.hpp b/library/trees/shallowest_decomp_tree.hpp index 6cd0f46d..bb35d2c0 100644 --- a/library/trees/shallowest_decomp_tree.hpp +++ b/library/trees/shallowest_decomp_tree.hpp @@ -9,7 +9,7 @@ //! @space O(n) void shallowest(auto& g, auto f) { vector order(bit_width(size(g))); - auto dfs = [&](auto dfs, int u, int p) -> int { + auto dfs = [&](auto&& dfs, int u, int p) -> int { int once = 0, twice = 0; for (int v : g[u]) if (v != p) { diff --git a/library/trees/tree_lift.hpp b/library/trees/tree_lift.hpp index 834cfd9b..f2283f09 100644 --- a/library/trees/tree_lift.hpp +++ b/library/trees/tree_lift.hpp @@ -11,7 +11,7 @@ struct tree_lift { vi d, p, j; tree_lift(const auto& g): d(sz(g)), p(d), j(d) { - auto dfs = [&](auto dfs, int u) -> void { + auto dfs = [&](auto&& dfs, int u) -> void { int up = d[u] + d[j[j[u]]] == 2 * d[j[u]] ? j[j[u]] : u; for (int v : g[u]) diff --git a/library/trees/uncommon/hagerup_kth_par.hpp b/library/trees/uncommon/hagerup_kth_par.hpp index 0bc15f7e..63648298 100644 --- a/library/trees/uncommon/hagerup_kth_par.hpp +++ b/library/trees/uncommon/hagerup_kth_par.hpp @@ -21,7 +21,7 @@ template struct hagerup { jmp[t] = st[max(0, s - K * (t & -t))]; t++; }; - auto dfs = [&](auto dfs, int u, int p) -> void { + auto dfs = [&](auto&& dfs, int u, int p) -> void { int& l = leaf[u] = st[d[u]] = u; pos[u] = t; calc(d[u]); diff --git a/library/trees/uncommon/ladder_decomposition.hpp b/library/trees/uncommon/ladder_decomposition.hpp index 1f0adca3..ae1435b4 100644 --- a/library/trees/uncommon/ladder_decomposition.hpp +++ b/library/trees/uncommon/ladder_decomposition.hpp @@ -20,7 +20,7 @@ struct ladder { n(sz(g)), d(n), p(n), idx(n), lad(2 * n) { int i = 0; vi st(n); - auto dfs = [&](auto dfs, int u) -> vi { + auto dfs = [&](auto&& dfs, int u) -> vi { vi path; st[d[u]] = u; for (int v : g[u]) diff --git a/library/trees/uncommon/linear_kth_par.hpp b/library/trees/uncommon/linear_kth_par.hpp index 747d25ac..5ca8eaba 100644 --- a/library/trees/uncommon/linear_kth_par.hpp +++ b/library/trees/uncommon/linear_kth_par.hpp @@ -23,7 +23,7 @@ struct linear_kth_par { jmp[t] += st[du - k]; d_tour[t++] = du; }; - auto dfs = [&](auto dfs, int u, int p) -> vi { + auto dfs = [&](auto&& dfs, int u, int p) -> vi { vi path; tin[st[d[u]] = u] = t; calc(d[u]); diff --git a/library/trees/uncommon/subtree_isomorphism.hpp b/library/trees/uncommon/subtree_isomorphism.hpp index 2c81cd50..708941d8 100644 --- a/library/trees/uncommon/subtree_isomorphism.hpp +++ b/library/trees/uncommon/subtree_isomorphism.hpp @@ -12,7 +12,7 @@ auto subtree_iso(const auto& g) { vi iso_id(sz(g), -1); map hashes; - auto dfs = [&](auto dfs, int u, int p) -> int { + auto dfs = [&](auto&& dfs, int u, int p) -> int { vi ch_ids; for (int v : g[u]) if (v != p) ch_ids.push_back(dfs(dfs, v, u)); From 67b8d16e39e4d121860fe2b60b258f4afe124ae5 Mon Sep 17 00:00:00 2001 From: GitHub Date: Mon, 6 Jul 2026 17:38:35 +0000 Subject: [PATCH 2/3] [auto-verifier] verify commit 440b31b084a15424f09a58e255b613ba5cce42ef --- .verify-helper/timestamps.remote.json | 60 +++++++++++++-------------- 1 file changed, 30 insertions(+), 30 deletions(-) diff --git a/.verify-helper/timestamps.remote.json b/.verify-helper/timestamps.remote.json index 07d0e076..bf457383 100644 --- a/.verify-helper/timestamps.remote.json +++ b/.verify-helper/timestamps.remote.json @@ -1,7 +1,7 @@ { "tests/library_checker_aizu_tests/convolution/gcd_convolution.test.cpp": "2025-08-28 13:19:16 -0600", "tests/library_checker_aizu_tests/convolution/lcm_convolution.test.cpp": "2025-08-28 13:19:16 -0600", -"tests/library_checker_aizu_tests/convolution/min_plus_convolution.test.cpp": "2026-04-12 16:21:27 -0600", +"tests/library_checker_aizu_tests/convolution/min_plus_convolution.test.cpp": "2026-07-06 09:57:36 -0700", "tests/library_checker_aizu_tests/convolution/xor_convolution.test.cpp": "2026-03-06 12:17:28 -0700", "tests/library_checker_aizu_tests/data_structures/binary_search_example.test.cpp": "2024-11-18 10:51:39 -0600", "tests/library_checker_aizu_tests/data_structures/binary_trie.test.cpp": "2026-01-18 02:20:40 +0000", @@ -55,33 +55,33 @@ "tests/library_checker_aizu_tests/dsu/range_parallel_dsu.test.cpp": "2026-04-26 11:38:07 -0600", "tests/library_checker_aizu_tests/flow/hungarian.test.cpp": "2024-11-17 14:04:03 -0600", "tests/library_checker_aizu_tests/flow/min_cost_max_flow.test.cpp": "2026-04-06 14:41:55 -0600", -"tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_bcc.test.cpp": "2026-04-12 16:21:27 -0600", -"tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_two_edge_cc.test.cpp": "2026-04-12 16:21:27 -0600", -"tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_bcc.test.cpp": "2026-04-12 16:21:27 -0600", -"tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_two_cc.test.cpp": "2026-04-12 16:21:27 -0600", -"tests/library_checker_aizu_tests/graphs/biconnected_components.test.cpp": "2026-04-26 11:38:07 -0600", +"tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_bcc.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/graphs/bcc_callback_aizu_two_edge_cc.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_bcc.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_two_cc.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/graphs/biconnected_components.test.cpp": "2026-07-06 09:57:36 -0700", "tests/library_checker_aizu_tests/graphs/connected_components_of_complement_graph.test.cpp": "2026-04-06 14:41:55 -0600", "tests/library_checker_aizu_tests/graphs/dijkstra_aizu.test.cpp": "2026-04-06 14:41:55 -0600", "tests/library_checker_aizu_tests/graphs/dijkstra_lib_checker.test.cpp": "2026-04-26 11:38:07 -0600", -"tests/library_checker_aizu_tests/graphs/directed_cycle.test.cpp": "2026-04-12 16:21:27 -0600", +"tests/library_checker_aizu_tests/graphs/directed_cycle.test.cpp": "2026-07-06 09:57:36 -0700", "tests/library_checker_aizu_tests/graphs/enumerate_triangles.test.cpp": "2026-04-26 11:38:07 -0600", -"tests/library_checker_aizu_tests/graphs/euler_walk_directed.test.cpp": "2026-04-12 16:21:27 -0600", -"tests/library_checker_aizu_tests/graphs/euler_walk_undirected.test.cpp": "2026-04-12 16:21:27 -0600", +"tests/library_checker_aizu_tests/graphs/euler_walk_directed.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/graphs/euler_walk_undirected.test.cpp": "2026-07-06 09:57:36 -0700", "tests/library_checker_aizu_tests/graphs/hopcroft_karp_aizu.test.cpp": "2026-05-01 11:34:51 -0600", "tests/library_checker_aizu_tests/graphs/hopcroft_karp_lib_checker.test.cpp": "2026-05-01 11:34:51 -0600", "tests/library_checker_aizu_tests/graphs/mst.test.cpp": "2026-01-22 10:08:22 -0700", -"tests/library_checker_aizu_tests/graphs/offline_incremental_scc.test.cpp": "2026-04-12 16:21:27 -0600", -"tests/library_checker_aizu_tests/graphs/strongly_connected_components_aizu.test.cpp": "2026-04-12 16:21:27 -0600", -"tests/library_checker_aizu_tests/graphs/strongly_connected_components_lib_checker.test.cpp": "2026-04-12 16:21:27 -0600", -"tests/library_checker_aizu_tests/graphs/two_edge_components.test.cpp": "2026-04-12 16:21:27 -0600", -"tests/library_checker_aizu_tests/handmade_tests/count_paths.test.cpp": "2026-04-27 08:17:20 -0600", +"tests/library_checker_aizu_tests/graphs/offline_incremental_scc.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/graphs/strongly_connected_components_aizu.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/graphs/strongly_connected_components_lib_checker.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/graphs/two_edge_components.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/handmade_tests/count_paths.test.cpp": "2026-07-06 09:57:36 -0700", "tests/library_checker_aizu_tests/handmade_tests/dsu.test.cpp": "2026-01-22 10:08:22 -0700", -"tests/library_checker_aizu_tests/handmade_tests/edge_cd_small_trees.test.cpp": "2026-04-27 08:17:20 -0600", +"tests/library_checker_aizu_tests/handmade_tests/edge_cd_small_trees.test.cpp": "2026-07-06 09:57:36 -0700", "tests/library_checker_aizu_tests/handmade_tests/fib_matrix_expo.test.cpp": "2026-01-28 21:48:16 -0700", "tests/library_checker_aizu_tests/handmade_tests/functional_graph.test.cpp": "2026-04-26 11:38:07 -0600", "tests/library_checker_aizu_tests/handmade_tests/hilbert_mos.test.cpp": "2026-01-18 02:20:40 +0000", "tests/library_checker_aizu_tests/handmade_tests/kd_bit.test.cpp": "2026-02-19 18:06:52 -0700", -"tests/library_checker_aizu_tests/handmade_tests/kth_par.test.cpp": "2026-06-27 18:29:52 -0500", +"tests/library_checker_aizu_tests/handmade_tests/kth_par.test.cpp": "2026-07-06 09:57:36 -0700", "tests/library_checker_aizu_tests/handmade_tests/manacher.test.cpp": "2026-04-26 11:38:07 -0600", "tests/library_checker_aizu_tests/handmade_tests/merge_st_and_wavelet.test.cpp": "2026-04-26 11:38:07 -0600", "tests/library_checker_aizu_tests/handmade_tests/mobius.test.cpp": "2025-02-10 14:50:36 -0700", @@ -132,23 +132,23 @@ "tests/library_checker_aizu_tests/strings/suffix_array_short.test.cpp": "2026-04-12 06:15:25 -0600", "tests/library_checker_aizu_tests/strings/trie.test.cpp": "2026-01-17 12:38:18 -0700", "tests/library_checker_aizu_tests/strings/wildcard_pattern_matching.test.cpp": "2026-04-26 11:38:07 -0600", -"tests/library_checker_aizu_tests/trees/cd_count_paths_per_length.test.cpp": "2026-04-26 21:56:36 -0600", -"tests/library_checker_aizu_tests/trees/edge_cd_contour_range_query.test.cpp": "2026-04-27 08:17:20 -0600", -"tests/library_checker_aizu_tests/trees/edge_cd_contour_range_update.test.cpp": "2026-04-27 08:17:20 -0600", -"tests/library_checker_aizu_tests/trees/edge_cd_count_paths_per_length.test.cpp": "2026-04-27 08:17:20 -0600", -"tests/library_checker_aizu_tests/trees/edge_cd_reroot_dp.test.cpp": "2026-04-27 08:17:20 -0600", +"tests/library_checker_aizu_tests/trees/cd_count_paths_per_length.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/trees/edge_cd_contour_range_query.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/trees/edge_cd_contour_range_update.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/trees/edge_cd_count_paths_per_length.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/trees/edge_cd_reroot_dp.test.cpp": "2026-07-06 09:57:36 -0700", "tests/library_checker_aizu_tests/trees/hld_aizu1.test.cpp": "2026-04-12 16:21:27 -0600", "tests/library_checker_aizu_tests/trees/hld_aizu2.test.cpp": "2026-04-26 11:38:07 -0600", "tests/library_checker_aizu_tests/trees/hld_lib_checker_path.test.cpp": "2026-04-12 16:21:27 -0600", "tests/library_checker_aizu_tests/trees/hld_lib_checker_subtree_edges.test.cpp": "2026-04-12 16:21:27 -0600", "tests/library_checker_aizu_tests/trees/hld_lib_checker_subtree_nodes.test.cpp": "2026-04-12 16:21:27 -0600", -"tests/library_checker_aizu_tests/trees/kth_path_hagerup.test.cpp": "2026-06-27 13:02:40 -0500", -"tests/library_checker_aizu_tests/trees/kth_path_ladder.test.cpp": "2026-06-27 13:02:40 -0500", -"tests/library_checker_aizu_tests/trees/kth_path_linear.test.cpp": "2026-06-27 18:29:52 -0500", -"tests/library_checker_aizu_tests/trees/kth_path_tree_lift.test.cpp": "2026-04-26 11:38:07 -0600", -"tests/library_checker_aizu_tests/trees/lca_all_methods_aizu.test.cpp": "2026-04-26 11:38:07 -0600", -"tests/library_checker_aizu_tests/trees/lca_all_methods_lib_checker.test.cpp": "2026-04-26 11:38:07 -0600", -"tests/library_checker_aizu_tests/trees/shallowest_aizu_tree_height.test.cpp": "2026-04-12 16:21:27 -0600", -"tests/library_checker_aizu_tests/trees/shallowest_lib_checker_tree_path_composite.test.cpp": "2026-04-26 11:38:07 -0600", -"tests/library_checker_aizu_tests/trees/subtree_isomorphism.test.cpp": "2026-04-12 16:21:27 -0600" +"tests/library_checker_aizu_tests/trees/kth_path_hagerup.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/trees/kth_path_ladder.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/trees/kth_path_linear.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/trees/kth_path_tree_lift.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/trees/lca_all_methods_aizu.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/trees/lca_all_methods_lib_checker.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/trees/shallowest_aizu_tree_height.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/trees/shallowest_lib_checker_tree_path_composite.test.cpp": "2026-07-06 09:57:36 -0700", +"tests/library_checker_aizu_tests/trees/subtree_isomorphism.test.cpp": "2026-07-06 09:57:36 -0700" } \ No newline at end of file From 0fcf5c87d7a30d6b39ae15a4cc545c6e595cabe0 Mon Sep 17 00:00:00 2001 From: Cameron Custer Date: Mon, 6 Jul 2026 10:50:24 -0700 Subject: [PATCH 3/3] fix stale cppcheck suppression line number --- tests/.config/.cppcheck_suppression_list | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/tests/.config/.cppcheck_suppression_list b/tests/.config/.cppcheck_suppression_list index 4cdfb366..36bc93c6 100644 --- a/tests/.config/.cppcheck_suppression_list +++ b/tests/.config/.cppcheck_suppression_list @@ -60,5 +60,5 @@ unusedFunction:../kactl/content/data-structures/UnionFind.h:14 unusedFunction:../kactl/content/number-theory/ModPow.h:13 unusedFunction:../kactl/stress-tests/utilities/genTree.h:49 containerOutOfBounds:../library/data_structures_[l,r)/uncommon/permutation_tree.hpp:85 -ctuOneDefinitionRuleViolation:../library/data_structures_[l,r)/bit.hpp:14 +ctuOneDefinitionRuleViolation:../library/data_structures_[l,r)/bit.hpp ctuOneDefinitionRuleViolation:../library/data_structures_[l,r)/lazy_seg_tree.hpp:4