Safe Haskell	None
Language	Haskell98

Data.Histogram.Bin.BinF

Contents

Generic and slow
Specialized for Double and fast

Synopsis

data BinF f
binF :: RealFrac f => f -> Int -> f -> BinF f
binFn :: RealFrac f => f -> f -> f -> BinF f
binFstep :: RealFrac f => f -> f -> Int -> BinF f
scaleBinF :: (Show f, RealFrac f) => f -> f -> BinF f -> BinF f
data BinD
binD :: Double -> Int -> Double -> BinD
binDn :: Double -> Double -> Double -> BinD
binDstep :: Double -> Double -> Int -> BinD
scaleBinD :: Double -> Double -> BinD -> BinD

Generic and slow

data BinF f #

Floating point bins of equal size. Use following function for construction and inspection of value:

b = binFstep (lowerLimit b) (binSize b) (nBins b)

Performance note. Since BinF is parametric in its value it could not be unpacked and every access to data will require pointer indirection. BinD is binning specialized to Doubles and it's always faster than BinF Double.

Instances

RealFrac f => ConvertBin BinInt (BinF f) #
Instance details Defined in Data.Histogram.Bin Methods convertBin :: BinInt -> BinF f #
RealFrac f => ConvertBin BinI (BinF f) #
Instance details Defined in Data.Histogram.Bin Methods convertBin :: BinI -> BinF f #
Eq f => Eq (BinF f) #
Instance details Defined in Data.Histogram.Bin.BinF Methods (==) :: BinF f -> BinF f -> Bool # (/=) :: BinF f -> BinF f -> Bool #
Data f => Data (BinF f) #
Instance details Defined in Data.Histogram.Bin.BinF Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BinF f -> c (BinF f) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (BinF f) # toConstr :: BinF f -> Constr # dataTypeOf :: BinF f -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (BinF f)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (BinF f)) # gmapT :: (forall b. Data b => b -> b) -> BinF f -> BinF f # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BinF f -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BinF f -> r # gmapQ :: (forall d. Data d => d -> u) -> BinF f -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> BinF f -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> BinF f -> m (BinF f) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BinF f -> m (BinF f) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BinF f -> m (BinF f) #
Read f => Read (BinF f) #
Instance details Defined in Data.Histogram.Bin.BinF Methods readsPrec :: Int -> ReadS (BinF f) # readList :: ReadS [BinF f] # readPrec :: ReadPrec (BinF f) # readListPrec :: ReadPrec [BinF f] #
Show f => Show (BinF f) #
Instance details Defined in Data.Histogram.Bin.BinF Methods showsPrec :: Int -> BinF f -> ShowS # show :: BinF f -> String # showList :: [BinF f] -> ShowS #
NFData f => NFData (BinF f) #
Instance details Defined in Data.Histogram.Bin.BinF Methods rnf :: BinF f -> () #
RealFrac f => UniformBin (BinF f) #
Instance details Defined in Data.Histogram.Bin.BinF Methods binSize :: BinF f -> BinValue (BinF f) #
RealFrac f => VariableBin (BinF f) #
Instance details Defined in Data.Histogram.Bin.BinF Methods binSizeN :: BinF f -> Int -> BinValue (BinF f) #
RealFrac f => MergeableBin (BinF f) #
Instance details Defined in Data.Histogram.Bin.BinF Methods unsafeMergeBins :: CutDirection -> Int -> BinF f -> BinF f #
RealFrac f => SliceableBin (BinF f) #
Instance details Defined in Data.Histogram.Bin.BinF Methods unsafeSliceBin :: Int -> Int -> BinF f -> BinF f #
RealFrac f => Bin1D (BinF f) #
Instance details Defined in Data.Histogram.Bin.BinF Methods lowerLimit :: BinF f -> BinValue (BinF f) # upperLimit :: BinF f -> BinValue (BinF f) #
RealFrac f => IntervalBin (BinF f) #
Instance details Defined in Data.Histogram.Bin.BinF Methods binInterval :: BinF f -> Int -> (BinValue (BinF f), BinValue (BinF f)) # binsList :: Vector v (BinValue (BinF f), BinValue (BinF f)) => BinF f -> v (BinValue (BinF f), BinValue (BinF f)) #
RealFloat f => BinEq (BinF f) #	Equality is up to 2/3th of digits
Instance details Defined in Data.Histogram.Bin.BinF Methods binEq :: BinF f -> BinF f -> Bool #
RealFrac f => Bin (BinF f) #
Instance details Defined in Data.Histogram.Bin.BinF Associated Types type BinValue (BinF f) :: * # Methods toIndex :: BinF f -> BinValue (BinF f) -> Int # fromIndex :: BinF f -> Int -> BinValue (BinF f) # nBins :: BinF f -> Int # inRange :: BinF f -> BinValue (BinF f) -> Bool #
type BinValue (BinF f) #
Instance details Defined in Data.Histogram.Bin.BinF type BinValue (BinF f) = f

binF #

Arguments

:: RealFrac f
=> f	Lower bound of range
-> Int	Number of bins
-> f	Upper bound of range
-> BinF f

Create bins.

binFn #

Arguments

:: RealFrac f
=> f	Begin of range
-> f	Size of step
-> f	Approximation of end of range
-> BinF f

Create bins. Note that actual upper bound can differ from specified.

binFstep #

Arguments

:: RealFrac f
=> f	Begin of range
-> f	Size of step
-> Int	Number of bins
-> BinF f

Create bins

scaleBinF :: (Show f, RealFrac f) => f -> f -> BinF f -> BinF f #

'scaleBinF a b' scales BinF using linear transform 'a+b*x'

Specialized for Double and fast

data BinD #

Floating point bins of equal sizes. If you work with Doubles this data type should be used instead of BinF.

Instances

Eq BinD #
Instance details Defined in Data.Histogram.Bin.BinF Methods (==) :: BinD -> BinD -> Bool # (/=) :: BinD -> BinD -> Bool #
Data BinD #
Instance details Defined in Data.Histogram.Bin.BinF Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BinD -> c BinD # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c BinD # toConstr :: BinD -> Constr # dataTypeOf :: BinD -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c BinD) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c BinD) # gmapT :: (forall b. Data b => b -> b) -> BinD -> BinD # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BinD -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BinD -> r # gmapQ :: (forall d. Data d => d -> u) -> BinD -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> BinD -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> BinD -> m BinD # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BinD -> m BinD # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BinD -> m BinD #
Read BinD #
Instance details Defined in Data.Histogram.Bin.BinF Methods readsPrec :: Int -> ReadS BinD # readList :: ReadS [BinD] # readPrec :: ReadPrec BinD # readListPrec :: ReadPrec [BinD] #
Show BinD #
Instance details Defined in Data.Histogram.Bin.BinF Methods showsPrec :: Int -> BinD -> ShowS # show :: BinD -> String # showList :: [BinD] -> ShowS #
NFData BinD #
Instance details Defined in Data.Histogram.Bin.BinF Methods rnf :: BinD -> () #
UniformBin BinD #
Instance details Defined in Data.Histogram.Bin.BinF Methods binSize :: BinD -> BinValue BinD #
VariableBin BinD #
Instance details Defined in Data.Histogram.Bin.BinF Methods binSizeN :: BinD -> Int -> BinValue BinD #
MergeableBin BinD #
Instance details Defined in Data.Histogram.Bin.BinF Methods unsafeMergeBins :: CutDirection -> Int -> BinD -> BinD #
SliceableBin BinD #
Instance details Defined in Data.Histogram.Bin.BinF Methods unsafeSliceBin :: Int -> Int -> BinD -> BinD #
Bin1D BinD #
Instance details Defined in Data.Histogram.Bin.BinF Methods lowerLimit :: BinD -> BinValue BinD # upperLimit :: BinD -> BinValue BinD #
IntervalBin BinD #
Instance details Defined in Data.Histogram.Bin.BinF Methods binInterval :: BinD -> Int -> (BinValue BinD, BinValue BinD) # binsList :: Vector v (BinValue BinD, BinValue BinD) => BinD -> v (BinValue BinD, BinValue BinD) #
BinEq BinD #	Equality is up to 3e-11 (2/3th of digits)
Instance details Defined in Data.Histogram.Bin.BinF Methods binEq :: BinD -> BinD -> Bool #
Bin BinD #
Instance details Defined in Data.Histogram.Bin.BinF Associated Types type BinValue BinD :: * # Methods toIndex :: BinD -> BinValue BinD -> Int # fromIndex :: BinD -> Int -> BinValue BinD # nBins :: BinD -> Int # inRange :: BinD -> BinValue BinD -> Bool #
ConvertBin BinInt BinD #
Instance details Defined in Data.Histogram.Bin Methods convertBin :: BinInt -> BinD #
ConvertBin BinI BinD #
Instance details Defined in Data.Histogram.Bin Methods convertBin :: BinI -> BinD #
type BinValue BinD #
Instance details Defined in Data.Histogram.Bin.BinF type BinValue BinD = Double

binD #

Arguments

:: Double	Lower bound of range
-> Int	Number of bins
-> Double	Upper bound of range
-> BinD

Create bins.

binDn #

Arguments

:: Double	Begin of range
-> Double	Size of step
-> Double	Approximation of end of range
-> BinD

Create bins. Note that actual upper bound can differ from specified.

binDstep #

Arguments

:: Double	Begin of range
-> Double	Size of step
-> Int	Number of bins
-> BinD

Create bins

scaleBinD :: Double -> Double -> BinD -> BinD #

'scaleBinF a b' scales BinF using linear transform 'a+b*x'