Description
Provides an implementation of random shuffling for Haskell. Shuffling is used when a program needs to reorder lists or collections unpredictably, such as in tests, games, sampling, or randomized algorithms.
It is useful for non-security use cases that need random ordering. For security-sensitive ordering or secret selection, the surrounding random source and threat model still matter.