Refactor code for API (#3)

Co-authored-by: Mikael CAPELLE <mikael.capelle@thalesaleniaspace.com>
Co-authored-by: Mikaël Capelle <capelle.mikael@gmail.com>
Reviewed-on: #3

src/holt59/aoc/2022/day23.py

@@ -1,6 +1,8 @@
 import itertools
-import sys
 from collections import defaultdict
+from typing import Any, Iterator
+
+from ..base import BaseSolver
 
 Directions = list[
     tuple[
@@ -18,7 +20,7 @@ DIRECTIONS: Directions = [
 
 
 def min_max_yx(positions: set[tuple[int, int]]) -> tuple[int, int, int, int]:
-    ys, xs = {y for y, x in positions}, {x for y, x in positions}
+    ys, xs = {y for y, _x in positions}, {x for _y, x in positions}
     return min(ys), min(xs), max(ys), max(xs)
 
 
@@ -69,35 +71,38 @@ def round(
     directions.append(directions.pop(0))
 
 
-POSITIONS = {
-    (i, j)
-    for i, row in enumerate(sys.stdin.read().splitlines())
-    for j, col in enumerate(row)
-    if col == "#"
-}
+class Solver(BaseSolver):
+    def solve(self, input: str) -> Iterator[Any]:
+        POSITIONS = {
+            (i, j)
+            for i, row in enumerate(input.splitlines())
+            for j, col in enumerate(row)
+            if col == "#"
+        }
 
-# === part 1 ===
+        # === part 1 ===
 
-p1, d1 = POSITIONS.copy(), DIRECTIONS.copy()
-for r in range(10):
-    round(p1, d1)
+        p1, d1 = POSITIONS.copy(), DIRECTIONS.copy()
+        for _ in range(10):
+            round(p1, d1)
 
-min_y, min_x, max_y, max_x = min_max_yx(p1)
-answer_1 = sum(
-    (y, x) not in p1 for y in range(min_y, max_y + 1) for x in range(min_x, max_x + 1)
-)
-print(f"answer 1 is {answer_1}")
+        min_y, min_x, max_y, max_x = min_max_yx(p1)
+        yield sum(
+            (y, x) not in p1
+            for y in range(min_y, max_y + 1)
+            for x in range(min_x, max_x + 1)
+        )
 
-# === part 2 ===
+        # === part 2 ===
 
-p2, d2 = POSITIONS.copy(), DIRECTIONS.copy()
-answer_2 = 0
-while True:
-    answer_2 += 1
-    backup = p2.copy()
-    round(p2, d2)
+        p2, d2 = POSITIONS.copy(), DIRECTIONS.copy()
+        answer_2 = 0
+        while True:
+            answer_2 += 1
+            backup = p2.copy()
+            round(p2, d2)
 
-    if backup == p2:
-        break
+            if backup == p2:
+                break
 
-print(f"answer 2 is {answer_2}")
+        yield answer_2