[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

ciphers/rsa_cipher.py

@@ -129,7 +129,9 @@ def main() -> None:
             message = input("\nEnter message: ")
             pubkey_filename = "rsa_pubkey.txt"
             print(f"Encrypting and writing to {filename}...")
-            encrypted_text = encrypt_and_write_to_file(filename, pubkey_filename, message)
+            encrypted_text = encrypt_and_write_to_file(
+                filename, pubkey_filename, message
+            )
 
             print("\nEncrypted text:")
             print(encrypted_text)

computer_vision/mosaic_augmentation.py

@@ -147,7 +147,8 @@ def update_image_and_anno(
                     new_anno.append([bbox[0], xmin, ymin, xmax, ymax])
             case _:  # bottom-right
                 img = cv2.resize(
-                    img, (output_size[1] - divid_point_x, output_size[0] - divid_point_y)
+                    img,
+                    (output_size[1] - divid_point_x, output_size[0] - divid_point_y),
                 )
                 output_img[
                     divid_point_y : output_size[0], divid_point_x : output_size[1], :

linear_algebra/src/lib.py

@@ -422,7 +422,8 @@ def determinant(self) -> float:
                 )
             case _:
                 cofactor_prods = [
-                    self.__matrix[0][y] * self.cofactor(0, y) for y in range(self.__width)
+                    self.__matrix[0][y] * self.cofactor(0, y)
+                    for y in range(self.__width)
                 ]
                 return sum(cofactor_prods)
 

maths/jaccard_similarity.py

@@ -83,7 +83,9 @@ def jaccard_similarity(
                 return len(intersection) / (len(set_a) + len(set_b))
             else:
                 # Cast set_a to list because tuples cannot be mutated
-                union = list(set_a) + [element for element in set_b if element not in set_a]
+                union = list(set_a) + [
+                    element for element in set_b if element not in set_a
+                ]
                 return len(intersection) / len(union)
     raise ValueError(
         "Set a and b must either both be sets or be either a list or a tuple."

matrix/inverse_of_matrix.py

@@ -81,14 +81,15 @@ def inverse_of_matrix(matrix: list[list[float]]) -> list[list[float]]:
 
             # Calculate the inverse of the matrix
             return [
-                [(float(d(n)) / determinant) or 0.0 for n in row] for row in swapped_matrix
+                [(float(d(n)) / determinant) or 0.0 for n in row]
+                for row in swapped_matrix
             ]
-        case _ if ((
+        case _ if (
             len(matrix) == 3
             and len(matrix[0]) == 3
             and len(matrix[1]) == 3
             and len(matrix[2]) == 3
-        )):
+        ):
             # Calculate the determinant of the matrix using Sarrus rule
             determinant = float(
                 (
@@ -115,25 +116,29 @@ def inverse_of_matrix(matrix: list[list[float]]) -> list[list[float]]:
                 d(matrix[1][2]) * d(matrix[2][1])
             )
             cofactor_matrix[0][1] = -(
-                (d(matrix[1][0]) * d(matrix[2][2])) - (d(matrix[1][2]) * d(matrix[2][0]))
+                (d(matrix[1][0]) * d(matrix[2][2]))
+                - (d(matrix[1][2]) * d(matrix[2][0]))
             )
             cofactor_matrix[0][2] = (d(matrix[1][0]) * d(matrix[2][1])) - (
                 d(matrix[1][1]) * d(matrix[2][0])
             )
             cofactor_matrix[1][0] = -(
-                (d(matrix[0][1]) * d(matrix[2][2])) - (d(matrix[0][2]) * d(matrix[2][1]))
+                (d(matrix[0][1]) * d(matrix[2][2]))
+                - (d(matrix[0][2]) * d(matrix[2][1]))
             )
             cofactor_matrix[1][1] = (d(matrix[0][0]) * d(matrix[2][2])) - (
                 d(matrix[0][2]) * d(matrix[2][0])
             )
             cofactor_matrix[1][2] = -(
-                (d(matrix[0][0]) * d(matrix[2][1])) - (d(matrix[0][1]) * d(matrix[2][0]))
+                (d(matrix[0][0]) * d(matrix[2][1]))
+                - (d(matrix[0][1]) * d(matrix[2][0]))
             )
             cofactor_matrix[2][0] = (d(matrix[0][1]) * d(matrix[1][2])) - (
                 d(matrix[0][2]) * d(matrix[1][1])
             )
             cofactor_matrix[2][1] = -(
-                (d(matrix[0][0]) * d(matrix[1][2])) - (d(matrix[0][2]) * d(matrix[1][0]))
+                (d(matrix[0][0]) * d(matrix[1][2]))
+                - (d(matrix[0][2]) * d(matrix[1][0]))
             )
             cofactor_matrix[2][2] = (d(matrix[0][0]) * d(matrix[1][1])) - (
                 d(matrix[0][1]) * d(matrix[1][0])

physics/first_law_of_thermodynamics.py

@@ -73,10 +73,14 @@ def __categorize_system(argument_value: float, argument_name: str) -> None:
             elif argument_value > 0:
                 print("The internal energy of the system is increasing. It heating up.")
             elif argument_value < 0:
-                print("The internal energy of the system is decreasing. It cooling down.")
+                print(
+                    "The internal energy of the system is decreasing. It cooling down."
+                )
 
         case _:
-            raise ValueError("Should be 'work', 'heat', or 'internal_energy_variation'.")
+            raise ValueError(
+                "Should be 'work', 'heat', or 'internal_energy_variation'."
+            )
 
 
 def work(heat: float, internal_energy_variation: float) -> float: