Merge pull request #1642 from mabel-dev/HOUSEKEEPING/4

Housekeeping/4

opteryx/__version__.py

@@ -1,4 +1,4 @@
-__build__ = 484
+__build__ = 486
 
 # Licensed under the Apache License, Version 2.0 (the "License");
 # you may not use this file except in compliance with the License.

opteryx/managers/schemes/mabel_partitions.py

@@ -126,11 +126,11 @@ def _inner(*, timestamp):
                 raise UnsupportedSegementationError(dataset=prefix, segments=segments)
 
             as_at = None
-            as_ats = sorted(as_ats)
+            as_at_list = sorted(as_ats)
 
             # Keep popping from as_ats until a valid frame is found
-            while as_ats:
-                as_at = as_ats.pop()
+            while as_at_list:
+                as_at = as_at_list.pop()
                 if as_at is None:
                     continue
                 if is_complete_and_not_invalid(control_blobs, as_at):

opteryx/operators/async_read_node.py

@@ -108,7 +108,7 @@ def to_dict(self) -> dict:  # pragma: no cover
         raise NotImplementedError()
 
     @classmethod
-    def from_dict(cls, dic: dict) -> "BasePlanNode":  # pragma: no cover
+    def from_dict(cls, dic: dict) -> "AsyncReaderNode":  # pragma: no cover
         raise NotImplementedError()
 
     def execute(self) -> Generator:

opteryx/operators/base_plan_node.py

@@ -57,6 +57,9 @@ def from_dict(cls, dic: dict) -> "BasePlanNode":  # pragma: no cover
     def set_producers(self, producers):
         self._producers = producers
 
+    def config(self) -> str:
+        return ""
+
     @property
     def name(self):  # pragma: no cover
         """

opteryx/utils/__init__.py

@@ -12,13 +12,13 @@
 
 
 from itertools import permutations
-from typing import List
+from typing import Iterable
 from typing import Optional
 
 from opteryx.third_party.mbleven import compare
 
 
-def suggest_alternative(value: str, candidates: List[str]) -> Optional[str]:
+def suggest_alternative(value: str, candidates: Iterable[str]) -> Optional[str]:
     """
     Find closest match using a variation of Levenshtein Distance with additional
     handling for rearranging function name parts.