Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 4fe50bc

Browse files
pre-commit-ci[bot]cclauss
andauthored
[pre-commit.ci] pre-commit autoupdate -- ruff 2025 stable format (#12521)
* [pre-commit.ci] pre-commit autoupdate updates: - [github.com/astral-sh/ruff-pre-commit: v0.8.6 → v0.9.1](astral-sh/ruff-pre-commit@v0.8.6...v0.9.1) * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Update maths/dual_number_automatic_differentiation.py * Update maths/dual_number_automatic_differentiation.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Update dual_number_automatic_differentiation.py * Update dual_number_automatic_differentiation.py * No <fin-streamer> tag with the specified data-test attribute found. --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> Co-authored-by: Christian Clauss <cclauss@me.com>
1 parent cfcc84e commit 4fe50bc

23 files changed

+93
-91
lines changed

‎.pre-commit-config.yaml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -16,7 +16,7 @@ repos:
1616
- id: auto-walrus
1717

1818
- repo: https://github.com/astral-sh/ruff-pre-commit
19-
rev: v0.8.6
19+
rev: v0.9.1
2020
hooks:
2121
- id: ruff
2222
- id: ruff-format

‎ciphers/base64_cipher.py

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -105,13 +105,13 @@ def base64_decode(encoded_data: str) -> bytes:
105105

106106
# Check if the encoded string contains non base64 characters
107107
if padding:
108-
assert all(
109-
charinB64_CHARSETforcharinencoded_data[:-padding]
110-
), "Invalid base64 character(s) found."
108+
assert all(charinB64_CHARSETforcharinencoded_data[:-padding]), (
109+
"Invalid base64 character(s) found."
110+
)
111111
else:
112-
assert all(
113-
charinB64_CHARSETforcharinencoded_data
114-
), "Invalid base64 character(s) found."
112+
assert all(charinB64_CHARSETforcharinencoded_data), (
113+
"Invalid base64 character(s) found."
114+
)
115115

116116
# Check the padding
117117
assert len(encoded_data) % 4 == 0 and padding < 3, "Incorrect padding"

‎ciphers/caesar_cipher.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -225,7 +225,7 @@ def brute_force(input_string: str, alphabet: str | None = None) -> dict[int, str
225225

226226
if __name__ == "__main__":
227227
while True:
228-
print(f'\n{"-" * 10}\n Menu\n{"-" * 10}')
228+
print(f"\n{'-' * 10}\n Menu\n{'-' * 10}")
229229
print(*["1.Encrypt", "2.Decrypt", "3.BruteForce", "4.Quit"], sep="\n")
230230

231231
# get user input

‎computer_vision/flip_augmentation.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -33,7 +33,7 @@ def main() -> None:
3333
file_name = paths[index].split(os.sep)[-1].rsplit(".", 1)[0]
3434
file_root = f"{OUTPUT_DIR}/{file_name}_FLIP_{letter_code}"
3535
cv2.imwrite(f"{file_root}.jpg", image, [cv2.IMWRITE_JPEG_QUALITY, 85])
36-
print(f"Success {index+1}/{len(new_images)} with {file_name}")
36+
print(f"Success {index+1}/{len(new_images)} with {file_name}")
3737
annos_list = []
3838
for anno in new_annos[index]:
3939
obj = f"{anno[0]} {anno[1]} {anno[2]} {anno[3]} {anno[4]}"

‎computer_vision/mosaic_augmentation.py

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -41,7 +41,7 @@ def main() -> None:
4141
file_name = path.split(os.sep)[-1].rsplit(".", 1)[0]
4242
file_root = f"{OUTPUT_DIR}/{file_name}_MOSAIC_{letter_code}"
4343
cv2.imwrite(f"{file_root}.jpg", new_image, [cv2.IMWRITE_JPEG_QUALITY, 85])
44-
print(f"Succeeded {index+1}/{NUMBER_IMAGES} with {file_name}")
44+
print(f"Succeeded {index+1}/{NUMBER_IMAGES} with {file_name}")
4545
annos_list = []
4646
for anno in new_annos:
4747
width = anno[3] - anno[1]

‎data_structures/hashing/number_theory/prime_numbers.py

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -32,9 +32,9 @@ def is_prime(number: int) -> bool:
3232
"""
3333

3434
# precondition
35-
assert isinstance(number, int) and (
36-
number>=0
37-
), "'number' must been an int and positive"
35+
assert isinstance(number, int) and (number>=0), (
36+
"'number' must been an int and positive"
37+
)
3838

3939
if 1 < number < 4:
4040
# 2 and 3 are primes

‎data_structures/heap/min_heap.py

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -124,9 +124,9 @@ def is_empty(self):
124124
return len(self.heap) == 0
125125

126126
def decrease_key(self, node, new_value):
127-
assert (
128-
self.heap[self.idx_of_element[node]].val>new_value
129-
), "newValue must be less that current value"
127+
assert self.heap[self.idx_of_element[node]].val>new_value, (
128+
"newValue must be less that current value"
129+
)
130130
node.val = new_value
131131
self.heap_dict[node.name] = new_value
132132
self.sift_up(self.idx_of_element[node])

‎data_structures/kd_tree/tests/test_kdtree.py

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -48,14 +48,14 @@ def test_build_kdtree(num_points, cube_size, num_dimensions, depth, expected_res
4848
assert kdtree is not None, "Expected a KDNode, got None"
4949

5050
# Check if root has correct dimensions
51-
assert (
52-
len(kdtree.point)==num_dimensions
53-
), f"Expected point dimension {num_dimensions}, got {len(kdtree.point)}"
51+
assert len(kdtree.point) ==num_dimensions, (
52+
f"Expected point dimension {num_dimensions}, got {len(kdtree.point)}"
53+
)
5454

5555
# Check that the tree is balanced to some extent (simplistic check)
56-
assert isinstance(
57-
kdtree, KDNode
58-
), f"Expected KDNode instance, got {type(kdtree)}"
56+
assert isinstance(kdtree, KDNode), (
57+
f"Expected KDNode instance, got {type(kdtree)}"
58+
)
5959

6060

6161
def test_nearest_neighbour_search():

‎data_structures/suffix_tree/tests/test_suffix_tree.py

Lines changed: 12 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -22,37 +22,37 @@ def test_search_existing_patterns(self) -> None:
2222
patterns = ["ana", "ban", "na"]
2323
for pattern in patterns:
2424
with self.subTest(pattern=pattern):
25-
assert self.suffix_tree.search(
26-
pattern
27-
), f"Pattern '{pattern}' should be found."
25+
assert self.suffix_tree.search(pattern), (
26+
f"Pattern '{pattern}' should be found."
27+
)
2828

2929
def test_search_non_existing_patterns(self) -> None:
3030
"""Test searching for patterns that do not exist in the suffix tree."""
3131
patterns = ["xyz", "apple", "cat"]
3232
for pattern in patterns:
3333
with self.subTest(pattern=pattern):
34-
assert not self.suffix_tree.search(
35-
pattern
36-
), f"Pattern '{pattern}' should not be found."
34+
assert not self.suffix_tree.search(pattern), (
35+
f"Pattern '{pattern}' should not be found."
36+
)
3737

3838
def test_search_empty_pattern(self) -> None:
3939
"""Test searching for an empty pattern."""
4040
assert self.suffix_tree.search(""), "An empty pattern should be found."
4141

4242
def test_search_full_text(self) -> None:
4343
"""Test searching for the full text."""
44-
assert self.suffix_tree.search(
45-
self.text
46-
), "The full text should be found in the suffix tree."
44+
assert self.suffix_tree.search(self.text), (
45+
"The full text should be found in the suffix tree."
46+
)
4747

4848
def test_search_substrings(self) -> None:
4949
"""Test searching for substrings of the full text."""
5050
substrings = ["ban", "ana", "a", "na"]
5151
for substring in substrings:
5252
with self.subTest(substring=substring):
53-
assert self.suffix_tree.search(
54-
substring
55-
), f"Substring '{substring}' should be found."
53+
assert self.suffix_tree.search(substring), (
54+
f"Substring '{substring}' should be found."
55+
)
5656

5757

5858
if __name__ == "__main__":

‎dynamic_programming/climbing_stairs.py

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -25,9 +25,9 @@ def climb_stairs(number_of_steps: int) -> int:
2525
...
2626
AssertionError: number_of_steps needs to be positive integer, your input -7
2727
"""
28-
assert (
29-
isinstance(number_of_steps, int) andnumber_of_steps>0
30-
), f"number_of_steps needs to be positive integer, your input {number_of_steps}"
28+
assert isinstance(number_of_steps, int) andnumber_of_steps>0, (
29+
f"number_of_steps needs to be positive integer, your input {number_of_steps}"
30+
)
3131
if number_of_steps == 1:
3232
return 1
3333
previous, current = 1, 1

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /