list-shuffle: List shuffling and sampling
List shuffling and sampling with optimal asymptotic time and space complexity using the imperative Fisher–Yates algorithm.
[Skip to Readme]
Downloads
- list-shuffle-1.0.0.1.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 1.0.0, 1.0.0.1 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.14 && <4.21), primitive (>=0.8 && <0.10), random (>=1.2.1 && <1.3) [details] |
| Tested with | ghc ==9.6.5, ghc ==9.8.2, ghc ==9.10.1 |
| License | BSD-3-Clause |
| Copyright | Copyright (C) 2024 Mitchell Dalvi Rosen, Travis Staton |
| Author | Mitchell Dalvi Rosen |
| Maintainer | Mitchell Dalvi Rosen <mitchellwrosen@gmail.com>, Travis Staton <hello@travisstaton.com> |
| Revised | Revision 1 made by mitchellwrosen at 2024-07-09T14:33:31Z |
| Category | Data |
| Home page | https://github.com/awkward-squad/list-shuffle |
| Bug tracker | https://github.com/awkward-squad/list-shuffle/issues |
| Source repo | head: git clone https://github.com/awkward-squad/list-shuffle.git |
| Uploaded | by mitchellwrosen at 2024-05-16T01:39:27Z |
| Distributions | LTSHaskell:1.0.0.1, Stackage:1.0.0.1 |
| Reverse Dependencies | 1 direct, 1 indirect [details] |
| Downloads | 155 total (8 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2024-05-16 [all 1 reports] |
Readme for list-shuffle-1.0.0.1
[back to package description]list-shuffle
List shuffling and sampling with optimal asymptotic time and space complexity using the imperative Fisher–Yates algorithm.