Safe Haskell	None
Language	Haskell98

Data.Histogram.Bin.BinInt

Synopsis

Documentation

data BinInt Source #

Integer bins of equal size. For roundtripping use:

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

Constructors

BinInt !Int !Int !Int

Instances

Eq BinInt Source #
Methods (==) :: BinInt -> BinInt -> Bool # (/=) :: BinInt -> BinInt -> Bool #
Data BinInt Source #
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 Source #
Methods readsPrec :: Int -> ReadS BinInt # readList :: ReadS [BinInt] # readPrec :: ReadPrec BinInt # readListPrec :: ReadPrec [BinInt] #
Show BinInt Source #
Methods showsPrec :: Int -> BinInt -> ShowS # show :: BinInt -> String # showList :: [BinInt] -> ShowS #
NFData BinInt Source #
Methods rnf :: BinInt -> () #
UniformBin BinInt Source #
Methods binSize :: BinInt -> BinValue BinInt Source #
VariableBin BinInt Source #
Methods binSizeN :: BinInt -> Int -> BinValue BinInt Source #
MergeableBin BinInt Source #
Methods unsafeMergeBins :: CutDirection -> Int -> BinInt -> BinInt Source #
SliceableBin BinInt Source #
Methods unsafeSliceBin :: Int -> Int -> BinInt -> BinInt Source #
Bin1D BinInt Source #
Methods lowerLimit :: BinInt -> BinValue BinInt Source # upperLimit :: BinInt -> BinValue BinInt Source #
IntervalBin BinInt Source #
Methods binInterval :: BinInt -> Int -> (BinValue BinInt, BinValue BinInt) Source # binsList :: Vector v (BinValue BinInt, BinValue BinInt) => BinInt -> v (BinValue BinInt, BinValue BinInt) Source #
BinEq BinInt Source #
Methods binEq :: BinInt -> BinInt -> Bool Source #
Bin BinInt Source #
Associated Types type BinValue BinInt :: * Source # Methods toIndex :: BinInt -> BinValue BinInt -> Int Source # fromIndex :: BinInt -> Int -> BinValue BinInt Source # nBins :: BinInt -> Int Source # inRange :: BinInt -> BinValue BinInt -> Bool Source #
type BinValue BinInt Source #
type BinValue BinInt = Int

binInt Source #

Arguments

:: Int	Lower bound
-> Int	Bin size
-> Int	Upper bound
-> BinInt

Construct BinInt.

binIntN Source #

Arguments

:: Int	Lower bound
-> Int	Bin size
-> Int	Upper bound
-> BinInt

Construct BinInt.

binIntStep Source #

Arguments

:: Int	Lower bound
-> Int	Bin size
-> Int	Number of bins
-> BinInt