python-constraint2 2.2.2__tar.gz → 2.3.0__tar.gz

{python_constraint2-2.2.2 → python_constraint2-2.3.0}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.3
 Name: python-constraint2
-Version: 2.2.2
+Version: 2.3.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
@@ -24,6 +24,11 @@ Classifier: Programming Language :: Python :: 3.10
 Classifier: Programming Language :: Python :: 3.11
 Classifier: Programming Language :: Python :: 3.12
 Classifier: Programming Language :: Python :: 3.13
+Project-URL: Changelog, https://github.com/python-constraint/python-constraint/blob/main/CHANGELOG.md
+Project-URL: Documentation, http://python-constraint.github.io/python-constraint/
+Project-URL: Homepage, http://python-constraint.github.io/python-constraint/
+Project-URL: Issues, https://github.com/python-constraint/python-constraint/issues
+Project-URL: Repository, https://github.com/python-constraint/python-constraint
 Description-Content-Type: text/x-rst
 
 |License| |Build Status| |Docs| |Python Versions| |Downloads| |Status| |Code Coverage|
@@ -43,6 +48,7 @@ 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"])]`. 
+| Similarly, :code:`problem.addConstraint(["x / y == z"])` is parsed to :code:`[ExactProdConstraint("x", ["z", "y"])]`.
 | This feature is in beta and subject to possible change, please provide feedback.
 
 .. contents::
@@ -142,29 +148,36 @@ Features
 
 The following solvers are available:
 
-- Backtracking solver
-- Optimized backtracking solver
-- Recursive backtracking solver
-- Minimum conflicts solver
-- Parallel solver
+- :code:`OptimizedBacktrackingSolver` (default)
+- :code:`BacktrackingSolver`
+- :code:`RecursiveBacktrackingSolver`
+- :code:`MinConflictsSolver`
+- :code:`ParallelSolver`
 
 .. role:: python(code)
    :language: python
 
-Predefined constraint types currently available:
-
-- :python:`FunctionConstraint`
-- :python:`AllDifferentConstraint`
-- :python:`AllEqualConstraint`
-- :python:`MaxSumConstraint`
-- :python:`ExactSumConstraint`
-- :python:`MinSumConstraint`
-- :python:`MaxProdConstraint`
-- :python:`MinProdConstraint`
-- :python:`InSetConstraint`
-- :python:`NotInSetConstraint`
-- :python:`SomeInSetConstraint`
-- :python:`SomeNotInSetConstraint`
+Predefined constraint types currently available (use the parsing for automatic conversion to these types):
+
+- :code:`FunctionConstraint`
+- :code:`AllDifferentConstraint`
+- :code:`AllEqualConstraint`
+- :code:`ExactSumConstraint`
+- :code:`MinSumConstraint`
+- :code:`MaxSumConstraint`
+- :code:`MinProdConstraint`
+- :code:`ExactProdConstraint`
+- :code:`MaxProdConstraint`
+- :code:`VariableExactSumConstraint`
+- :code:`VariableMinSumConstraint`
+- :code:`VariableMaxSumConstraint`
+- :code:`VariableMinProdConstraint`
+- :code:`VariableExactProdConstraint`
+- :code:`VariableMaxProdConstraint`
+- :code:`InSetConstraint`
+- :code:`NotInSetConstraint`
+- :code:`SomeInSetConstraint`
+- :code:`SomeNotInSetConstraint`
 
 API documentation
 -----------------

{python_constraint2-2.2.2 → python_constraint2-2.3.0}/README.rst

@@ -15,6 +15,7 @@ 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"])]`. 
+| Similarly, :code:`problem.addConstraint(["x / y == z"])` is parsed to :code:`[ExactProdConstraint("x", ["z", "y"])]`.
 | This feature is in beta and subject to possible change, please provide feedback.
 
 .. contents::
@@ -114,29 +115,36 @@ Features
 
 The following solvers are available:
 
-- Backtracking solver
-- Optimized backtracking solver
-- Recursive backtracking solver
-- Minimum conflicts solver
-- Parallel solver
+- :code:`OptimizedBacktrackingSolver` (default)
+- :code:`BacktrackingSolver`
+- :code:`RecursiveBacktrackingSolver`
+- :code:`MinConflictsSolver`
+- :code:`ParallelSolver`
 
 .. role:: python(code)
    :language: python
 
-Predefined constraint types currently available:
-
-- :python:`FunctionConstraint`
-- :python:`AllDifferentConstraint`
-- :python:`AllEqualConstraint`
-- :python:`MaxSumConstraint`
-- :python:`ExactSumConstraint`
-- :python:`MinSumConstraint`
-- :python:`MaxProdConstraint`
-- :python:`MinProdConstraint`
-- :python:`InSetConstraint`
-- :python:`NotInSetConstraint`
-- :python:`SomeInSetConstraint`
-- :python:`SomeNotInSetConstraint`
+Predefined constraint types currently available (use the parsing for automatic conversion to these types):
+
+- :code:`FunctionConstraint`
+- :code:`AllDifferentConstraint`
+- :code:`AllEqualConstraint`
+- :code:`ExactSumConstraint`
+- :code:`MinSumConstraint`
+- :code:`MaxSumConstraint`
+- :code:`MinProdConstraint`
+- :code:`ExactProdConstraint`
+- :code:`MaxProdConstraint`
+- :code:`VariableExactSumConstraint`
+- :code:`VariableMinSumConstraint`
+- :code:`VariableMaxSumConstraint`
+- :code:`VariableMinProdConstraint`
+- :code:`VariableExactProdConstraint`
+- :code:`VariableMaxProdConstraint`
+- :code:`InSetConstraint`
+- :code:`NotInSetConstraint`
+- :code:`SomeInSetConstraint`
+- :code:`SomeNotInSetConstraint`
 
 API documentation
 -----------------