Safe Haskell	Safe-Inferred
Language	Haskell98

Numeric.Probability.Example.Histogram

Description

We have a set of symbols. We draw from this set n times with replacement. We then sort the symbols by their drawn frequency. What is the expected distribution of the histogram?

Synopsis

example :: Ord a => T [] a -> Int -> T Rational (Map Int Int)
flattenHistogram :: Num a => Map Int a -> [a]
exampleList :: Ord a => T [] a -> Int -> T Rational [Int]
histogram :: Ord a => [a] -> Map a Int
decorate :: b -> [a] -> [(a, b)]
expected :: T Rational (Map Int Int) -> Map Int Rational
visualize :: Rational -> Map Int Rational -> IO ()
partitions :: Int -> Int -> [IntMap Int]

Documentation

>>> import qualified Combinatorics as Comb

example :: Ord a => T [] a -> Int -> T Rational (Map Int Int) Source #

flattenHistogram :: Num a => Map Int a -> [a] Source #

exampleList :: Ord a => T [] a -> Int -> T Rational [Int] Source #

>>> exampleList ('a'!:['b'..'k']) 4
fromFreqs [([4],720 % 1331),([2,1],540 % 1331),([1,0,1],40 % 1331),([0,2],30 % 1331),([0,0,0,1],1 % 1331)]

histogram :: Ord a => [a] -> Map a Int Source #

decorate :: b -> [a] -> [(a, b)] Source #

expected :: T Rational (Map Int Int) -> Map Int Rational Source #

visualize :: Rational -> Map Int Rational -> IO () Source #

partitions :: Int -> Int -> [IntMap Int] Source #