Ruff format

Author: insolor

_prepare_dev_data.py

@@ -2,6 +2,7 @@
 """
 Script for building test DAWGs.
 """
+
 import struct
 
 import dawg
@@ -40,7 +41,6 @@ def create_int_completion_dawg():
 
 
 def build_test_data() -> None:
-
     dawg.CompletionDAWG(["f", "bar", "foo", "foobar"]).save("dev_data/small/completion.dawg")
     dawg.CompletionDAWG([]).save("dev_data/small/completion-empty.dawg")
 

bench/speed.py

@@ -69,7 +69,6 @@ def load_int_dawg():
 
 
 def benchmark() -> None:
-
     tests = [
         ("__getitem__ (hits)", "for word in WORDS100k: data[word]", "M ops/sec", 0.1, 3),
         ("get() (hits)", "for word in WORDS100k: data.get(word)", "M ops/sec", 0.1, 3),

dawg_python/dawgs.py

@@ -20,6 +20,7 @@ class DAWG:
     """
     Base DAWG wrapper.
     """
+
     dct: wrapper.Dictionary | None
 
     def __init__(self) -> None:
@@ -41,7 +42,6 @@ def _has_value(self, index: int) -> bool:
         return self.dct.has_value(index)
 
     def _similar_keys(self, current_prefix: str, key: str, index: int, replace_chars: CompiledReplaces) -> list[str]:
-
         res = []
         start_pos = len(current_prefix)
         end_pos = len(key)
@@ -51,7 +51,7 @@ def _similar_keys(self, current_prefix: str, key: str, index: int, replace_chars
             b_step = key[word_pos].encode("utf8")
 
             if b_step in replace_chars:
-                for (b_replace_char, u_replace_char) in replace_chars[b_step]:
+                for b_replace_char, u_replace_char in replace_chars[b_step]:
                     next_index = index
 
                     next_index = self.dct.follow_bytes(b_replace_char, next_index)
@@ -89,22 +89,18 @@ def similar_keys(self, key: str, replaces: CompiledReplaces):
 
     @classmethod
     def compile_replaces(cls, replaces: Replaces) -> CompiledReplaces:
-
-        for k,v in replaces.items():
+        for k, v in replaces.items():
             if len(k) != 1:
                 msg = "Keys must be single-char unicode strings."
                 raise ValueError(msg)
-            if (isinstance(v, str) and len(v) != 1):
+            if isinstance(v, str) and len(v) != 1:
                 msg = "Values must be single-char unicode strings or non-empty lists of such."
                 raise ValueError(msg)
             if isinstance(v, list) and (any(len(v_entry) != 1 for v_entry in v) or len(v) < 1):
                 msg = "Values must be single-char unicode strings or non-empty lists of such."
                 raise ValueError(msg)
 
-        return {
-            k.encode("utf8"): [(v_entry.encode("utf8"), v_entry) for v_entry in v]
-            for k, v in replaces.items()
-        }
+        return {k.encode("utf8"): [(v_entry.encode("utf8"), v_entry) for v_entry in v] for k, v in replaces.items()}
 
     def prefixes(self, key: str | bytes) -> list[str]:
         """
@@ -133,6 +129,7 @@ class CompletionDAWG(DAWG):
     """
     DAWG with key completion support.
     """
+
     dct: wrapper.Dictionary
     guide: wrapper.Guide | None
 
@@ -331,8 +328,13 @@ def iteritems(self, prefix: str | bytes = "") -> Generator[tuple[str, bytes], No
     def _has_value(self, index: int) -> int | None:
         return self.dct.follow_bytes(PAYLOAD_SEPARATOR, index)
 
-    def _similar_items(self, current_prefix: str, key: str, index: int, replace_chars: CompiledReplaces) -> list[tuple[str, bytes]]:
-
+    def _similar_items(
+        self,
+        current_prefix: str,
+        key: str,
+        index: int,
+        replace_chars: CompiledReplaces,
+    ) -> list[tuple[str, bytes]]:
         res = []
         start_pos = len(current_prefix)
         end_pos = len(key)
@@ -342,7 +344,7 @@ def _similar_items(self, current_prefix: str, key: str, index: int, replace_char
             b_step = key[word_pos].encode("utf8")
 
             if b_step in replace_chars:
-                for (b_replace_char, u_replace_char) in replace_chars[b_step]:
+                for b_replace_char, u_replace_char in replace_chars[b_step]:
                     next_index = index
 
                     next_index = self.dct.follow_bytes(b_replace_char, next_index)
@@ -378,7 +380,13 @@ def similar_items(self, key: str, replaces: CompiledReplaces) -> list[tuple[str,
         """
         return self._similar_items("", key, self.dct.ROOT, replaces)
 
-    def _similar_item_values(self, start_pos: int, key: str, index: int, replace_chars: CompiledReplaces) -> list[bytes]:
+    def _similar_item_values(
+        self,
+        start_pos: int,
+        key: str,
+        index: int,
+        replace_chars: CompiledReplaces,
+    ) -> list[bytes]:
         res = []
         end_pos = len(key)
         word_pos = start_pos
@@ -387,7 +395,7 @@ def _similar_item_values(self, start_pos: int, key: str, index: int, replace_cha
             b_step = key[word_pos].encode("utf8")
 
             if b_step in replace_chars:
-                for (b_replace_char, _u_replace_char) in replace_chars[b_step]:
+                for b_replace_char, _u_replace_char in replace_chars[b_step]:
                     next_index = index
 
                     next_index = self.dct.follow_bytes(b_replace_char, next_index)

dawg_python/units.py

@@ -1,6 +1,7 @@
 """
 Unit of a dictionary
 """
+
 PRECISION_MASK = 0xFFFFFFFF
 
 OFFSET_MAX = 1 << 21

dawg_python/wrapper.py

@@ -82,7 +82,6 @@ def load(cls, path) -> Self:
 
 
 class Guide:
-
     ROOT = 0
 
     def __init__(self) -> None:
@@ -106,14 +105,14 @@ class Completer:
     _dic: Dictionary | None
     _guide: Guide | None
 
-    def __init__(self, dic: Dictionary | None =None, guide: Guide | None=None) -> None:
+    def __init__(self, dic: Dictionary | None = None, guide: Guide | None = None) -> None:
         self._dic = dic
         self._guide = guide
 
     def value(self) -> int:
         return self._dic.value(self._last_index)
 
-    def start(self, index: int, prefix: bytes=b"") -> None:
+    def start(self, index: int, prefix: bytes = b"") -> None:
         self.key = bytearray(prefix)
 
         if self._guide.size():
@@ -131,7 +130,6 @@ def next(self) -> bool:
         index = self._index_stack[-1]
 
         if self._last_index != self._dic.ROOT:
-
             child_label = self._guide.child(index)  # UCharType
 
             if child_label:

tests/test_payload_dawg.py

@@ -6,7 +6,6 @@
 
 
 class TestBytesDAWG:
-
     DATA = (
         ("foo", b"data1"),
         ("bar", b"data2"),
@@ -82,7 +81,6 @@ def test_prefixes(self):
 
 
 class TestRecordDAWG:
-
     STRUCTURED_DATA = (
         ("foo", (3, 2, 256)),
         ("bar", (3, 1, 0)),

tests/test_prediction.py

@@ -13,7 +13,6 @@ def encode(w):
 
 
 class TestPrediction:
-
     REPLACES = dawg_python.DAWG.compile_replaces({"Е": "Ё"})
 
     DATA = ["ЁЖИК", "ЁЖИКЕ", "ЁЖ", "ДЕРЕВНЯ", "ДЕРЁВНЯ", "ЕМ", "ОЗЕРА", "ОЗЁРА", "ОЗЕРО"]
@@ -73,7 +72,6 @@ def test_record_dawg_items_values(self, word, prediction):
 
 
 class TestMultiValuedPrediction:
-
     REPLACES = dawg_python.DAWG.compile_replaces({"е": ["ё", "ѣ"], "и": "і"})
 
     DATA = "хлѣб ёлка ель лѣс лѣсное всё всѣ бѣлёная изобрѣтён лев лёв лѣв вѣнскій".split(" ")
@@ -101,9 +99,9 @@ class TestMultiValuedPrediction:
 
     SUITE_ITEMS = [
         (
-            it[0], # key
+            it[0],  # key
             [
-                (w, [encode(w)]) # item, value pair
+                (w, [encode(w)])  # item, value pair
                 for w in it[1]
             ],
         )
@@ -112,7 +110,7 @@ class TestMultiValuedPrediction:
 
     SUITE_VALUES = [
         (
-            it[0], # key
+            it[0],  # key
             [[encode(w)] for w in it[1]],
         )
         for it in SUITE