histogram-fill-0.8.5.0: Library for histograms creation.

Safe HaskellNone
LanguageHaskell98

Data.Histogram.Bin.BinInt

Synopsis

Documentation

data BinInt #

Integer bins of equal size. For roundtripping use:

b = binIntStep (lowerLimit b) (binSize b) (nBins b)

Constructors

BinInt !Int !Int !Int 

Instances

Eq BinInt # 

Methods

(==) :: BinInt -> BinInt -> Bool #

(/=) :: BinInt -> BinInt -> Bool #

Data BinInt # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BinInt -> c BinInt #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c BinInt #

toConstr :: BinInt -> Constr #

dataTypeOf :: BinInt -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c BinInt) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c BinInt) #

gmapT :: (forall b. Data b => b -> b) -> BinInt -> BinInt #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BinInt -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BinInt -> r #

gmapQ :: (forall d. Data d => d -> u) -> BinInt -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> BinInt -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> BinInt -> m BinInt #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BinInt -> m BinInt #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BinInt -> m BinInt #

Read BinInt # 
Show BinInt # 
NFData BinInt # 

Methods

rnf :: BinInt -> () #

UniformBin BinInt # 
VariableBin BinInt # 
MergeableBin BinInt # 
SliceableBin BinInt # 

Methods

unsafeSliceBin :: Int -> Int -> BinInt -> BinInt #

Bin1D BinInt # 
IntervalBin BinInt # 
BinEq BinInt # 

Methods

binEq :: BinInt -> BinInt -> Bool #

Bin BinInt # 

Associated Types

type BinValue BinInt :: * #

type BinValue BinInt # 

binInt #

Arguments

:: Int

Lower bound

-> Int

Bin size

-> Int

Upper bound

-> BinInt 

Construct BinInt.

binIntN #

Arguments

:: Int

Lower bound

-> Int

Bin size

-> Int

Upper bound

-> BinInt 

Construct BinInt.

binIntStep #

Arguments

:: Int

Lower bound

-> Int

Bin size

-> Int

Number of bins

-> BinInt