Safe Haskell | None |
---|---|

Language | Haskell98 |

- data Bin2D binX binY = Bin2D {}
- (><) :: binX -> binY -> Bin2D binX binY
- type (:><:) = Bin2D
- nBins2D :: (Bin bx, Bin by) => Bin2D bx by -> (Int, Int)
- toIndex2D :: Bin binX => Bin2D binX binY -> Int -> (Int, Int)
- fmapBinX :: (Bin bx, Bin bx') => (bx -> bx') -> Bin2D bx by -> Bin2D bx' by
- fmapBinY :: (Bin by, Bin by') => (by -> by') -> Bin2D bx by -> Bin2D bx by'

# Documentation

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

(Eq binY, Eq binX) => Eq (Bin2D binX binY) Source # | |

(Data binY, Data binX) => Data (Bin2D binX binY) Source # | |

(Read bx, Read by) => Read (Bin2D bx by) Source # | |

(Show bx, Show by) => Show (Bin2D bx by) Source # | |

(NFData bx, NFData by) => NFData (Bin2D bx by) Source # | |

(BinEq bx, BinEq by) => BinEq (Bin2D bx by) Source # | |

(Bin binX, Bin binY) => Bin (Bin2D binX binY) Source # | |

type BinValue (Bin2D binX binY) Source # | |

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

2-dimensional size of binning algorithm

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

Convert index into pair of indices for X and Y axes