[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

benchmark/scripts/benchmark_matrix_gen.py

@@ -97,7 +97,8 @@ def build_synthetic(n: int):
 
 
 def build_solve_synthetic(n_snapshots: int, n_components: int):
-    """Return a linopy Model sized like a realistic energy-system dispatch problem.
+    """
+    Return a linopy Model sized like a realistic energy-system dispatch problem.
 
     This model is designed to exercise the solution-unpacking path benchmarked
     by PR #619.  It uses two 2-D variable arrays (snapshot × component) with
@@ -222,7 +223,8 @@ def do_full():
 
 
 def benchmark_solve(model, solver_name: str = "highs", repeats: int = 3) -> list[dict]:
-    """Benchmark the solve + solution-unpacking path on a linopy Model.
+    """
+    Benchmark the solve + solution-unpacking path on a linopy Model.
 
     PR #619 replaces an iterative Python loop (one xarray assignment per
     variable label) with a single vectorised numpy gather.  This function
@@ -267,6 +269,7 @@ def _timed_run(h):
     # Also patch it in the linopy.solvers module namespace that Highs._solve
     # already has a reference to — use the module-level name via the module.
     import linopy.solvers as _sol_module
+
     _sol_module._run_highs_with_keyboard_interrupt = _timed_run
 
     try:
@@ -390,7 +393,8 @@ def run_benchmarks(model_type: str, quick: bool, repeats: int) -> list[dict]:
 
 
 def run_solve_benchmarks(quick: bool, repeats: int, solver_name: str) -> list[dict]:
-    """Run solve + solution-unpacking benchmarks; return flat list of results.
+    """
+    Run solve + solution-unpacking benchmarks; return flat list of results.
 
     Uses a pure-linopy synthetic model (no PyPSA required) sized to approximate
     a realistic energy-system dispatch LP.
@@ -402,8 +406,8 @@ def run_solve_benchmarks(quick: bool, repeats: int, solver_name: str) -> list[di
     sizes = SOLVE_SIZES_QUICK if quick else SOLVE_SIZES_FULL
 
     for n_snap, n_comp in sizes:
-        n_vars_total = 2 * n_snap * n_comp   # p + s arrays
-        n_cons_total = n_snap                  # one balance constraint per snapshot
+        n_vars_total = 2 * n_snap * n_comp  # p + s arrays
+        n_cons_total = n_snap  # one balance constraint per snapshot
 
         print(f"\n{'=' * 60}")
         print(f"Solve benchmark  T={n_snap}, C={n_comp}")
@@ -412,8 +416,10 @@ def run_solve_benchmarks(quick: bool, repeats: int, solver_name: str) -> list[di
         print(f"{'=' * 60}")
 
         model = build_solve_synthetic(n_snap, n_comp)
-        print(f"  {len(model.variables.flat):,} variable labels, "
-              f"{len(model.constraints.flat):,} constraint labels")
+        print(
+            f"  {len(model.variables.flat):,} variable labels, "
+            f"{len(model.constraints.flat):,} constraint labels"
+        )
 
         for r in benchmark_solve(model, solver_name=solver_name, repeats=repeats):
             r.update(
@@ -462,8 +468,7 @@ def format_comparison(before: list[dict], after: list[dict]) -> str:
 def main():
     parser = argparse.ArgumentParser(
         description=(
-            "Benchmark linopy matrix generation and solution unpacking "
-            "(PRs #616–#619)"
+            "Benchmark linopy matrix generation and solution unpacking (PRs #616–#619)"
         )
     )
     parser.add_argument(