Safe Haskell | None |
---|---|
Language | Haskell98 |
Documentation
Very simple binning algorithm. Each indices. Each number correcsponds to different bin.
For rountripping use lowerLimit
and upperLimit
b = binI (lowerLimit b) (upperLimit b)
Eq BinI Source # | |
Data BinI Source # | |
Read BinI Source # | |
Show BinI Source # | |
NFData BinI Source # | |
UniformBin BinI Source # | |
VariableBin BinI Source # | |
SliceableBin BinI Source # | |
Bin1D BinI Source # | |
IntervalBin BinI Source # | |
BinEq BinI Source # | |
Bin BinI Source # | |
Read BinI => Read (BinPermute BinI) # | |
type BinValue BinI Source # | |
Safe constructor for BinI. It checks that upper bound is greater or equal than lower bound