| Safe Haskell | None |
|---|---|
| Language | Haskell98 |
Data.Histogram.Bin.BinI
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)
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 |
Safe constructor for BinI. It checks that upper bound is greater or equal than lower bound