diff options
| author | Richard Qin <richard.qin.x@gmail.com> | 2026-04-07 03:59:58 +0800 |
|---|---|---|
| committer | Richard Qin <richard.qin.x@gmail.com> | 2026-04-07 03:59:58 +0800 |
| commit | 5ab3efd522cf0221481684b5bbc9c2ac6bfc9919 (patch) | |
| tree | 9c521dedd2bc49bdbac642a0640dd048b6d8e4a1 /include/atp/search/prover.h | |
| parent | bf4f464cec8b6515d9e5131d43847ef9b2fd21d1 (diff) | |
| download | ratp-5ab3efd522cf0221481684b5bbc9c2ac6bfc9919.tar.gz ratp-5ab3efd522cf0221481684b5bbc9c2ac6bfc9919.tar.xz | |
refactor: rename struct members to follow trailing underscore naming convention across core, search, and frontend components
Diffstat (limited to 'include/atp/search/prover.h')
| -rw-r--r-- | include/atp/search/prover.h | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/include/atp/search/prover.h b/include/atp/search/prover.h index 6ee22f0..c1246ae 100644 --- a/include/atp/search/prover.h +++ b/include/atp/search/prover.h @@ -46,10 +46,10 @@ enum class ProverResult : uint8_t { /// V1 configuration — simple and direct. /// Future: replaced by strategy::Calculus for dynamic rule loading. struct ProverConfig { - ClauseComparator comparator = bfsCompare; - size_t max_clauses = 100000; ///< Safety limit - size_t max_iterations = 500000; ///< Safety limit - bool enable_occurs_check = false; + ClauseComparator comparator_ = bfsCompare; + size_t max_clauses_ = 100000; ///< Safety limit + size_t max_iterations_ = 500000; ///< Safety limit + bool enable_occurs_check_ = false; }; /// Main prover class implementing the Given Clause Loop. |
