v3.3.1

.github/workflows/continuous-integration-pip.yml

@@ -44,7 +44,7 @@ jobs:
     if: ${{ needs.skip_duplicate.outputs.should_skip == 'false' }}
     strategy:
       matrix:
-        python-version: [ 3.9, "3.10", "3.11", "pypy3.9" ]
+        python-version: [ 3.9, "3.10", "3.11", "3.12", "pypy3.9" , "pypy3.10" ]
     runs-on: ubuntu-latest
     steps:
       - name: Checkout

.gitignore

@@ -105,7 +105,7 @@ celerybeat.pid
 .env
 .venv
 env/
-venv/
+venv*/
 ENV/
 env.bak/
 venv.bak/

docs/source/changelog.rst

@@ -1,6 +1,10 @@
 ChangeLog
 ---------
 
+**v3.3.1** (2023-10-09)
+
+- Adapted tests to Python 3.12
+
 **v3.3.0** (2023-07-16)
 
 - Extras: Algorithm for computing an exact solution for traveling salesman problems

requirements_ci.txt

@@ -5,4 +5,4 @@ flake8
 mypy
 # -- additional packaged used only for test with them --
 mpmath
-intbitset ; implementation_name == "cpython"  # missing on PyPy 3.11
+intbitset ; python_version < "3.12" and implementation_name == "cpython"  # missing on PyPy and (so far) CPython 3.12

requirements_dev.txt

@@ -13,4 +13,4 @@ flake8
 mypy
 # -- additional packaged used only for test with them --
 mpmath
-intbitset ; implementation_name == "cpython"  # missing on PyPy 3.11
+intbitset ; python_version < "3.12" and implementation_name == "cpython"  # missing on PyPy 3.11 and (so far) CPython 3.12

setup.py

@@ -7,7 +7,7 @@
 
 setup(
     name="nographs",
-    version="3.3.0",
+    version="3.3.1",
     description=("Graph analysis – the lazy (evaluation) way: Analysis on the fly, "
                  + "for graphs, that are computed and/or adapted on the fly."),
     long_description=long_description,
@@ -26,6 +26,7 @@
         "Programming Language :: Python :: 3.9",
         "Programming Language :: Python :: 3.10",
         "Programming Language :: Python :: 3.11",
+        "Programming Language :: Python :: 3.12",
         "Programming Language :: Python :: Implementation :: CPython",
         "Programming Language :: Python :: Implementation :: PyPy",
         "Intended Audience :: Developers",

tests/test_unit_typed.py

@@ -56,12 +56,12 @@ def next_edges(
         self.assertEqual(cm.exception.args, ("Error: Distance stays constant",))
 
         getcontext().prec = 75  # precision (number of places)
-        self.assertEquals(
+        self.assertEqual(
             test_with_small_weights(Decimal(0), Decimal("0.5"), Decimal(1)), 65
         )
 
         mp.prec = 64
-        self.assertEquals(test_with_small_weights(mpf(0), mpf("0.5"), mpf(1)), 65)
+        self.assertEqual(test_with_small_weights(mpf(0), mpf("0.5"), mpf(1)), 65)
 
     def test_traversal_typing_docs_example(self) -> None:
         def next_edges(i: int, _: Any) -> Iterator[tuple[int, int]]:
@@ -89,9 +89,9 @@ def next_edges(i: int, _: Any) -> Iterator[tuple[int, int]]:
                 reveal_type(v)  # reveals: int
                 reveal_type(d)  # reveals: Union[int, float]
                 reveal_type(p)  # reveals: tuple[int, ...]
-        self.assertEquals(v, 5)
-        self.assertEquals(d, 24)
-        self.assertEquals(p, (0, 1, 2, 3, 4, 10, 16, 17, 11, 5))
+        self.assertEqual(v, 5)
+        self.assertEqual(d, 24)
+        self.assertEqual(p, (0, 1, 2, 3, 4, 10, 16, 17, 11, 5))
 
     def test_tsp_typing_docs_example(self) -> None:
         """The MyPy run will detect if the typing goes wrong here.