Satisfy the linter

bzaczynski · bzaczynski · commit fe9b44e05a7e · 2022-06-07T09:30:07.000+02:00
diff --git a/hashtable/02_linear_probing/hashtable.py b/hashtable/02_linear_probing/hashtable.py
@@ -43,7 +43,8 @@ def __delitem__(self, key):
 
     def __setitem__(self, key, value):
         for index, pair in self._probe(key):
-            if pair is DELETED: continue
+            if pair is DELETED:
+                continue
             if pair is None or pair.key == key:
                 self._slots[index] = Pair(key, value)
                 break
diff --git a/hashtable/03_autoresize/hashtable.py b/hashtable/03_autoresize/hashtable.py
@@ -43,7 +43,8 @@ def __delitem__(self, key):
 
     def __setitem__(self, key, value):
         for index, pair in self._probe(key):
-            if pair is DELETED: continue
+            if pair is DELETED:
+                continue
             if pair is None or pair.key == key:
                 self._slots[index] = Pair(key, value)
                 break
diff --git a/hashtable/04_load_factor/hashtable.py b/hashtable/04_load_factor/hashtable.py
@@ -49,7 +49,8 @@ def __setitem__(self, key, value):
             self._resize_and_rehash()
 
         for index, pair in self._probe(key):
-            if pair is DELETED: continue
+            if pair is DELETED:
+                continue
             if pair is None or pair.key == key:
                 self._slots[index] = Pair(key, value)
                 break
