From 598f364de0a809747714294326a0193788e0bdfb Mon Sep 17 00:00:00 2001 From: Richard Qin Date: Tue, 7 Apr 2026 03:59:58 +0800 Subject: refactor: rename struct members to follow trailing underscore naming convention across core, search, and frontend components --- proofsearch/tests/test_end_to_end.cc | 11 ++++++----- 1 file changed, 6 insertions(+), 5 deletions(-) (limited to 'proofsearch/tests/test_end_to_end.cc') diff --git a/proofsearch/tests/test_end_to_end.cc b/proofsearch/tests/test_end_to_end.cc index d45a101..ceb9991 100644 --- a/proofsearch/tests/test_end_to_end.cc +++ b/proofsearch/tests/test_end_to_end.cc @@ -28,14 +28,15 @@ #include #include +#include namespace atp { namespace { /// Helper: parse a TPTP string and run the prover, return the result. struct E2EResult { - ProverResult result; - std::string proof_output; + ProverResult result_; + std::string proof_output_; }; E2EResult runProver(const std::string& tptp_input) { @@ -48,7 +49,7 @@ E2EResult runProver(const std::string& tptp_input) { Prover prover(bank, store); prover.addClauses(std::move(clauses)); - ProverResult result = prover.prove(); + ProverResult const result = prover.prove(); std::string proof_output; if (result == ProverResult::kTheorem) { @@ -140,10 +141,10 @@ TEST(EndToEnd, ProofOutputContainsAllSteps) { // Must contain [resolution] for derived clauses EXPECT_NE(proof.find("[resolution]"), std::string::npos) << proof; // Must contain empty clause marker - std::string empty_marker = "□"; + std::string const empty_marker = "□"; EXPECT_NE(proof.find(empty_marker), std::string::npos) << proof; // Must contain [X, Y] provenance (sequential numbers) - EXPECT_NE(proof.find("["), std::string::npos) << proof; + EXPECT_NE(proof.find('['), std::string::npos) << proof; } // ═══════════════════════════════════════════════════════════════════════════ -- cgit v1.2.3