Fix formatting

src/galois/_prime.py

@@ -170,17 +170,15 @@ def prev_prime(n: int) -> int:
     if n <= MAX_N:
         return PRIMES[bisect.bisect_right(PRIMES, n) - 1]
 
-    shifts = [29, 23, 19, 17, 13, 11, 7, 1] # Factorization wheel for basis {2, 3, 5}
-    base = n // 30 * 30 # Wheel factorization starting point
-    found = False # Success flag
+    shifts = [29, 23, 19, 17, 13, 11, 7, 1]  # Factorization wheel for basis {2, 3, 5}
+    base = n // 30 * 30  # Wheel factorization starting point
+    found = False  # Success flag
 
     while not found:
         for shift in shifts:
-            i = base + shift # May be bigger than n
-
+            i = base + shift  # May be bigger than n
             if i >= n:
                 continue
-
             if is_prime(i):
                 found = True
                 break
@@ -219,17 +217,15 @@ def next_prime(n: int) -> int:
     if n < PRIMES[-1]:
         return PRIMES[bisect.bisect_right(PRIMES, n)]
 
-    shifts = [1, 7, 11, 13, 17, 19, 23, 29] # Factorization wheel for basis {2, 3, 5}
-    base = n // 30 * 30 # Wheel factorization starting point. May be less than n.
-    found = False # Success flag
+    shifts = [1, 7, 11, 13, 17, 19, 23, 29]  # Factorization wheel for basis {2, 3, 5}
+    base = n // 30 * 30  # Wheel factorization starting point. May be less than n.
+    found = False  # Success flag
 
     while not found:
         for shift in shifts:
             i = base + shift
-
             if i <= n:
                 continue
-
             if is_prime(i):
                 found = True
                 break