Safe Haskell | Safe-Infered |
---|
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)
Safe constructor for BinI. It checks that upper bound is greater or equal than lower bound