Run and apply pre-commit autoupdate

No effects were observed on Make-managed files.

Signed-off-by: Alex Nelson <alexander.nelson@nist.gov>

Author: ajnelson-nist

.pre-commit-config.yaml

@@ -14,15 +14,15 @@
 
 repos:
   - repo: https://github.com/psf/black
-    rev: 25.1.0
+    rev: 26.1.0
     hooks:
       - id: black
   - repo: https://github.com/pycqa/flake8
-    rev: 7.2.0
+    rev: 7.3.0
     hooks:
       - id: flake8
   - repo: https://github.com/pycqa/isort
-    rev: 6.0.1
+    rev: 7.0.0
     hooks:
       - id: isort
         name: isort (python)

case_prov/case_prov_dot.py

@@ -283,7 +283,7 @@ def _build_augments_from_query(query: str) -> None:
     # there is an indicator they end, an End node.
 
     for n_activity in sorted(n_activities):
-        (_, start_graph) = case_prov.infer_interval_terminus(
+        _, start_graph = case_prov.infer_interval_terminus(
             graph,
             n_activity,
             NS_PROV.qualifiedStart,
@@ -294,7 +294,7 @@ def _build_augments_from_query(query: str) -> None:
         del start_graph
 
         if case_prov.interval_end_should_exist(graph, n_activity):
-            (_, end_graph) = case_prov.infer_interval_terminus(
+            _, end_graph = case_prov.infer_interval_terminus(
                 graph,
                 n_activity,
                 NS_PROV.qualifiedEnd,
@@ -470,7 +470,7 @@ def _build_datetimestamp_augments_from_query(query: str) -> None:
     # For remaining time:Intervals, guarantee they have beginning
     # and, if appropriate, ending nodes.
     for n_interval in sorted(n_intervals):
-        (_, start_graph) = case_prov.infer_interval_terminus(
+        _, start_graph = case_prov.infer_interval_terminus(
             graph,
             n_interval,
             NS_TIME.hasBeginning,
@@ -481,7 +481,7 @@ def _build_datetimestamp_augments_from_query(query: str) -> None:
         del start_graph
 
         if case_prov.interval_end_should_exist(graph, n_interval):
-            (_, end_graph) = case_prov.infer_interval_terminus(
+            _, end_graph = case_prov.infer_interval_terminus(
                 graph,
                 n_interval,
                 NS_TIME.hasEnd,

case_prov/case_prov_rdf.py

@@ -152,7 +152,7 @@ def main() -> None:
         action_inherence_uuid = case_utils.inherent_uuid.inherence_uuid(n_action)
 
         # Generate Starts.
-        (n_start, inference_triples) = case_prov.infer_interval_terminus(
+        n_start, inference_triples = case_prov.infer_interval_terminus(
             in_graph,
             n_action,
             NS_PROV.qualifiedStart,
@@ -167,7 +167,7 @@ def main() -> None:
 
         # Generate Ends, if there's a sign an end should exist.
         if case_prov.interval_end_should_exist(in_graph, n_action):
-            (n_end, inference_triples) = case_prov.infer_interval_terminus(
+            n_end, inference_triples = case_prov.infer_interval_terminus(
                 in_graph,
                 n_action,
                 NS_PROV.qualifiedEnd,
@@ -581,7 +581,7 @@ def _pull_inference_triples(inference_triples: case_prov.TmpTriplesType) -> None
     # the bounding instants.
     for n_interval in sorted(n_intervals):
         # Generate Ends.
-        (n_time_end, end_graph) = case_prov.infer_interval_terminus(
+        n_time_end, end_graph = case_prov.infer_interval_terminus(
             tmp_graph,
             n_interval,
             NS_TIME.hasEnd,
@@ -594,7 +594,7 @@ def _pull_inference_triples(inference_triples: case_prov.TmpTriplesType) -> None
         del end_graph
 
         # Generate Beginnings.
-        (n_time_beginning, beginning_graph) = case_prov.infer_interval_terminus(
+        n_time_beginning, beginning_graph = case_prov.infer_interval_terminus(
             tmp_graph,
             n_interval,
             NS_TIME.hasBeginning,