list-shuffle: List shuffling and sampling

[ bsd3, data, library ] [ Propose Tags ]

List shuffling and sampling with optimal asymptotic time and space complexity using the imperative Fisher–Yates algorithm.


[Skip to Readme]

Modules

[Index] [Quick Jump]

Downloads

Maintainer's Corner

Package maintainers

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.1, Stackage:1.0.0.1
Downloads 84 total (34 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

GitHub CI Hackage Stackage LTS Stackage Nightly Dependencies

List shuffling and sampling with optimal asymptotic time and space complexity using the imperative Fisher–Yates algorithm.