histogram-fill-0.8.4.1: 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

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) 

data BinEnum2D i Source

Binning for 2D enumerations

Instances

Eq (BinEnum2D i) 
Data i => Data (BinEnum2D i) 
(Read i, Enum2D i) => Read (BinEnum2D i) 
(Show i, Enum2D i) => Show (BinEnum2D i) 
NFData (BinEnum2D i) 
Enum2D i => Bin (BinEnum2D i) 
Typeable (* -> *) BinEnum2D 
type BinValue (BinEnum2D i) = i 

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

Construct indexed bin

data BinPermute b Source

Direct permutation of indices.

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.