Merge branch 'master' into add-n-body-simulation-2

Author: dhruvmanila

.github/workflows/build.yml

@@ -21,30 +21,9 @@ jobs:
         run: |
           python -m pip install --upgrade pip setuptools six wheel
           python -m pip install mypy pytest-cov -r requirements.txt
-      # FIXME: #4052 fix mypy errors in other directories and add them here
+      # FIXME: #4052 fix mypy errors in the exclude directories and remove them below
       - run: mypy --ignore-missing-imports
-           backtracking
-           bit_manipulation
-           blockchain
-           boolean_algebra
-           cellular_automata
-           compression
-           computer_vision
-           divide_and_conquer
-           electronics
-           file_transfer
-           fractals
-           fuzzy_logic
-           genetic_algorithm
-           geodesy
-           knapsack
-           machine_learning
-           networking_flow
-           neural_network
-           physics
-           quantum
-           scheduling
-           sorts
+          --exclude '(ciphers|conversions|data_structures|digital_image_processing|dynamic_programming|graphs|linear_algebra|maths|matrix|other|project_euler|scripts|searches|strings*)/$' .
       - name: Run tests
         run: pytest --doctest-modules --ignore=project_euler/ --ignore=scripts/ --cov-report=term-missing:skip-covered --cov=. .
       - if: ${{ success() }}

.github/workflows/pre-commit.yml

@@ -14,7 +14,7 @@ jobs:
             ~/.cache/pip
           key: ${{ runner.os }}-pre-commit-${{ hashFiles('.pre-commit-config.yaml') }}
       - uses: actions/setup-python@v2
-      - uses: psf/black@stable
+      - uses: psf/black@20.8b1
       - name: Install pre-commit
         run: |
           python -m pip install --upgrade pip

arithmetic_analysis/gaussian_elimination.py

@@ -7,7 +7,7 @@
 import numpy as np
 
 
-def retroactive_resolution(coefficients: np.matrix, vector: np.array) -> np.array:
+def retroactive_resolution(coefficients: np.matrix, vector: np.ndarray) -> np.ndarray:
     """
     This function performs a retroactive linear system resolution
         for triangular matrix
@@ -38,7 +38,7 @@ def retroactive_resolution(coefficients: np.matrix, vector: np.array) -> np.arra
     return x
 
 
-def gaussian_elimination(coefficients: np.matrix, vector: np.array) -> np.array:
+def gaussian_elimination(coefficients: np.matrix, vector: np.ndarray) -> np.ndarray:
     """
     This function performs Gaussian elimination method
 
@@ -57,7 +57,7 @@ def gaussian_elimination(coefficients: np.matrix, vector: np.array) -> np.array:
     # coefficients must to be a square matrix so we need to check first
     rows, columns = np.shape(coefficients)
     if rows != columns:
-        return []
+        return np.array((), dtype=float)
 
     # augmented matrix
     augmented_mat = np.concatenate((coefficients, vector), axis=1)

arithmetic_analysis/in_static_equilibrium.py

@@ -3,7 +3,7 @@
 """
 from typing import List
 
-from numpy import array, cos, cross, radians, sin
+from numpy import array, cos, cross, ndarray, radians, sin
 
 
 def polar_force(
@@ -23,7 +23,7 @@ def polar_force(
 
 
 def in_static_equilibrium(
-    forces: array, location: array, eps: float = 10 ** -1
+    forces: ndarray, location: ndarray, eps: float = 10 ** -1
 ) -> bool:
     """
     Check if a system is in equilibrium.
@@ -42,7 +42,7 @@ def in_static_equilibrium(
     False
     """
     # summation of moments is zero
-    moments: array = cross(location, forces)
+    moments: ndarray = cross(location, forces)
     sum_moments: float = sum(moments)
     return abs(sum_moments) < eps
 

bit_manipulation/binary_shifts.py

@@ -91,9 +91,7 @@ def arithmetic_right_shift(number: int, shift_amount: int) -> str:
         binary_number_length = len(bin(number)[3:])  # Find 2's complement of number
         binary_number = bin(abs(number) - (1 << binary_number_length))[3:]
         binary_number = (
-            ("1" + "0" * (binary_number_length - len(binary_number)) + binary_number)
-            if number < 0
-            else "0"
+            "1" + "0" * (binary_number_length - len(binary_number)) + binary_number
         )
 
     if shift_amount >= len(binary_number):

hashes/adler32.py

@@ -9,10 +9,10 @@
 """
 
 
-def adler32(plain_text: str) -> str:
+def adler32(plain_text: str) -> int:
     """
     Function implements adler-32 hash.
-    Itterates and evaluates new value for each character
+    Iterates and evaluates a new value for each character
 
     >>> adler32('Algorithms')
     363791387

hashes/chaos_machine.py

@@ -6,7 +6,8 @@
 m = 5
 
 # Buffer Space (with Parameters Space)
-buffer_space, params_space = [], []
+buffer_space: list[float] = []
+params_space: list[float] = []
 
 # Machine Time
 machine_time = 0

hashes/enigma_machine.py

@@ -41,8 +41,7 @@ def engine(input_character):
 
 
 if __name__ == "__main__":
-    decode = input("Type your message:\n")
-    decode = list(decode)
+    decode = list(input("Type your message:\n"))
     while True:
         try:
             token = int(input("Please set token:(must be only digits)\n"))
@@ -51,8 +50,8 @@ def engine(input_character):
             print(error)
     for i in range(token):
         rotator()
-    for i in decode:
-        engine(i)
+    for j in decode:
+        engine(j)
     print("\n" + "".join(code))
     print(
         f"\nYour Token is {token} please write it down.\nIf you want to decode "

hashes/sdbm.py

@@ -19,7 +19,7 @@
 """
 
 
-def sdbm(plain_text: str) -> str:
+def sdbm(plain_text: str) -> int:
     """
     Function implements sdbm hash, easy to use, great for bits scrambling.
     iterates over each character in the given string and applies function to each of

maths/bailey_borwein_plouffe.py

@@ -70,7 +70,6 @@ def _subsum(
     sum = 0.0
     for sum_index in range(digit_pos_to_extract + precision):
         denominator = 8 * sum_index + denominator_addend
-        exponential_term = 0.0
         if sum_index < digit_pos_to_extract:
             # if the exponential term is an integer and we mod it by the denominator
             # before dividing, only the integer part of the sum will change;

project_euler/problem_074/sol1.py

@@ -51,7 +51,6 @@
     871: 2,
     45361: 2,
     872: 2,
-    45361: 2,
 }
 
 

web_programming/currency_converter.py

@@ -9,7 +9,7 @@
 
 URL_BASE = "https://www.amdoren.com/api/currency.php"
 TESTING = os.getenv("CI", False)
-API_KEY = os.getenv("AMDOREN_API_KEY")
+API_KEY = os.getenv("AMDOREN_API_KEY", "")
 if not API_KEY and not TESTING:
     raise KeyError("Please put your API key in an environment variable.")
 

web_programming/emails_from_url.py

@@ -8,18 +8,19 @@
 
 import re
 from html.parser import HTMLParser
+from typing import Optional
 from urllib import parse
 
 import requests
 
 
 class Parser(HTMLParser):
-    def __init__(self, domain: str):
-        HTMLParser.__init__(self)
-        self.data = []
+    def __init__(self, domain: str) -> None:
+        super().__init__()
+        self.urls: list[str] = []
         self.domain = domain
 
-    def handle_starttag(self, tag: str, attrs: str) -> None:
+    def handle_starttag(self, tag: str, attrs: list[tuple[str, Optional[str]]]) -> None:
         """
         This function parse html to take takes url from tags
         """
@@ -29,10 +30,10 @@ def handle_starttag(self, tag: str, attrs: str) -> None:
             for name, value in attrs:
                 # If href is defined, and not empty nor # print it.
                 if name == "href" and value != "#" and value != "":
-                    # If not already in data.
-                    if value not in self.data:
+                    # If not already in urls.
+                    if value not in self.urls:
                         url = parse.urljoin(self.domain, value)
-                        self.data.append(url)
+                        self.urls.append(url)
 
 
 # Get main domain name (example.com)
@@ -59,7 +60,7 @@ def get_sub_domain_name(url: str) -> str:
     return parse.urlparse(url).netloc
 
 
-def emails_from_url(url: str = "https://github.com") -> list:
+def emails_from_url(url: str = "https://github.com") -> list[str]:
     """
     This function takes url and return all valid urls
     """
@@ -78,7 +79,7 @@ def emails_from_url(url: str = "https://github.com") -> list:
 
         # Get links and loop through
         valid_emails = set()
-        for link in parser.data:
+        for link in parser.urls:
             # open URL.
             # read = requests.get(link)
             try: