diff options
| -rw-r--r-- | dict_utils.py | 12 |
1 files changed, 8 insertions, 4 deletions
diff --git a/dict_utils.py b/dict_utils.py index 1f211fe..b1464c6 100644 --- a/dict_utils.py +++ b/dict_utils.py @@ -3,12 +3,13 @@ from itertools import islice from typing import Any, Callable, Dict, Iterator, List, Tuple + def init_or_inc( d: Dict[Any, Any], key: Any, *, init_value: Any = 1, - inc_function: Callable[..., Any] = lambda x: x + 1 + inc_function: Callable[..., Any] = lambda x: x + 1, ) -> bool: """ Initialize a dict value (if it doesn't exist) or increments it (using the @@ -37,6 +38,7 @@ def shard(d: Dict[Any, Any], size: int) -> Iterator[Dict[Any, Any]]: """ Shards a dict into N subdicts which, together, contain all keys/values from the original unsharded dict. + """ items = d.items() for x in range(0, len(d), size): @@ -45,6 +47,7 @@ def shard(d: Dict[Any, Any], size: int) -> Iterator[Dict[Any, Any]]: def coalesce_by_creating_list(key, new_value, old_value): from list_utils import flatten + return flatten([new_value, old_value]) @@ -65,9 +68,9 @@ 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 + inputs: Iterator[Dict[Any, Any]], + *, + aggregation_function: Callable[[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 @@ -229,4 +232,5 @@ def dict_to_key_value_lists(d: Dict[Any, Any]) -> Tuple[List[Any], List[Any]]: if __name__ == '__main__': import doctest + doctest.testmod() |