prefect-client 3.8.7.dev6__tar.gz → 3.8.7.dev7__tar.gz

{prefect_client-3.8.7.dev6 → prefect_client-3.8.7.dev7}/PKG-INFO

@@ -1,6 +1,6 @@
 Metadata-Version: 2.5
 Name: prefect-client
-Version: 3.8.7.dev6
+Version: 3.8.7.dev7
 Summary: Workflow orchestration and management.
 Project-URL: Changelog, https://github.com/PrefectHQ/prefect/releases
 Project-URL: Documentation, https://docs.prefect.io

prefect_client-3.8.7.dev7/src/prefect/_build_info.py

@@ -0,0 +1,5 @@
+# Generated by versioningit
+__version__ = "3.8.7.dev7"
+__build_date__ = "2026-09-26 08:18:39.365341+00:00"
+__git_commit__ = "c24d832726a2347dd4df2b82b38226a7a994823d"
+__dirty__ = False

{prefect_client-3.8.7.dev6 → prefect_client-3.8.7.dev7}/src/prefect/flow_engine.py

@@ -930,9 +930,10 @@ class FlowRunEngine(BaseFlowRunEngine[P, R]):
         run, if appropriate.
 
         If the parent task run is in a final state, we return the existing
-        subflow run to avoid re-execution (unless the parent is being rerun
-        and the subflow did not complete, in which case a fresh run is
-        desired).
+        subflow run unless the parent is being rerun and the subflow either
+        did not complete or has no persisted result. In those cases a fresh
+        run gives the subflow its full retry budget while preserving the
+        previous run's history.
 
         If the parent task run is in a non-final state (e.g. still Running
         after a process restart), we also look for an existing subflow run
@@ -972,8 +973,18 @@ class FlowRunEngine(BaseFlowRunEngine[P, R]):
         )
         if flow_runs:
             loaded_flow_run = flow_runs[0]
-            # When the parent task run is final the subflow has already
-            # finished; cache the result so the engine skips re-execution.
+            if (
+                rerunning
+                and parent_task_run.state.is_completed()
+                and loaded_flow_run.state is not None
+                and loaded_flow_run.state.is_completed()
+                and loaded_flow_run.state.data is None
+            ):
+                # Without a persisted result the child must execute again. A
+                # fresh run preserves its history and restores its retry budget.
+                return None
+
+            # Keep the previous state available when reusing a finished run.
             if parent_task_run.state.is_final():
                 self._return_value = loaded_flow_run.state
             return loaded_flow_run
@@ -1638,9 +1649,10 @@ class AsyncFlowRunEngine(BaseFlowRunEngine[P, R]):
         run, if appropriate.
 
         If the parent task run is in a final state, we return the existing
-        subflow run to avoid re-execution (unless the parent is being rerun
-        and the subflow did not complete, in which case a fresh run is
-        desired).
+        subflow run unless the parent is being rerun and the subflow either
+        did not complete or has no persisted result. In those cases a fresh
+        run gives the subflow its full retry budget while preserving the
+        previous run's history.
 
         If the parent task run is in a non-final state (e.g. still Running
         after a process restart), we also look for an existing subflow run
@@ -1680,8 +1692,18 @@ class AsyncFlowRunEngine(BaseFlowRunEngine[P, R]):
         )
         if flow_runs:
             loaded_flow_run = flow_runs[0]
-            # When the parent task run is final the subflow has already
-            # finished; cache the result so the engine skips re-execution.
+            if (
+                rerunning
+                and parent_task_run.state.is_completed()
+                and loaded_flow_run.state is not None
+                and loaded_flow_run.state.is_completed()
+                and loaded_flow_run.state.data is None
+            ):
+                # Without a persisted result the child must execute again. A
+                # fresh run preserves its history and restores its retry budget.
+                return None
+
+            # Keep the previous state available when reusing a finished run.
             if parent_task_run.state.is_final():
                 self._return_value = loaded_flow_run.state
             return loaded_flow_run

{prefect_client-3.8.7.dev6 → prefect_client-3.8.7.dev7}/src/prefect/results.py

@@ -486,15 +486,21 @@ class ResultStore(BaseModel):
         Returns:
             ResultRecord: The result record.
         """
-        if metadata.storage_block_id is None:
-            storage_block = None
-        else:
-            storage_block = await aresolve_result_storage(metadata.storage_block_id)
-        store = cls(result_storage=storage_block, serializer=metadata.serializer)
         if metadata.storage_key is None:
             raise ValueError(
                 "storage_key is required to hydrate a result record from metadata"
             )
+        if metadata.storage_block_id is not None:
+            storage_block = await aresolve_result_storage(metadata.storage_block_id)
+        elif Path(metadata.storage_key).is_absolute():
+            # Results written to an unsaved local filesystem record an absolute path
+            # as the storage key, which may live outside the default local storage.
+            storage_block = LocalFileSystem(
+                basepath=str(Path(metadata.storage_key).parent)
+            )
+        else:
+            storage_block = None
+        store = cls(result_storage=storage_block, serializer=metadata.serializer)
         result = await store.aread(metadata.storage_key)
         return result
 

{prefect_client-3.8.7.dev6 → prefect_client-3.8.7.dev7}/src/prefect/utilities/math.py

@@ -48,10 +48,15 @@ def clamped_poisson_interval(
 
     The upper bound for this random variate is: average_interval * (1 + clamping_factor).
     A lower bound is picked so that the average interval remains approximately fixed.
+
+    An `average_interval` of zero (or less) yields an interval of `0.0`.
     """
     if clamping_factor <= 0:
         raise ValueError("`clamping_factor` must be >= 0.")
 
+    if average_interval <= 0:
+        return 0.0
+
     upper_clamp_multiple = 1 + clamping_factor
     upper_bound = average_interval * upper_clamp_multiple
     lower_bound = max(0, average_interval * lower_clamp_multiple(upper_clamp_multiple))

prefect_client-3.8.7.dev6/src/prefect/_build_info.py

@@ -1,5 +0,0 @@
-# Generated by versioningit
-__version__ = "3.8.7.dev6"
-__build_date__ = "2026-09-23 08:20:21.923919+00:00"
-__git_commit__ = "148e99781fb05df258d3efddb5ef4fee0b61c9f2"
-__dirty__ = False