From 9feb1aa72bfb42f7b1c1856e1fbf5e6d3fbc0e9f Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?C=C3=A9dric=20Bonhomme?= <cedric@cedricbonhomme.org>
Date: Fri, 10 Mar 2017 07:22:16 +0100
Subject: [PATCH] Better typing. Fixed a bug with a generator that has been
 renamed.

---
 requirements.dev.txt         | 1 +
 stegano/lsbset/generators.py | 6 +++---
 2 files changed, 4 insertions(+), 3 deletions(-)

diff --git a/requirements.dev.txt b/requirements.dev.txt
index e8b42d8..213b202 100644
--- a/requirements.dev.txt
+++ b/requirements.dev.txt
@@ -1,3 +1,4 @@
 pep8
 coverage
 coveralls
+mypy
diff --git a/stegano/lsbset/generators.py b/stegano/lsbset/generators.py
index b1643d4..47d8d6a 100644
--- a/stegano/lsbset/generators.py
+++ b/stegano/lsbset/generators.py
@@ -27,7 +27,7 @@ __license__ = "GPLv3"
 
 import math
 import itertools
-from typing import Iterator
+from typing import Iterator, List, Dict
 
 def identity() -> Iterator[int]:
     """f(x) = x
@@ -68,7 +68,7 @@ def eratosthenes() -> Iterator[int]:
     """https://oeis.org/A000040
     Generate the prime numbers with the sieve of Eratosthenes.
     """
-    d = {} # type: dict[int, int]
+    d = {} # type: Dict[int, List[int]]
     for i in itertools.count(2):
         if i in d:
             for j in d[i]:
@@ -92,7 +92,7 @@ def carmichael() -> Iterator[int]:
     """https://oeis.org/A002997
     Composite numbers n such that a^(n-1) == 1 (mod n) for every a coprime to n.
     """
-    for m in eratosthenes_composite():
+    for m in composite():
         for a in range(2, m):
             if pow(a,m,m) != a:
                 break