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.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 1.0.0 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | base (>=4.14 && <4.20), primitive (>=0.8 && <0.10), random (>=1.2.1 && <1.3) [details] |
| License | BSD-3-Clause |
| Copyright | Copyright (C) 2023 Mitchell Rosen, Travis Staton |
| Author | Mitchell Rosen |
| Maintainer | Mitchell Rosen <mitchellwrosen@gmail.com>, Travis Staton <hello@travisstaton.com> |
| 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 2023-10-26T00:03:54Z |
| Distributions | LTSHaskell:1.0.0, Stackage:1.0.0 |
| Downloads | 44 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 2023-10-26 [all 1 reports] |
Readme for list-shuffle-1.0.0
[back to package description]list-shuffle
List shuffling and sampling with optimal asymptotic time and space complexity using the imperative Fisher–Yates algorithm.