pre-commit: Upgrade psf/black for stable style 2023 (#8110) · ashapochka/TheAlgorithmsPython@c909da9 · GitHub
Skip to content

Commit c909da9

Browse files
cclausspre-commit-ci[bot]
cclauss
and
pre-commit-ci[bot]
authored
pre-commit: Upgrade psf/black for stable style 2023 (TheAlgorithms#8110)
* pre-commit: Upgrade psf/black for stable style 2023 Updating https://github.com/psf/black ... updating 22.12.0 -> 23.1.0 for their `2023 stable style`. * https://github.com/psf/black/blob/main/CHANGES.md#2310 > This is the first [psf/black] release of 2023, and following our stability policy, it comes with a number of improvements to our stable style… Also, add https://github.com/tox-dev/pyproject-fmt and https://github.com/abravalheri/validate-pyproject to pre-commit. I only modified `.pre-commit-config.yaml` and all other files were modified by pre-commit.ci and psf/black. * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
1 parent ed0a581 commit c909da9

97 files changed

Lines changed: 19 additions & 154 deletions

File tree

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

‎.pre-commit-config.yaml‎

Lines changed: 11 additions & 1 deletion

‎arithmetic_analysis/newton_raphson_new.py‎

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -59,7 +59,6 @@ def newton_raphson(
5959

6060
# Let's Execute
6161
if __name__ == "__main__":
62-
6362
# Find root of trigonometric function
6463
# Find value of pi
6564
print(f"The root of sin(x) = 0 is {newton_raphson('sin(x)', 2)}")

‎backtracking/n_queens_math.py‎

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -107,7 +107,6 @@ def depth_first_search(
107107

108108
# We iterate each column in the row to find all possible results in each row
109109
for col in range(n):
110-
111110
# We apply that we learned previously. First we check that in the current board
112111
# (possible_board) there are not other same value because if there is it means
113112
# that there are a collision in vertical. Then we apply the two formulas we

‎blockchain/chinese_remainder_theorem.py‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -53,6 +53,7 @@ def chinese_remainder_theorem(n1: int, r1: int, n2: int, r2: int) -> int:
5353

5454
# ----------SAME SOLUTION USING InvertModulo instead ExtendedEuclid----------------
5555

56+
5657
# This function find the inverses of a i.e., a^(-1)
5758
def invert_modulo(a: int, n: int) -> int:
5859
"""

‎ciphers/enigma_machine2.py‎

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -230,7 +230,6 @@ def enigma(
230230
# encryption/decryption process --------------------------
231231
for symbol in text:
232232
if symbol in abc:
233-
234233
# 1st plugboard --------------------------
235234
if symbol in plugboard:
236235
symbol = plugboard[symbol]

‎ciphers/playfair_cipher.py‎

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -39,7 +39,6 @@ def prepare_input(dirty: str) -> str:
3939

4040

4141
def generate_table(key: str) -> list[str]:
42-
4342
# I and J are used interchangeably to allow
4443
# us to use a 5x5 table (25 letters)
4544
alphabet = "ABCDEFGHIKLMNOPQRSTUVWXYZ"

‎ciphers/polybius.py‎

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,6 @@
1919

2020
class PolybiusCipher:
2121
def __init__(self) -> None:
22-
2322
self.SQUARE = np.array(SQUARE)
2423

2524
def letter_to_numbers(self, letter: str) -> np.ndarray:

‎ciphers/xor_cipher.py‎

Lines changed: 0 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -130,7 +130,6 @@ def encrypt_file(self, file: str, key: int = 0) -> bool:
130130
try:
131131
with open(file) as fin:
132132
with open("encrypt.out", "w+") as fout:
133-
134133
# actual encrypt-process
135134
for line in fin:
136135
fout.write(self.encrypt_string(line, key))
@@ -155,7 +154,6 @@ def decrypt_file(self, file: str, key: int) -> bool:
155154
try:
156155
with open(file) as fin:
157156
with open("decrypt.out", "w+") as fout:
158-
159157
# actual encrypt-process
160158
for line in fin:
161159
fout.write(self.decrypt_string(line, key))

‎compression/lz77.py‎

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -89,7 +89,6 @@ def compress(self, text: str) -> list[Token]:
8989

9090
# while there are still characters in text to compress
9191
while text:
92-
9392
# find the next encoding phrase
9493
# - triplet with offset, length, indicator (the next encoding character)
9594
token = self._find_encoding_token(text, search_buffer)

‎computer_vision/cnn_classification.py‎

Lines changed: 0 additions & 1 deletion

0 commit comments

Comments
 (0)