Data.Histogram.Bin.BinI

Documentation

data BinI

Simple binning algorithm which map continous range of bins onto indices. Each number correcsponds to different bin

1. Lower bound (inclusive)
2. Upper bound (inclusive)

Constructors

BinI !Int !Int

Instances

Eq BinI

Data BinI

Read BinI

Show BinI

Typeable BinI

UniformBin BinI

VariableBin BinI

GrowBin BinI

Bin1D BinI

IntervalBin BinI

Bin BinI

ConvertBin BinI BinD

RealFrac f => ConvertBin BinI (BinF f)

Read BinI => Read (BinPermute BinI)

binI :: Int -> Int -> BinI

Safe constructor for BinI. It does checks that upper bound is greater or equal than lower bound

binI0 :: Int -> BinI

Construct BinI with n bins. Indexing starts from 0. n must be positive