histogram-fill-0.9.1.0: Library for histograms creation.

Data.Histogram.Bin.BinI

Synopsis

# Documentation

data BinI Source #

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
 Source # Instance detailsDefined in Data.Histogram.Bin.BinI Methods(==) :: BinI -> BinI -> Bool #(/=) :: BinI -> BinI -> Bool # Source # Instance detailsDefined in Data.Histogram.Bin.BinI Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BinI -> c BinI #gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c BinI #dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c BinI) #dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c BinI) #gmapT :: (forall b. Data b => b -> b) -> BinI -> BinI #gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BinI -> r #gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BinI -> r #gmapQ :: (forall d. Data d => d -> u) -> BinI -> [u] #gmapQi :: Int -> (forall d. Data d => d -> u) -> BinI -> u #gmapM :: Monad m => (forall d. Data d => d -> m d) -> BinI -> m BinI #gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BinI -> m BinI #gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BinI -> m BinI # Source # Instance detailsDefined in Data.Histogram.Bin.BinI Methods Source # Instance detailsDefined in Data.Histogram.Bin.BinI MethodsshowsPrec :: Int -> BinI -> ShowS #show :: BinI -> String #showList :: [BinI] -> ShowS # Source # Instance detailsDefined in Data.Histogram.Bin.BinI Methodsrnf :: BinI -> () # Source # Instance detailsDefined in Data.Histogram.Bin.BinI Methods Source # Instance detailsDefined in Data.Histogram.Bin.BinI Methods Source # Instance detailsDefined in Data.Histogram.Bin.BinI Methods Source # Instance detailsDefined in Data.Histogram.Bin.BinI Methods Source # Instance detailsDefined in Data.Histogram.Bin.BinI Methods Source # Instance detailsDefined in Data.Histogram.Bin.BinI MethodsbinEq :: BinI -> BinI -> Bool Source # Source # Instance detailsDefined in Data.Histogram.Bin.BinI Associated Typestype BinValue BinI :: * Source # Methods Source # Instance detailsDefined in Data.Histogram.Bin Methods Source # Instance detailsDefined in Data.Histogram.Bin Methods RealFrac f => ConvertBin BinI (BinF f) Source # Instance detailsDefined in Data.Histogram.Bin Methods # Instance detailsDefined in Data.Histogram.Bin.Extra Methods type BinValue BinI Source # Instance detailsDefined in Data.Histogram.Bin.BinI type BinValue BinI = Int

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

Arguments

 :: Int Number of bins. -> BinI

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