Enable ruff ARG001 rule (#11321) · maxi032/PythonAlgorithms@a936e94 · GitHub
Skip to content

Commit a936e94

Browse files
MaximSmolskiypre-commit-ci[bot]
MaximSmolskiy
and
pre-commit-ci[bot]
authored
Enable ruff ARG001 rule (TheAlgorithms#11321)
* Enable ruff ARG001 rule * Fix dynamic_programming/combination_sum_iv.py * Fix machine_learning/frequent_pattern_growth.py * Fix other/davis_putnam_logemann_loveland.py * Fix other/password.py * Fix * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Fix physics/n_body_simulation.py * Fix project_euler/problem_145/sol1.py * Fix project_euler/problem_174/sol1.py * Fix scheduling/highest_response_ratio_next.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Fix * Fix * Fix scheduling/job_sequencing_with_deadline.py * Fix scheduling/job_sequencing_with_deadline.py * Fix * Fix --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
1 parent 8faf823 commit a936e94

11 files changed

Lines changed: 22 additions & 31 deletions

File tree

‎dynamic_programming/combination_sum_iv.py‎

Lines changed: 5 additions & 6 deletions

‎machine_learning/frequent_pattern_growth.py‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -240,7 +240,7 @@ def ascend_tree(leaf_node: TreeNode, prefix_path: list[str]) -> None:
240240
ascend_tree(leaf_node.parent, prefix_path)
241241

242242

243-
def find_prefix_path(base_pat: frozenset, tree_node: TreeNode | None) -> dict:
243+
def find_prefix_path(base_pat: frozenset, tree_node: TreeNode | None) -> dict: # noqa: ARG001
244244
"""
245245
Find the conditional pattern base for a given base pattern.
246246
@@ -277,7 +277,7 @@ def find_prefix_path(base_pat: frozenset, tree_node: TreeNode | None) -> dict:
277277

278278

279279
def mine_tree(
280-
in_tree: TreeNode,
280+
in_tree: TreeNode, # noqa: ARG001
281281
header_table: dict,
282282
min_sup: int,
283283
pre_fix: set,

‎other/davis_putnam_logemann_loveland.py‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -227,7 +227,8 @@ def find_pure_symbols(
227227

228228

229229
def find_unit_clauses(
230-
clauses: list[Clause], model: dict[str, bool | None]
230+
clauses: list[Clause],
231+
model: dict[str, bool | None], # noqa: ARG001
231232
) -> tuple[list[str], dict[str, bool | None]]:
232233
"""
233234
Returns the unit symbols and their values to satisfy clause.

‎other/password.py‎

Lines changed: 0 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -51,18 +51,6 @@ def random(chars_incl: str, i: int) -> str:
5151
return "".join(secrets.choice(chars_incl) for _ in range(i))
5252

5353

54-
def random_number(chars_incl, i):
55-
pass # Put your code here...
56-
57-
58-
def random_letters(chars_incl, i):
59-
pass # Put your code here...
60-
61-
62-
def random_characters(chars_incl, i):
63-
pass # Put your code here...
64-
65-
6654
def is_strong_password(password: str, min_length: int = 8) -> bool:
6755
"""
6856
This will check whether a given password is strong or not. The password must be at

‎physics/n_body_simulation.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -239,7 +239,7 @@ def plot(
239239
ax.add_patch(patch)
240240

241241
# Function called at each step of the animation
242-
def update(frame: int) -> list[plt.Circle]:
242+
def update(frame: int) -> list[plt.Circle]: # noqa: ARG001
243243
update_step(body_system, DELTA_TIME, patches)
244244
return patches
245245

‎project_euler/problem_145/sol1.py‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -110,7 +110,7 @@ def reversible_numbers(
110110
if (length - 1) % 4 == 0:
111111
return 0
112112

113-
return slow_reversible_numbers(length, 0, [0] * length, length)
113+
return slow_reversible_numbers(remaining_length, remainder, digits, length)
114114

115115

116116
def solution(max_power: int = 9) -> int:

‎project_euler/problem_174/sol1.py‎

Lines changed: 3 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -26,6 +26,8 @@ def solution(t_limit: int = 1000000, n_limit: int = 10) -> int:
2626
Return the sum of N(n) for 1 <= n <= n_limit.
2727
2828
>>> solution(1000,5)
29+
222
30+
>>> solution(1000,10)
2931
249
3032
>>> solution(10000,10)
3133
2383
@@ -45,7 +47,7 @@ def solution(t_limit: int = 1000000, n_limit: int = 10) -> int:
4547
for hole_width in range(hole_width_lower_bound, outer_width - 1, 2):
4648
count[outer_width * outer_width - hole_width * hole_width] += 1
4749

48-
return sum(1 for n in count.values() if 1 <= n <= 10)
50+
return sum(1 for n in count.values() if 1 <= n <= n_limit)
4951

5052

5153
if __name__ == "__main__":

‎pyproject.toml‎

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,5 @@
11
[tool.ruff]
22
lint.ignore = [ # `ruff rule S101` for a description of that rule
3-
"ARG001", # Unused function argument `amount` -- FIX ME?
43
"B904", # Within an `except` clause, raise exceptions with `raise ... from err` -- FIX ME
54
"B905", # `zip()` without an explicit `strict=` parameter -- FIX ME
65
"DTZ001", # The use of `datetime.datetime()` without `tzinfo` argument is not allowed -- FIX ME

‎scheduling/highest_response_ratio_next.py‎

Lines changed: 4 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -75,7 +75,10 @@ def calculate_turn_around_time(
7575

7676

7777
def calculate_waiting_time(
78-
process_name: list, turn_around_time: list, burst_time: list, no_of_process: int
78+
process_name: list, # noqa: ARG001
79+
turn_around_time: list,
80+
burst_time: list,
81+
no_of_process: int,
7982
) -> list:
8083
"""
8184
Calculate the waiting time of each processes.

‎scheduling/job_sequencing_with_deadline.py‎

Lines changed: 3 additions & 4 deletions

0 commit comments

Comments
 (0)