src/sage/sat: Update file-level doctest tag

Matthias Koeppe · Matthias Koeppe · commit e43e09ad70c8 · 2023-11-05T14:54:28.000-08:00
diff --git a/src/sage/sat/boolean_polynomials.py b/src/sage/sat/boolean_polynomials.py
@@ -1,4 +1,4 @@
-# sage.doctest: optional - sage.rings.polynomial.pbori
+# sage.doctest: needs sage.rings.polynomial.pbori
 """
 SAT Functions for Boolean Polynomials
 
diff --git a/src/sage/sat/converters/polybori.py b/src/sage/sat/converters/polybori.py
@@ -1,4 +1,4 @@
-# sage.doctest: optional - sage.rings.polynomial.pbori
+# sage.doctest: needs sage.rings.polynomial.pbori
 """
 An ANF to CNF Converter using a Dense/Sparse Strategy
 
diff --git a/src/sage/sat/solvers/sat_lp.py b/src/sage/sat/solvers/sat_lp.py
@@ -1,4 +1,4 @@
-# sage.doctest: optional - sage.numerical.mip
+# sage.doctest: needs sage.numerical.mip
 r"""
 Solve SAT problems Integer Linear Programming
 

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-# sage.doctest: optional - sage.rings.polynomial.pbori`
	`1`	`+# sage.doctest: needs sage.rings.polynomial.pbori`
`2`	`2`	`"""`
`3`	`3`	`SAT Functions for Boolean Polynomials`
`4`	`4`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-# sage.doctest: optional - sage.numerical.mip`
	`1`	`+# sage.doctest: needs sage.numerical.mip`
`2`	`2`	`r"""`
`3`	`3`	`Solve SAT problems Integer Linear Programming`
`4`	`4`