python-constraint2 2.0.2__tar.gz → 2.1.0__tar.gz

{python_constraint2-2.0.2 → python_constraint2-2.1.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.3
 Name: python-constraint2
-Version: 2.0.2
+Version: 2.1.0
 Summary: python-constraint is a module for efficiently solving CSPs (Constraint Solving Problems) over finite domains.
 License: BSD-2-Clause
 Keywords: CSP,constraint solving problems,problem solver,SMT,satisfiability modulo theory,SAT
@@ -8,7 +8,7 @@ Author: Gustavo Niemeyer
 Author-email: gustavo@niemeyer.net
 Maintainer: Floris-Jan Willemsen
 Maintainer-email: fjwillemsen97@gmail.com
-Requires-Python: >=3.9,<3.14
+Requires-Python: >=3.9,<3.15
 Classifier: Development Status :: 4 - Beta
 Classifier: Environment :: Console
 Classifier: Intended Audience :: Developers
@@ -44,6 +44,11 @@ python-constraint
 | For an overview of recent changes, visit the `Changelog <https://github.com/python-constraint/python-constraint/blob/main/CHANGELOG.md>`_.
 | The complete documentation can be found `here <http://python-constraint.github.io/python-constraint/>`_.
 
+| New: writing constraints in the new string format is preferable over functions and lambdas. 
+| These strings, even as compound statements, are automatically parsed to faster built-in constraints, are more concise, and do not require constraint solving familiarity by the user to be efficient.
+| For example, :code:`problem.addConstraint(["50 <= x * y < 100"])` is parsed to :code:`[MinProdConstraint(50, ["x", "y"]), MaxProdConstraint(100, ["x", "y"])]`. 
+| This feature is in beta and subject to possible change, please provide feedback.
+
 .. contents::
     :local:
     :depth: 1
@@ -72,8 +77,7 @@ This interactive Python session demonstrates basic operations:
      {'a': 2, 'b': 6}, {'a': 2, 'b': 5}, {'a': 2, 'b': 4},
      {'a': 1, 'b': 6}, {'a': 1, 'b': 5}, {'a': 1, 'b': 4}]
 
-    >>> problem.addConstraint(lambda a, b: a*2 == b,
-                              ("a", "b"))
+    >>> problem.addConstraint("a*2 == b") # string constraints are preferable over the black-box problem.addConstraint(lambda a, b: a*2 == b, ("a", "b"))
     >>> problem.getSolutions()
     [{'a': 3, 'b': 6}, {'a': 2, 'b': 4}]
 
@@ -146,6 +150,7 @@ The following solvers are available:
 - Optimized backtracking solver
 - Recursive backtracking solver
 - Minimum conflicts solver
+- Parallel solver
 
 .. role:: python(code)
    :language: python
@@ -200,8 +205,7 @@ For an overview of recent changes, visit the `Changelog <https://github.com/pyth
 
 Planned development:
 
-- Add parallel-capable solver
-- Add a string parser for constraints
+- Add `benchmarking tests <https://pypi.org/project/pytest-benchmark/>`_ automated with `GH actions <https://github.com/benchmark-action/github-action-benchmark>`_
 - Versioned documentation
 
 Contact

{python_constraint2-2.0.2 → python_constraint2-2.1.0}/README.rst

@@ -12,6 +12,11 @@ python-constraint
 | For an overview of recent changes, visit the `Changelog <https://github.com/python-constraint/python-constraint/blob/main/CHANGELOG.md>`_.
 | The complete documentation can be found `here <http://python-constraint.github.io/python-constraint/>`_.
 
+| New: writing constraints in the new string format is preferable over functions and lambdas. 
+| These strings, even as compound statements, are automatically parsed to faster built-in constraints, are more concise, and do not require constraint solving familiarity by the user to be efficient.
+| For example, :code:`problem.addConstraint(["50 <= x * y < 100"])` is parsed to :code:`[MinProdConstraint(50, ["x", "y"]), MaxProdConstraint(100, ["x", "y"])]`. 
+| This feature is in beta and subject to possible change, please provide feedback.
+
 .. contents::
     :local:
     :depth: 1
@@ -40,8 +45,7 @@ This interactive Python session demonstrates basic operations:
      {'a': 2, 'b': 6}, {'a': 2, 'b': 5}, {'a': 2, 'b': 4},
      {'a': 1, 'b': 6}, {'a': 1, 'b': 5}, {'a': 1, 'b': 4}]
 
-    >>> problem.addConstraint(lambda a, b: a*2 == b,
-                              ("a", "b"))
+    >>> problem.addConstraint("a*2 == b") # string constraints are preferable over the black-box problem.addConstraint(lambda a, b: a*2 == b, ("a", "b"))
     >>> problem.getSolutions()
     [{'a': 3, 'b': 6}, {'a': 2, 'b': 4}]
 
@@ -114,6 +118,7 @@ The following solvers are available:
 - Optimized backtracking solver
 - Recursive backtracking solver
 - Minimum conflicts solver
+- Parallel solver
 
 .. role:: python(code)
    :language: python
@@ -168,8 +173,7 @@ For an overview of recent changes, visit the `Changelog <https://github.com/pyth
 
 Planned development:
 
-- Add parallel-capable solver
-- Add a string parser for constraints
+- Add `benchmarking tests <https://pypi.org/project/pytest-benchmark/>`_ automated with `GH actions <https://github.com/benchmark-action/github-action-benchmark>`_
 - Versioned documentation
 
 Contact

{python_constraint2-2.0.2 → python_constraint2-2.1.0}/constraint/__init__.py

@@ -31,6 +31,7 @@ from constraint.problem import *  # noqa: F403
 from constraint.domain import *   # noqa: F403
 from constraint.constraints import *  # noqa: F403
 from constraint.solvers import *   # noqa: F403
+from constraint.parser import * # noqa: F403
 
 if __name__ == "__main__":
     from tests import test_doctests