X-Git-Url: https://wannabe.guru.org/gitweb/?a=blobdiff_plain;ds=sidebyside;f=list_utils.py;h=5c70df3476c6dbafe3c252788e88ee6b16c5c301;hb=001b734eb651c819d880df1017829bd54d7c16f7;hp=91af8f9eb924fb7e7e04932d58a1bcb6eded0690;hpb=e8fbbb7306430478dec55d2c963eed116d8330cc;p=python_utils.git

diff --git a/list_utils.py b/list_utils.py
index 91af8f9..5c70df3 100644
--- a/list_utils.py
+++ b/list_utils.py
@@ -1,10 +1,13 @@
 #!/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 typing import Any, Iterator, List, Sequence, Tuple
+from typing import Any, Iterator, List, MutableSequence, Sequence, Tuple
 
 
 def shard(lst: List[Any], size: int) -> Iterator[Any]:
@@ -232,6 +235,30 @@ def _permute(seq: str, path: str):
         yield from _permute(cdr, path + car)
 
 
+def shuffle(seq: MutableSequence[Any]) -> MutableSequence[Any]:
+    """Shuffles a sequence into a random order.
+
+    >>> random.seed(22)
+    >>> shuffle([1, 2, 3, 4, 5])
+    [3, 4, 1, 5, 2]
+
+    >>> shuffle('example')
+    'empaelx'
+
+    """
+    if isinstance(seq, str):
+        import string_utils
+
+        return string_utils.shuffle(seq)
+    else:
+        random.shuffle(seq)
+        return seq
+
+
+def scramble(seq: MutableSequence[Any]) -> MutableSequence[Any]:
+    return shuffle(seq)
+
+
 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