reservoir: Unweighted reservoir sampling

[ bsd3, library, math ] [ Propose Tags ]

From https://en.wikipedia.org/wiki/Reservoir_sampling: "Reservoir sampling is a family of randomized algorithms for randomly choosing a sample of k items from a list S containing n items, where n is either a very large or unknown number. Typically n is large enough that the list doesn't fit into main memory." This package implements Jeffrey Vitter's Algorithm R http://www.cs.umd.edu/~samir/498/vitter.pdf, suitable for unweighted sampling from a collection of unknown size.

Versions [faq] 0.2.0.0
Change log ChangeLog.md
Dependencies base (==4.10.*), containers (==0.5.*), random (==1.1.*) [details]
License BSD-3-Clause
Author Mark Hay
Maintainer mah6@williams.edu
Category Math
Home page https://github.com/ahaym/reservoir
Source repo head: git clone https://github.com/ahaym/reservoir
Uploaded by haym at Sun Jul 29 08:51:12 UTC 2018
Distributions NixOS:0.2.0.0
Downloads 190 total (18 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees