diff options
Diffstat (limited to 'list_utils.py')
| -rw-r--r-- | list_utils.py | 12 |
1 files changed, 5 insertions, 7 deletions
diff --git a/list_utils.py b/list_utils.py index d70159a..91af8f9 100644 --- a/list_utils.py +++ b/list_utils.py @@ -1,8 +1,10 @@ #!/usr/bin/env python3 +"""Some useful(?) utilities for dealing with Lists.""" + from collections import Counter from itertools import islice -from typing import Any, Iterator, List, Mapping, Sequence, Tuple +from typing import Any, Iterator, List, Sequence, Tuple def shard(lst: List[Any], size: int) -> Iterator[Any]: @@ -230,9 +232,7 @@ def _permute(seq: str, path: str): yield from _permute(cdr, path + car) -def binary_search( - lst: Sequence[Any], target: Any, *, sanity_check=False -) -> Tuple[bool, int]: +def binary_search(lst: Sequence[Any], target: Any, *, sanity_check=False) -> Tuple[bool, int]: """Performs a binary search on lst (which must already be sorted). Returns a Tuple composed of a bool which indicates whether the target was found and an int which indicates the index closest to @@ -267,9 +267,7 @@ def binary_search( return _binary_search(lst, target, 0, len(lst) - 1) -def _binary_search( - lst: Sequence[Any], target: Any, low: int, high: int -) -> Tuple[bool, int]: +def _binary_search(lst: Sequence[Any], target: Any, low: int, high: int) -> Tuple[bool, int]: if high >= low: mid = (high + low) // 2 if lst[mid] == target: |