Used isort to sort imports. Also added to the git pre-commit hook.

[python_utils.git] / dict_utils.py

diff --git a/dict_utils.py b/dict_utils.py
index 79c86edf286f2c9ea9983906385365199be74892..451a87dadf08d8632ac6f593dfb592116a05779b 100644 (file)
--- a/dict_utils.py
+++ b/dict_utils.py
@@ -70,7 +70,7 @@ def raise_on_duplicated_keys(key, new_value, old_value):
 def coalesce(
     inputs: Iterator[Dict[Any, Any]],
     *,
-    aggregation_function: Callable[[Any, Any], Any] = coalesce_by_creating_list,
+    aggregation_function: Callable[[Any, Any, Any], Any] = coalesce_by_creating_list,
 ) -> Dict[Any, Any]:
     """Merge N dicts into one dict containing the union of all keys /
     values in the input dicts.  When keys collide, apply the
@@ -198,9 +198,7 @@ def min_key(d: Dict[Any, Any]) -> Any:
     return min(d.keys())
 
 
-def parallel_lists_to_dict(
-    keys: List[Any], values: List[Any]
-) -> Dict[Any, Any]:
+def parallel_lists_to_dict(keys: List[Any], values: List[Any]) -> Dict[Any, Any]:
     """Given two parallel lists (keys and values), create and return
     a dict.
 
@@ -211,9 +209,7 @@ def parallel_lists_to_dict(
 
     """
     if len(keys) != len(values):
-        raise Exception(
-            "Parallel keys and values lists must have the same length"
-        )
+        raise Exception("Parallel keys and values lists must have the same length")
     return dict(zip(keys, values))
 
 
@@ -227,7 +223,7 @@ def dict_to_key_value_lists(d: Dict[Any, Any]) -> Tuple[List[Any], List[Any]]:
     ['scott', '555-1212', '123 main st.', '12345']
 
     """
-    r = ([], [])
+    r: Tuple[List[Any], List[Any]] = ([], [])
     for (k, v) in d.items():
         r[0].append(k)
         r[1].append(v)