feat: add ruff rules

Author: everysoftware

pyproject.toml

@@ -13,10 +13,23 @@ select = [
     "B",  # flake8-bugbear
     "C4",  # flake8-comprehensions
     "UP",  # pyupgrade
+    "RUF",  # ruff rules
+    "C90",  # mccabe
+    "N",  # pep8-naming
+    "ASYNC",  # flake8-async
+    "C4",  # flake8-comprehensions
+    "T20",  # flake8-print
+    "SIM",  # flake8-simplify
+    "PT",  # flake8-pytest-style
+    "PTH",  # flake8-puse-pathlib
+    "TCH",  # flake8-type-checking
+    "PERF",  # Perflint
 ]
 ignore = [
-    "E501",  # line too long, handled by ruff
+    "E501",  # line too long, handled by formatter later
     "B008",  # do not perform function calls in argument defaults
     "C901",  # too complex
     "W191",  # indentation contains tabs
+    "RUF002",  # docstring contains ambiguous letter
+    "RUF003"  # comment contains amgiuos letter
 ]

src/g_prefix_sums/null_exchange.py

@@ -14,5 +14,5 @@ def null_exchange(a: list[int]) -> int:
         if curr_sum in p:
             count += p[curr_sum]
         # Добавляем текущую сумму в словарь или увеличиваем ее счетчик на один
-        p[curr_sum] = (p[curr_sum] if curr_sum in p else 0) + 1
+        p[curr_sum] = (p.get(curr_sum, 0)) + 1
     return count

src/h_number_theory/count_primes.py

@@ -26,7 +26,4 @@ def count_primes_sieve(n: int) -> int:
 def is_prime_sqrt(n: int) -> bool:
     if n < 2:
         return False
-    for i in range(2, int(n**0.5) + 1):
-        if n % i == 0:
-            return False
-    return True
+    return all(n % i != 0 for i in range(2, int(n**0.5) + 1))

src/h_number_theory/divisors.py

@@ -3,7 +3,7 @@ def divisors_naive(n: int) -> bool:
     divisors = []
     for i in range(1, n + 1):
         if n % i == 0:
-            divisors.append(i)
+            divisors.append(i)  # noqa: PERF401
     return len(divisors) == 3
 
 
@@ -22,10 +22,7 @@ def divisors_sqrt(n: int) -> bool:
 def closest_divisors(n: int) -> list[int]:
     closest1 = two_closest(n + 1)
     closest2 = two_closest(n + 2)
-    if closest1[1] - closest1[0] < closest2[1] - closest2[0]:
-        result = closest1
-    else:
-        result = closest2
+    result = closest1 if closest1[1] - closest1[0] < closest2[1] - closest2[0] else closest2
     return result
 
 

src/j_greedy/convex_hull.py

@@ -20,11 +20,15 @@ def convex_hull(points: list[tuple[int, int]]) -> list[tuple[int, int]]:
         # Учитываем коллинеарные точки - добавляем их в оболочку
         # Коллинеарные точки - это точки, лежащие на одной прямой с точками point и q
         for r in range(n):
-            if r != point and r != q and orientation(points[point], points[q], points[r]) == 0:
-                if on_segment(points[point], points[r], points[q]):
-                    if points[r] not in visited:
-                        hull.append(points[r])
-                        visited.add(points[r])
+            if (
+                r != point
+                and r != q
+                and orientation(points[point], points[q], points[r]) == 0
+                and on_segment(points[point], points[r], points[q])
+                and points[r] not in visited
+            ):
+                hull.append(points[r])
+                visited.add(points[r])
         # Переходим к следующей точке
         point = q
         if point == left:
@@ -35,11 +39,12 @@ def convex_hull(points: list[tuple[int, int]]) -> list[tuple[int, int]]:
 def left_index(points: list[tuple[int, int]]) -> int:
     left_most = 0
     for i in range(1, len(points)):
-        if points[i][0] < points[left_most][0]:
+        if (
+            points[i][0] < points[left_most][0]
+            or points[i][0] == points[left_most][0]
+            and points[i][1] > points[left_most][1]
+        ):
             left_most = i
-        elif points[i][0] == points[left_most][0]:
-            if points[i][1] > points[left_most][1]:
-                left_most = i
     return left_most
 
 

src/j_greedy/huffman.py

@@ -33,7 +33,7 @@
 e -> 01
 
 encoded = "111111111111100100101101101000000000101010101"
-"""  # noqa
+"""
 
 
 # O(n)

tests/test_base_ds/test_bank_queue.py

@@ -4,7 +4,7 @@
 
 
 @pytest.mark.parametrize(
-    "n, clients, expected",
+    ("n", "clients", "expected"),
     [
         (2, [(1, 10), (2, 5), (3, 7)], 1.333333),
         (1, [(1, 1), (2, 1), (3, 1)], 0),

tests/test_base_ds/test_brackets.py

@@ -4,7 +4,7 @@
 
 
 @pytest.mark.parametrize(
-    "s, expected",
+    ("s", "expected"),
     [
         ("[]", None),
         ("{}", None),

tests/test_base_ds/test_calculator.py

@@ -9,7 +9,7 @@
 
 
 @pytest.mark.parametrize(
-    "expression, expected",
+    ("expression", "expected"),
     [
         # Базовый случай.
         ("2+2", ["2", "+", "2"]),
@@ -30,7 +30,7 @@ def test_split_by_tokens(expression: str, expected: list[str]) -> None:
 
 
 @pytest.mark.parametrize(
-    "expression, expected",
+    ("expression", "expected"),
     [
         # Тестовый случай 1: Простое выражение без скобок.
         ("2 + 2", "2 2 +"),
@@ -47,7 +47,7 @@ def test_get_postfix_notation(expression: str, expected: str) -> None:
 
 
 @pytest.mark.parametrize(
-    "expression, expected",
+    ("expression", "expected"),
     [
         # Тестовый случай 1: Простое выражение без скобок.
         ("2 2 +", 4.0),
@@ -64,7 +64,7 @@ def test_evaluate_postfix(expression: str, expected: float) -> None:
 
 
 @pytest.mark.parametrize(
-    "expression, expected",
+    ("expression", "expected"),
     [
         # Тест из условия задачи.
         ("(1+2)*4+3", 15.0),

tests/test_base_ds/test_max_stack.py

@@ -4,7 +4,7 @@
 
 
 @pytest.mark.parametrize(
-    "operations, expected",
+    ("operations", "expected"),
     [
         (
             [