X-Git-Url: https://wannabe.guru.org/gitweb/?a=blobdiff_plain;f=list_utils.py;h=1141af2fe9b6bb8861dfd25c08dab735bfd4ceaf;hb=a9bdfd8fc9f84b7b2c09a57cd12ba32259e84d1c;hp=7f28ade922a4b733ee29ea0c68bc957ff587c51b;hpb=c6fca944b41f292b66efaba27ebf3fd0a37956b8;p=python_utils.git

diff --git a/list_utils.py b/list_utils.py
index 7f28ade..1141af2 100644
--- a/list_utils.py
+++ b/list_utils.py
@@ -1,10 +1,12 @@
 #!/usr/bin/env python3
 
+# © Copyright 2021-2022, Scott Gasch
+
 """Some useful(?) utilities for dealing with Lists."""
 
 import random
 from collections import Counter
-from itertools import islice
+from itertools import chain, combinations, islice
 from typing import Any, Iterator, List, MutableSequence, Sequence, Tuple
 
 
@@ -305,6 +307,23 @@ def _binary_search(lst: Sequence[Any], target: Any, low: int, high: int) -> Tupl
         return (False, low)
 
 
+def powerset(lst: Sequence[Any]) -> Iterator[Sequence[Any]]:
+    """Returns the powerset of the items in the input sequence.
+
+    >>> for x in powerset([1, 2, 3]):
+    ...     print(x)
+    ()
+    (1,)
+    (2,)
+    (3,)
+    (1, 2)
+    (1, 3)
+    (2, 3)
+    (1, 2, 3)
+    """
+    return chain.from_iterable(combinations(lst, r) for r in range(len(lst) + 1))
+
+
 if __name__ == '__main__':
     import doctest