Data.Histogram.Bin.BinI

Documentation

data BinI

Very simple binning algorithm. Each indices. Each number correcsponds to different bin.

For rountripping use lowerLimit and upperLimit

b = binI (lowerLimit b) (upperLimit b)

Instances

Eq BinI

Data BinI

Read BinI

Show BinI

NFData BinI

UniformBin BinI

VariableBin BinI

SliceableBin BinI

Bin1D BinI

IntervalBin BinI

BinEq BinI

Bin BinI

Typeable * BinI

ConvertBin BinI BinInt

ConvertBin BinI BinD

RealFrac f => ConvertBin BinI (BinF f)

Read BinI => Read (BinPermute BinI)

type BinValue BinI = Int

binI

Arguments

:: Int

Lower bound (inclusive)

-> Int

Upper bound (inclusive)

-> BinI

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

binI0

Arguments

:: Int

Number of bins.

-> BinI

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