homepage: https://github.com/ahaym/reservoir
changelog-type: markdown
hash: 979cb0319bb32b4ab7db5cb80593abe3d191c13e7ff04bfd06217b87d7f641c8
test-bench-deps: {}
maintainer: mah6@williams.edu
synopsis: Unweighted reservoir sampling
changelog: ! '# Revision history for reservoir


  ## 0.1.0.0 -- 2018-07-28


  * First version including only Algorithm R


  ## 0.2.0.0 -- 2018-07-29


  * Trimmed dependencies, published

'
basic-deps:
  base: ! '>=4.10 && <4.11'
  containers: ! '>=0.5 && <0.6'
  random: ! '>=1.1 && <1.2'
all-versions:
- '0.2.0.0'
author: Mark Hay
latest: '0.2.0.0'
description-type: haddock
description: ! '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.'
license-name: BSD3

Update from Hackage at 2018-07-29T08:59:11Z
Update from Hackage at 2018-07-29T08:59:11Z
