reservoir: Reservoir sampling algorithms

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

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.

Properties

Versions 0.1.0.1, 0.2.0.0
Change log ChangeLog.md
Dependencies base (>=4.10 && <4.11), containers (>=0.5 && <0.6), mersenne-random-pure64 (>=0.2 && <0.3), random (>=1.1 && <1.2) [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 2018-07-28T15:22:24Z

Modules

[Index]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees