pathsim 0.29.1__tar.gz → 0.29.2__tar.gz

{pathsim-0.29.1 → pathsim-0.29.2}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pathsim
-Version: 0.29.1
+Version: 0.29.2
 Summary: A differentiable block based hybrid system simulation framework.
 Author-email: Milan Rother <milan.rother@gmx.de>
 License: MIT

{pathsim-0.29.1 → pathsim-0.29.2}/src/pathsim/_version.py

@@ -18,7 +18,7 @@ version_tuple: tuple[int | str, ...]
 commit_id: str | None
 __commit_id__: str | None
 
-__version__ = version = '0.29.1'
-__version_tuple__ = version_tuple = (0, 29, 1)
+__version__ = version = '0.29.2'
+__version_tuple__ = version_tuple = (0, 29, 2)
 
-__commit_id__ = commit_id = 'g0153b3dd1'
+__commit_id__ = commit_id = 'gc2d44b82b'

{pathsim-0.29.1 → pathsim-0.29.2}/src/pathsim/blocks/bvp.py

@@ -252,8 +252,10 @@ class BVP1D(Block):
         u = self.inputs.to_array()
 
         #skip the solve if the boundary data is unchanged since the last
-        #successful solve; the warm-start and output are still valid
+        #successful solve; the warm-start and output are still valid, also
+        #when a solve for another input failed in between
         if self._u_last is not None and np.array_equal(u, self._u_last):
+            self.success = True
             return
 
         #scipy callbacks, with or without free parameters

{pathsim-0.29.1 → pathsim-0.29.2}/src/pathsim.egg-info/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.4
 Name: pathsim
-Version: 0.29.1
+Version: 0.29.2
 Summary: A differentiable block based hybrid system simulation framework.
 Author-email: Milan Rother <milan.rother@gmx.de>
 License: MIT

{pathsim-0.29.1 → pathsim-0.29.2}/src/pathsim.egg-info/scm_version.json

@@ -1,7 +1,7 @@
 {
-  "tag": "0.29.1",
+  "tag": "0.29.2",
   "distance": 0,
-  "node": "g0153b3dd14ea794541e487eab0821edf1bb518fc",
+  "node": "gc2d44b82b34737fa578d0dff84befb04b6ee8dd0",
   "dirty": false,
   "branch": "HEAD",
   "node_date": "2026-11-04"

{pathsim-0.29.1 → pathsim-0.29.2}/tests/pathsim/blocks/test_bvp.py

@@ -173,6 +173,28 @@ class TestBVP1D(unittest.TestCase):
         np.testing.assert_allclose(bvp.solution()[0, 2], 2.0*np.sin(np.pi/4), atol=1e-5)
 
 
+    def test_return_to_solved_input_after_failed_solve(self):
+        #a failed solve keeps the previous solution, returning to the input of
+        #that solution reuses it and reports success again (pathsim#275)
+        fun = lambda x, y, p, u: np.vstack([y[1], -y[0] if u[0] > 0 else np.nan*y[0]])
+        bc = lambda ya, yb, p, u: np.array([ya[0], yb[0] - u[0]])
+        bvp = BVP1D(fun, bc, n=2, domain=(0.0, np.pi/2))
+
+        bvp.inputs[0] = 2.0
+        bvp.update(0.0)
+        self.assertTrue(bvp.success)
+        y_ok = bvp.outputs.to_array()
+
+        bvp.inputs[0] = -1.0
+        bvp.update(0.0)
+        self.assertFalse(bvp.success)
+
+        bvp.inputs[0] = 2.0
+        bvp.update(0.0)
+        self.assertTrue(bvp.success)
+        np.testing.assert_array_equal(bvp.outputs.to_array(), y_ok)
+
+
     def test_input_unchanged_skips_resolve(self):
         #a re-evaluation with unchanged input must not trigger another solve,
         #but a changed input must