histogram-fill-0.9.1.0: Library for histograms creation.

CopyrightCopyright (c) 2010 Alexey Khudyakov <alexey.skladnoy@gmail.com>
LicenseBSD3
MaintainerAlexey Khudyakov <alexey.skladnoy@gmail.com>
Stabilityexperimental
Safe HaskellNone
LanguageHaskell98

Data.Histogram.Bin.Extra

Description

Extra binning algorithms

Synopsis

Documentation

class Enum2D a where Source #

Type class very similar to Enum but elements of type are enumerated on 2-dimensional grid

Minimal complete definition

fromEnum2D, toEnum2D

Methods

fromEnum2D :: a -> (Int, Int) Source #

Convert value to index

toEnum2D :: (Int, Int) -> a Source #

Convert index to value

Instances
(Enum a, Enum b) => Enum2D (a, b) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

Methods

fromEnum2D :: (a, b) -> (Int, Int) Source #

toEnum2D :: (Int, Int) -> (a, b) Source #

data BinEnum2D i Source #

Binning for 2D enumerations

Instances
Eq (BinEnum2D i) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

Methods

(==) :: BinEnum2D i -> BinEnum2D i -> Bool #

(/=) :: BinEnum2D i -> BinEnum2D i -> Bool #

Data i => Data (BinEnum2D i) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

Methods

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

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

toConstr :: BinEnum2D i -> Constr #

dataTypeOf :: BinEnum2D i -> DataType #

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

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

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

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

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

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

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

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

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

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

(Read i, Enum2D i) => Read (BinEnum2D i) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

(Show i, Enum2D i) => Show (BinEnum2D i) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

NFData (BinEnum2D i) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

Methods

rnf :: BinEnum2D i -> () #

Enum2D i => Bin (BinEnum2D i) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

Associated Types

type BinValue (BinEnum2D i) :: * Source #

type BinValue (BinEnum2D i) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

type BinValue (BinEnum2D i) = i

binEnum2D :: Enum2D i => i -> i -> BinEnum2D i Source #

Construct indexed bin

data BinPermute b Source #

Direct permutation of indices.

Instances
Eq b => Eq (BinPermute b) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

Methods

(==) :: BinPermute b -> BinPermute b -> Bool #

(/=) :: BinPermute b -> BinPermute b -> Bool #

Data b => Data (BinPermute b) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

Methods

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

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

toConstr :: BinPermute b -> Constr #

dataTypeOf :: BinPermute b -> DataType #

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

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

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

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

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

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

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

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

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

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

Read BinI => Read (BinPermute BinI) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

Show b => Show (BinPermute b) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

NFData b => NFData (BinPermute b) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

Methods

rnf :: BinPermute b -> () #

UniformBin b => UniformBin (BinPermute b) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

VariableBin b => VariableBin (BinPermute b) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

IntervalBin b => IntervalBin (BinPermute b) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

Bin b => Bin (BinPermute b) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

Associated Types

type BinValue (BinPermute b) :: * Source #

type BinValue (BinPermute b) Source # 
Instance details

Defined in Data.Histogram.Bin.Extra

permuteByTable :: Bin b => b -> Vector Int -> Maybe (BinPermute b) Source #

Constuct bin permutation from table

permuteBin :: Bin b => b -> (Int -> Int) -> Maybe (BinPermute b) Source #

Constuct bin permutation from function.