aboutsummaryrefslogtreecommitdiff
path: root/proofsearch/include/atp/core/clause.h
diff options
context:
space:
mode:
authorRichard Qin <richard.qin.x@gmail.com>2026-04-07 03:59:58 +0800
committerRichard Qin <richard.qin.x@gmail.com>2026-04-07 03:59:58 +0800
commit598f364de0a809747714294326a0193788e0bdfb (patch)
tree1ab77a340ab0930b41ffc6291d06b12d1b302a88 /proofsearch/include/atp/core/clause.h
parent593a94a3c13aff82b31fd6c61e0ae07b97a2e426 (diff)
downloadrcc-project-598f364de0a809747714294326a0193788e0bdfb.tar.gz
rcc-project-598f364de0a809747714294326a0193788e0bdfb.tar.xz
refactor: rename struct members to follow trailing underscore naming convention across core, search, and frontend components
Diffstat (limited to 'proofsearch/include/atp/core/clause.h')
-rw-r--r--proofsearch/include/atp/core/clause.h16
1 files changed, 8 insertions, 8 deletions
diff --git a/proofsearch/include/atp/core/clause.h b/proofsearch/include/atp/core/clause.h
index 7e0cbff..6387adf 100644
--- a/proofsearch/include/atp/core/clause.h
+++ b/proofsearch/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<Literal> literals;
+ ClauseId id_ = kInvalidId;
+ std::vector<Literal> 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