docs: fixed comments

chrjabs · Jun 26, 2024 · a0e84a1 · a0e84a1
1 parent 4acddcd
commit a0e84a1
Show file tree

Hide file tree

Showing 4 changed files with 3 additions and 7 deletions.
diff --git a/batsat/Cargo.toml b/batsat/Cargo.toml
@@ -15,7 +15,7 @@ readme = "README.md"
 debug = []
 
 [dependencies]
-batsat = "0.5.0"
+batsat = "0.5.0" # when changing this version, do not forget to update signature
 rustsat = { version = "0.4.3", path = "../rustsat", default-features = false, features = [
 ] }
 anyhow = { version = "1.0.80" }

diff --git a/batsat/src/lib.rs b/batsat/src/lib.rs
@@ -1,7 +1,6 @@
 //! # BatSat Solver Interface
 //!
-//! Interface to the [Minisat](https://github.com/c-cube/batsat) incremental
-//! SAT solver.
+//! Interface to the [BatSat](https://github.com/c-cube/batsat) incremental SAT-Solver
 
 use batsat::{intmap::AsIndex, lbool, BasicSolver, SolverInterface};
 use rustsat::{

diff --git a/batsat/tests/incremental.rs b/batsat/tests/incremental.rs
@@ -84,6 +84,3 @@ fn assumption_sequence() {
     let solver = BatsatBasicSolver::default();
     test_assumption_sequence(solver);
 }
-
-// Note: Cannot test prepro version of minisat with this small example because
-// the variable are eliminated by preprocessing
diff --git a/batsat/tests/small.rs b/batsat/tests/small.rs
@@ -24,7 +24,7 @@ fn simp_small_sat() {
     assert_eq!(res, SolverResult::Sat);
 }
 
-// Note: this instance seems too hard for minisat to solve
+// Note: this instance seems too hard for batsat to solve
 #[test]
 #[ignore]
 fn simp_small_unsat() {