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 (as included in the package)
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] |
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> |
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, Stackage:1.0.0.1 |
Downloads | 63 total (22 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] |