| Safe Haskell | None |
|---|---|
| Language | Haskell98 |
Data.Histogram.Bin.LogBinD
Documentation
Uniform binning in logarithmic scale. For roundtripping use:
b = logBinDN (lowerLimit b) (logBinDIncrement b) (nBins b)
Instances
| Eq LogBinD # | |
| Data LogBinD # | |
Defined in Data.Histogram.Bin.LogBinD Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LogBinD -> c LogBinD # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LogBinD # toConstr :: LogBinD -> Constr # dataTypeOf :: LogBinD -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c LogBinD) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LogBinD) # gmapT :: (forall b. Data b => b -> b) -> LogBinD -> LogBinD # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LogBinD -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LogBinD -> r # gmapQ :: (forall d. Data d => d -> u) -> LogBinD -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> LogBinD -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> LogBinD -> m LogBinD # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LogBinD -> m LogBinD # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LogBinD -> m LogBinD # | |
| Read LogBinD # | |
| Show LogBinD # | |
| NFData LogBinD # | |
Defined in Data.Histogram.Bin.LogBinD | |
| VariableBin LogBinD # | |
| MergeableBin LogBinD # | |
Defined in Data.Histogram.Bin.LogBinD Methods unsafeMergeBins :: CutDirection -> Int -> LogBinD -> LogBinD # | |
| SliceableBin LogBinD # | |
Defined in Data.Histogram.Bin.LogBinD | |
| Bin1D LogBinD # | |
Defined in Data.Histogram.Bin.LogBinD | |
| IntervalBin LogBinD # | |
| BinEq LogBinD # | |
| Bin LogBinD # | |
| type BinValue LogBinD # | |
Defined in Data.Histogram.Bin.LogBinD | |
logBinDIncrement :: LogBinD -> Double #
Increment ratio for LogBinD
Create log-scale binning algorithm.