python-constraint2 2.7.0__tar.gz → 2.7.2b2__tar.gz

{python_constraint2-2.7.0 → python_constraint2-2.7.2b2}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: python-constraint2
-Version: 2.7.0
+Version: 2.7.2b2
 Summary: python-constraint is a module for efficiently solving CSPs (Constraint Solving Problems) over finite domains.
 License-Expression: BSD-2-Clause
 License-File: LICENSE

{python_constraint2-2.7.0 → python_constraint2-2.7.2b2}/cythonize_build.py

@@ -4,6 +4,7 @@ Based on https://blagovdaryu.hashnode.dev/tremendously-speed-up-python-code-with
 """
 
 import os
+import sys
 import shutil
 from subprocess import CalledProcessError
 from warnings import warn
@@ -15,10 +16,23 @@ from setuptools import Distribution, Extension
 module_name = "constraint"
 cython_modules = ["constraints", "domain", "problem", "solvers", "parser"]
 ext = "py"
-extensions = [
-    Extension(f"constraint.{module}", [f"constraint/{module}.{ext}"], extra_compile_args=["-O3"])
-    for module in cython_modules
-]
+macos_target = os.environ.get("MACOSX_DEPLOYMENT_TARGET")
+if sys.platform == "darwin" and macos_target is not None:
+    macos_flags = [f"-mmacosx-version-min={macos_target}"]
+    extensions = [
+        Extension(
+            f"constraint.{module}",
+            [f"constraint/{module}.{ext}"],
+            extra_compile_args=["-O3", *macos_flags],
+            extra_link_args=macos_flags,
+        )
+        for module in cython_modules
+    ]
+else:
+    extensions = [
+        Extension(f"constraint.{module}", [f"constraint/{module}.{ext}"], extra_compile_args=["-O3"])
+        for module in cython_modules
+    ]
 
 # Cythonize the files
 ext_modules = cythonize(extensions, include_path=[module_name], language_level=3, force=True)

{python_constraint2-2.7.0 → python_constraint2-2.7.2b2}/pyproject.toml

@@ -5,7 +5,7 @@ build-backend = "poetry.core.masonry.api"
 [project]
 name = "python-constraint2" # when set back to "python-constraint", don't forget to remove '2' in other places (e.g. README)
 description = "python-constraint is a module for efficiently solving CSPs (Constraint Solving Problems) over finite domains."
-version = "2.7.0" # adhere to PEP440 versioning: https://packaging.python.org/en/latest/guides/distributing-packages-using-setuptools/#id55
+version = "2.7.2b2" # adhere to PEP440 versioning: https://packaging.python.org/en/latest/guides/distributing-packages-using-setuptools/#id55
 authors = [
     {name = "Floris-Jan Willemsen", email = "fjwillemsen97@gmail.com"},
     {name = "Sébastien Celles", email = "s.celles@gmail.com"},
@@ -107,7 +107,7 @@ select = [
 convention = "google"
 
 [tool.pytest.ini_options]
-minversion = "9.1.1"
+minversion = "8.0.0"
 pythonpath = [
     "constraint",
 ] # necessary to get coverage reports without installing with `-e`

python_constraint2-2.7.2b2/tests/test_examples.py

@@ -0,0 +1,64 @@
+"""Tests for python-constraint example solvers."""
+
+from examples.crosswords import crosswords
+from examples.sudoku import sudoku
+from examples.wordmath import seisseisdoze, sendmoremoney, twotwofour
+from examples.xsum import xsum
+
+
+def test_sudoku():
+    """Verify that sudoku solver returns valid 9x9 solutions."""
+    solutions = sudoku.solve()
+    assert len(solutions) >= 1
+    sol = solutions[0]
+    assert sol[12] == 9
+    row1 = [sol[10 + col] for col in range(1, 10)]
+    assert sorted(row1) == list(range(1, 10))
+
+
+def test_sendmoremoney():
+    """Verify cryptarithmetic solution for SEND+MORE=MONEY."""
+    solutions = sendmoremoney.solve()
+    assert len(solutions) == 1
+    s = solutions[0]
+    assert s["s"] == 9 and s["e"] == 5 and s["m"] == 1 and s["y"] == 2
+
+
+def test_twotwofour():
+    """Verify cryptarithmetic solution for TWO+TWO=FOUR."""
+    solutions = twotwofour.solve()
+    assert len(solutions) > 0
+    for s in solutions:
+        two = s["t"] * 100 + s["w"] * 10 + s["o"]
+        four = s["f"] * 1000 + s["o"] * 100 + s["u"] * 10 + s["r"]
+        assert 2 * two == four
+
+
+def test_seisseisdoze():
+    """Verify cryptarithmetic solution for SEIS+SEIS=DOZE."""
+    solutions = seisseisdoze.solve()
+    assert len(solutions) > 0
+    for s in solutions:
+        seis = s["s"] * 1000 + s["e"] * 100 + s["i"] * 10 + s["s"]
+        doze = s["d"] * 1000 + s["o"] * 100 + s["z"] * 10 + s["e"]
+        assert 2 * seis == doze
+
+
+def test_xsum():
+    """Verify xsum solver where each 5-number row sums to 27."""
+    solutions = xsum.solve()
+    assert len(solutions) > 0
+    for s in solutions:
+        row1_sum = s["a"] + s["b"] + s["c"] + s["d"] + s["x"]
+        row2_sum = s["e"] + s["f"] + s["g"] + s["h"] + s["x"]
+        assert row1_sum == 27
+        assert row2_sum == 27
+
+
+def test_crosswords():
+    """Verify crossword puzzle solver execution with sample mask and word list."""
+    puzzle = "####\n####\n####\n####"
+    words = ["DATA", "CODE", "TEST", "MATH", "BYTE", "DISK", "FILE", "FLOW"]
+    solution, matrix = crosswords.solve(puzzle, words)
+    assert isinstance(matrix, list)
+