Use mypy

Author: kwj

python/GNUmakefile

@@ -32,6 +32,10 @@ lint:
 format:
 	uvx ruff format --diff .
 
+.PHONY: type-check
+type-check:
+	uvx mypy .
+
 .PHONY: list
 list:
 	@ls euler/bin/p*.py | sed -e 's/.py.*//' -e 's#.*/##' -e 's/^p0*//'

python/euler/__init__.py

@@ -1,2 +1,4 @@
 # flake8: noqa
 from .main import main
+
+__all__ = ['main']

python/euler/bin/p0022.py

@@ -1,17 +1,17 @@
 # project euler: problem 22
 
 from collections.abc import Iterable
-from typing import IO
+from typing import TextIO
 
 
 def total_score(words: Iterable[str]) -> int:
-    def score(word):
+    def score(word: str) -> int:
         return sum(ord(c) - (ord('A') - 1) for c in word)
 
     return sum(idx * score(word) for idx, word in enumerate(words, start=1))
 
 
-def compute(fh: IO) -> str:
+def compute(fh: TextIO) -> str:
     keywords = [s.strip('"') for s in fh.read().split(',')]
 
     return str(total_score(sorted(keywords)))

python/euler/bin/p0034.py

@@ -58,7 +58,7 @@
 # according to the order of the input *iterable*. Otherwise, we need to use other comparisons.
 def search_from_rhs() -> int:
     def to_digit_tpl(n: int) -> tuple[int, ...]:
-        def aux(n):
+        def aux(n: int) -> list[int]:
             if n >= 10:
                 return aux(n // 10) + [n % 10]
             else:

python/euler/bin/p0040.py

@@ -12,6 +12,8 @@
 #    ...
 #  block #n: n-digits number
 
+from typing import cast
+
 
 #  0.123456789 | 10111213...979899 | 100101102...997998999  | 100010011002  ...
 #                     ^[d15]=2
@@ -33,7 +35,7 @@ def d(pos: int) -> int:
     q, r = (pos - 1) // ndigits, (pos - 1) % ndigits
     num = 10 ** (ndigits - 1) + q
 
-    return (num // (10 ** (ndigits - r - 1))) % 10
+    return cast(int, (num // (10 ** (ndigits - r - 1))) % 10)
 
 
 def compute() -> str:

python/euler/bin/p0042.py

@@ -1,7 +1,7 @@
 # project euler: problem 42
 
 from collections.abc import Iterable
-from typing import IO
+from typing import TextIO
 
 from euler.lib.util import is_triangular
 
@@ -16,7 +16,7 @@ def score(word: str) -> int:
     return list(map(score, words))
 
 
-def compute(fh: IO) -> str:
+def compute(fh: TextIO) -> str:
     keywords = [s.strip('"') for s in fh.read().split(',')]
 
     return str(len(list(filter(is_triangular, calc_scores(keywords)))))

python/euler/bin/p0054.py

@@ -31,7 +31,7 @@
 
 from collections import Counter
 from collections.abc import Iterable, Iterator, Sequence
-from typing import IO
+from typing import TextIO
 
 
 def get_handrank(hand: Iterable[str]) -> list[int]:
@@ -114,8 +114,8 @@ def get_detail(h_info: Iterable[tuple[int, int]]) -> list[int]:
     return handrank
 
 
-def compute(fh: IO) -> str:
-    def parse_data(fh: IO) -> Iterator[list[list[str]]]:
+def compute(fh: TextIO) -> str:
+    def parse_data(fh: TextIO) -> Iterator[list[list[str]]]:
         return map(
             lambda lst: [lst[0:5], lst[5:]],
             [line.split(' ') for line in fh.read().splitlines()],

python/euler/bin/p0059.py

@@ -4,7 +4,7 @@
 import re
 from collections.abc import Collection, Iterable
 from itertools import product
-from typing import IO
+from typing import TextIO
 
 
 def decode(cipher_text: Collection[int], key: tuple[int, ...]) -> list[int]:
@@ -24,7 +24,7 @@ def calc_score(lst: Iterable[int]) -> int:
     return cnt
 
 
-def compute(fh: IO) -> str:
+def compute(fh: TextIO) -> str:
     cipher_text = list(map(int, fh.read().split(',')))
     key_lst = product(range(ord('a'), ord('z') + 1), repeat=3)
 

python/euler/bin/p0067.py

@@ -4,14 +4,14 @@
 from functools import reduce
 from itertools import pairwise
 from operator import add
-from typing import IO
+from typing import TextIO
 
 
-def parse_data(fh: IO) -> list[list[int]]:
+def parse_data(fh: TextIO) -> list[list[int]]:
     return [list(map(int, line.split(' '))) for line in fh.read().splitlines()]
 
 
-def compute(fn: Callable[..., int], fh: IO) -> str:
+def compute(fn: Callable[..., int], fh: TextIO) -> str:
     return str(
         reduce(
             lambda x, y: list(map(add, map(fn, pairwise(x)), y)),

python/euler/bin/p0070.py

@@ -19,6 +19,7 @@
 from functools import reduce
 from math import isqrt
 from operator import mul
+from typing import cast
 
 from euler.lib.prime import prev_prime, primes
 from euler.lib.util import HeapQueue
@@ -27,11 +28,11 @@
 
 
 def prod(pf_lst: Iterable[tuple[int, int]]) -> int:
-    return reduce(mul, map(lambda tpl: pow(tpl[0], tpl[1]), pf_lst))
+    return cast(int, reduce(mul, map(lambda tpl: pow(tpl[0], tpl[1]), pf_lst)))
 
 
 def phi(pf_lst: Iterable[tuple[int, int]]) -> int:
-    return reduce(mul, map(lambda tpl: pow(tpl[0], tpl[1] - 1) * (tpl[0] - 1), pf_lst))
+    return cast(int, reduce(mul, map(lambda tpl: pow(tpl[0], tpl[1] - 1) * (tpl[0] - 1), pf_lst)))
 
 
 def get_ratio(pf_lst: Iterable[tuple[int, int]]) -> float: