mcmc-0.2.2: Sample from a posterior using Markov chain Monte Carlo

Copyright	(c) Dominik Schrempf 2020
License	GPL-3.0-or-later
Maintainer	dominik.schrempf@gmail.com
Stability	unstable
Portability	portable
Safe Haskell	None
Language	Haskell2010

Mcmc.Tools.Shuffle

Description

Creation date: Wed May 20 14:37:09 2020.

From https://wiki.haskell.org/Random_shuffle.

Synopsis

shuffle :: [a] -> GenIO -> IO [a]
shuffleN :: [a] -> Int -> GenIO -> IO [[a]]
grabble :: [a] -> Int -> Int -> GenIO -> IO [[a]]

Documentation

shuffle :: [a] -> GenIO -> IO [a] Source #

Shuffle a list.

shuffleN :: [a] -> Int -> GenIO -> IO [[a]] Source #

Shuffle a list n times.

grabble :: [a] -> Int -> Int -> GenIO -> IO [[a]] Source #

grabble xs m n is O(m*n'), where n' = min n (length xs). Choose n' elements from xs, without replacement, and that m times.