Merge pull request #311 from bellshade/pre-commit-ci-update-config

[pre-commit.ci] pre-commit autoupdate

.pre-commit-config.yaml

@@ -14,7 +14,7 @@ repos:
       - id: auto-walrus
 
   - repo: https://github.com/psf/black
-    rev: 23.12.1
+    rev: 24.1.1
     hooks:
       - id: black
 

Basic/04_operator/operator_penugasan_ekspresi.py

@@ -16,7 +16,6 @@
 +------------+--------------+-----------------+
 """
 
-
 # Contoh dibawah ini dapat dilihat perbedaannya jika melalui CLI Python
 # Tidak akan mengembalikan nilai, hanya melakukan pengisian
 # walrus = False

algorithm/arithmetic_analysis/in_static_equilibrium.py

@@ -2,7 +2,6 @@
 Memeriksa apakah sistem gaya berada dalam kesetimbangan statis.
 """
 
-
 from numpy import array, cos, cross, ndarray, radians, sin
 
 

algorithm/matrix/matrix_class.py

@@ -120,9 +120,11 @@ def cofactors(self):
         return Matrix(
             [
                 [
-                    self.minors().rows[row][column]
-                    if (row + column) % 2 == 0
-                    else self.minors().rows[row][column] * -1
+                    (
+                        self.minors().rows[row][column]
+                        if (row + column) % 2 == 0
+                        else self.minors().rows[row][column] * -1
+                    )
                     for column in range(self.minors().num_columns)
                 ]
                 for row in range(self.minors().num_rows)

algorithm/searching/_types.py

@@ -8,8 +8,6 @@
 @runtime_checkable
 class SizedIndexable(Iterable[T], Protocol[T]):
     @overload
-    def __getitem__(self, key: slice) -> SizedIndexable[T]:
-        ...
+    def __getitem__(self, key: slice) -> SizedIndexable[T]: ...
 
-    def __len__(self) -> int:
-        ...
+    def __len__(self) -> int: ...

algorithm/searching/binary_search.py

@@ -25,6 +25,7 @@
 
 https://en.wikipedia.org/wiki/Binary_search_algorithm
 """
+
 from __future__ import annotations
 
 from typing import Any, Protocol, TypeVar
@@ -33,14 +34,12 @@
 
 
 class Comparable(Protocol):
-    def __lt__(self, other: Any) -> bool:
-        ...
+    def __lt__(self, other: Any) -> bool: ...
 
     def __le__(self, other: Any) -> bool:
         """Hanya untuk suppress LGTM alert."""
 
-    def __gt__(self, other: Any) -> bool:
-        ...
+    def __gt__(self, other: Any) -> bool: ...
 
     def __ge__(self, other: Any) -> bool:
         """Hanya untuk suppress LGTM alert."""

algorithm/searching/linear_search.py

@@ -14,6 +14,7 @@
 
 https://en.wikipedia.org/wiki/Linear_search
 """
+
 from __future__ import annotations
 
 from typing import TypeVar

implementation/artificial_intelligence/random_forest.py

@@ -8,6 +8,7 @@
         Pendekatan ansambel ini membantu meningkatkan akurasi dan ketahanan model
         secara keseluruhan.
 """
+
 import numpy as np
 from typing import Union
 

implementation/chiper/hill_chiper.py

@@ -19,6 +19,7 @@
 panjang teks mencapai kelipatan dari break_key. Jadi teks setelah
 dekripsi mungkin sedikit berbeda dari teks aslinya.
 """
+
 import string
 
 import numpy

implementation/physics/n_body_simulation.py

@@ -131,9 +131,7 @@ def update_system(self, delta_time: float) -> None:
                     dif_x = body2.position_x - body1.position_x
                     dif_y = body2.position_y - body1.position_y
 
-                    distance = (dif_x**2 + dif_y**2 + self.softening_factor) ** (
-                        1 / 2
-                    )
+                    distance = (dif_x**2 + dif_y**2 + self.softening_factor) ** (1 / 2)
                     force_x += (
                         self.gravitation_constant * body2.mass * dif_x / distance**3
                     )

struktur_data/tree/binary_search_tree/binary_tree_path_sum.py

@@ -40,6 +40,7 @@ class BinaryTreePathSum:
     >>> BinaryTreePathSum().path_sum(tree, 8)
     2
     """
+
     target: int
 
     def __init__(self) -> None: