Autopep8 formatting

Author: lsorber

graphchain/core.py

@@ -27,7 +27,7 @@ def __init__(
             key: Hashable,
             computation: Any,
             location: Union[str, fs.base.FS],
-            write_to_cache: Union[bool, str]='auto') -> None:
+            write_to_cache: Union[bool, str] = 'auto') -> None:
         """Cache a dask graph computation.
 
         Parameters
@@ -154,7 +154,7 @@ def write_log(self, log_type: str) -> None:
         with self.cache_fs.open(log_filename, 'w') as fid:  # type: ignore
             fid.write(self.hash)
 
-    def time_to_result(self, memoize: bool=True) -> float:
+    def time_to_result(self, memoize: bool = True) -> float:
         """Estimate the time to load or compute this computation."""
         if hasattr(self, '_time_to_result'):
             return self._time_to_result  # type: ignore
@@ -287,9 +287,9 @@ def __call__(self, *args: Any, **kwargs: Any) -> Any:
 
 def optimize(
         dsk: dict,
-        keys: Optional[Union[Hashable, Iterable[Hashable]]]=None,
-        skip_keys: Optional[Container[Hashable]]=None,
-        location: Union[str, fs.base.FS]="./__graphchain_cache__") -> dict:
+        keys: Optional[Union[Hashable, Iterable[Hashable]]] = None,
+        skip_keys: Optional[Container[Hashable]] = None,
+        location: Union[str, fs.base.FS] = "./__graphchain_cache__") -> dict:
     """Optimize a dask graph with cached computations.
 
     According to the dask graph specification [1]_, a dask graph is a
@@ -363,9 +363,9 @@ def optimize(
 def get(
         dsk: dict,
         keys: Union[Hashable, Iterable[Hashable]],
-        skip_keys: Optional[Container[Hashable]]=None,
-        location: Union[str, fs.base.FS]="./__graphchain_cache__",
-        scheduler: Optional[Callable]=None) -> Any:
+        skip_keys: Optional[Container[Hashable]] = None,
+        location: Union[str, fs.base.FS] = "./__graphchain_cache__",
+        scheduler: Optional[Callable] = None) -> Any:
     """Get one or more keys from a dask graph with caching.
 
     Optimizes a dask graph with ``graphchain.optimize`` and then computes the

graphchain/utils.py

@@ -23,7 +23,7 @@ def _fast_get_size(obj: Any) -> int:
     raise TypeError('Could not determine size of the given object.')
 
 
-def _slow_get_size(obj: Any, seen: Optional[set]=None) -> int:
+def _slow_get_size(obj: Any, seen: Optional[set] = None) -> int:
     size = sys.getsizeof(obj)
     seen = seen or set()
     obj_id = id(obj)
@@ -41,7 +41,7 @@ def _slow_get_size(obj: Any, seen: Optional[set]=None) -> int:
     return size
 
 
-def get_size(obj: Any, seen: Optional[set]=None) -> int:
+def get_size(obj: Any, seen: Optional[set] = None) -> int:
     """Recursively compute the size of an object.
 
     Parameters