From 5ab3efd522cf0221481684b5bbc9c2ac6bfc9919 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 --- include/atp/core/clause.h | 16 ++++++++-------- 1 file changed, 8 insertions(+), 8 deletions(-) (limited to 'include/atp/core/clause.h') diff --git a/include/atp/core/clause.h b/include/atp/core/clause.h index 7e0cbff..6387adf 100644 --- a/include/atp/core/clause.h +++ b/include/atp/core/clause.h @@ -33,20 +33,20 @@ namespace atp { /// A clause: a disjunction of literals plus provenance for proof reconstruction. struct Clause { - ClauseId id = kInvalidId; - std::vector literals; + ClauseId id_ = kInvalidId; + std::vector literals_; // Provenance (for proof trace) - InferenceRule rule = InferenceRule::kInput; - ClauseId parent1 = kInvalidId; - ClauseId parent2 = kInvalidId; - uint16_t depth = 0; ///< Derivation depth (for BFS scheduling) + InferenceRule rule_ = InferenceRule::kInput; + ClauseId parent1_ = kInvalidId; + ClauseId parent2_ = kInvalidId; + uint16_t depth_ = 0; ///< Derivation depth (for BFS scheduling) /// True if the clause has no literals (contradiction). - [[nodiscard]] bool isEmpty() const { return literals.empty(); } + [[nodiscard]] bool isEmpty() const { return literals_.empty(); } /// Number of literals. - [[nodiscard]] size_t size() const { return literals.size(); } + [[nodiscard]] size_t size() const { return literals_.size(); } }; } // namespace atp -- cgit v1.2.3