histogram-fill-0.8.4.1: Library for histograms creation.

Safe HaskellNone
LanguageHaskell98

Data.Histogram.Bin.Bin2D

Synopsis

Documentation

data Bin2D binX binY Source

2D bins. binX is binning along X axis and binY is one along Y axis. Data is stored in row-major order

Constructors

Bin2D 

Fields

binX :: !binX

Binning algorithm for X axis

binY :: !binY

Binning algorithm for Y axis

Instances

(Eq binX, Eq binY) => Eq (Bin2D binX binY) 
(Data binX, Data binY) => Data (Bin2D binX binY) 
(Read bx, Read by) => Read (Bin2D bx by) 
(Show bx, Show by) => Show (Bin2D bx by) 
(NFData bx, NFData by) => NFData (Bin2D bx by) 
(BinEq bx, BinEq by) => BinEq (Bin2D bx by) 
(Bin binX, Bin binY) => Bin (Bin2D binX binY) 
Typeable (* -> * -> *) Bin2D 
(ConvertBin bx bx', ConvertBin by by') => ConvertBin (Bin2D bx by) (Bin2D bx' by') 
(ConvertBin by by', Bin bx) => ConvertBin (Bin2D bx by) (Bin2D bx by') 
(ConvertBin bx bx', Bin by) => ConvertBin (Bin2D bx by) (Bin2D bx' by) 
type BinValue (Bin2D binX binY) = (BinValue binX, BinValue binY) 

(><) :: binX -> binY -> Bin2D binX binY Source

Alias for Bin2D.

type (:><:) = Bin2D Source

Type alias for Bin2D

nBins2D :: (Bin bx, Bin by) => Bin2D bx by -> (Int, Int) Source

2-dimensional size of binning algorithm

toIndex2D :: (Bin binX, Bin binY) => Bin2D binX binY -> Int -> (Int, Int) Source

Convert index into pair of indices for X and Y axes

fmapBinX :: (Bin bx, Bin bx') => (bx -> bx') -> Bin2D bx by -> Bin2D bx' by Source

Apply function to X binning algorithm. If new binning algorithm have different number of bins will fail.

fmapBinY :: (Bin by, Bin by') => (by -> by') -> Bin2D bx by -> Bin2D bx by' Source

Apply function to Y binning algorithm. If new binning algorithm have different number of bins will fail.