Data.Histogram.Bin.Extra

Extra binning algorithms

Documentation

class Enum2D a where

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

Methods

fromEnum2D :: a -> (Int, Int)

Convert value to index

toEnum2D :: (Int, Int) -> a

Convert index to value

Instances

(Enum a, Enum b) => Enum2D (a, b)

data BinEnum2D i

Binning for 2D enumerations

Instances

Typeable1 BinEnum2D

Eq (BinEnum2D i)

(Typeable (BinEnum2D i), Data i) => Data (BinEnum2D i)

(Read i, Enum2D i) => Read (BinEnum2D i)

(Show i, Enum2D i) => Show (BinEnum2D i)

Enum2D i => Bin (BinEnum2D i)

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

Construct indexed bin

data BinPermute b

Direct permutation of indices.

Instances

Typeable1 BinPermute

Eq b => Eq (BinPermute b)

(Typeable (BinPermute b), Data b) => Data (BinPermute b)

Read BinI => Read (BinPermute BinI)

Show b => Show (BinPermute b)

(VariableBin (BinPermute b), UniformBin b) => UniformBin (BinPermute b)

(Bin (BinPermute b), VariableBin b) => VariableBin (BinPermute b)

(Bin (BinPermute b), Ord (BinValue (BinPermute b)), IntervalBin b) => IntervalBin (BinPermute b)

Bin b => Bin (BinPermute b)

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

Constuct bin permutation from table

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

Constuct bin permutation from function.