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
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.
"""
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))
['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)