Data.Histogram.Bin.Bin2D

Documentation

data Bin2D binX binY

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 binY, Eq binX) => Eq (Bin2D binX binY)

Methods

(==) :: Bin2D binX binY -> Bin2D binX binY -> Bool

(/=) :: Bin2D binX binY -> Bin2D binX binY -> Bool

(Data binY, Data binX) => Data (Bin2D binX binY)

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Bin2D binX binY -> c (Bin2D binX binY)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Bin2D binX binY)

toConstr :: Bin2D binX binY -> Constr

dataTypeOf :: Bin2D binX binY -> DataType

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (Bin2D binX binY))

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Bin2D binX binY))

gmapT :: (forall b. Data b => b -> b) -> Bin2D binX binY -> Bin2D binX binY

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Bin2D binX binY -> r

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Bin2D binX binY -> r

gmapQ :: (forall d. Data d => d -> u) -> Bin2D binX binY -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Bin2D binX binY -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Bin2D binX binY -> m (Bin2D binX binY)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Bin2D binX binY -> m (Bin2D binX binY)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Bin2D binX binY -> m (Bin2D binX binY)

(Read bx, Read by) => Read (Bin2D bx by)

Methods

readsPrec :: Int -> ReadS (Bin2D bx by)

readList :: ReadS [Bin2D bx by]

readPrec :: ReadPrec (Bin2D bx by)

readListPrec :: ReadPrec [Bin2D bx by]

(Show bx, Show by) => Show (Bin2D bx by)

Methods

showsPrec :: Int -> Bin2D bx by -> ShowS

show :: Bin2D bx by -> String

showList :: [Bin2D bx by] -> ShowS

(NFData bx, NFData by) => NFData (Bin2D bx by)

Methods

rnf :: Bin2D bx by -> ()

(BinEq bx, BinEq by) => BinEq (Bin2D bx by)

Methods

binEq :: Bin2D bx by -> Bin2D bx by -> Bool

(Bin binX, Bin binY) => Bin (Bin2D binX binY)

Associated Types

type BinValue (Bin2D binX binY) :: *

Methods

toIndex :: Bin2D binX binY -> BinValue (Bin2D binX binY) -> Int

fromIndex :: Bin2D binX binY -> Int -> BinValue (Bin2D binX binY)

nBins :: Bin2D binX binY -> Int

inRange :: Bin2D binX binY -> BinValue (Bin2D binX binY) -> Bool

type BinValue (Bin2D binX binY)

type BinValue (Bin2D binX binY) = (BinValue binX, BinValue binY)

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

Alias for Bin2D.

type (:><:) = Bin2D

Type alias for Bin2D

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

2-dimensional size of binning algorithm

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

Convert index into pair of indices for X and Y axes

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

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'

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