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

Language | Haskell98 |

## Synopsis

- 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

## Instances

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

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

Defined in Data.Histogram.Bin.Bin2D 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) Source # | |

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

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

Defined in Data.Histogram.Bin.Bin2D | |

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

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

Defined in Data.Histogram.Bin.Bin2D | |

(ConvertBin bx bx', ConvertBin by by') => ConvertBin (Bin2D bx by) (Bin2D bx' by') Source # | |

Defined in Data.Histogram.Bin convertBin :: Bin2D bx by -> Bin2D bx' by' Source # | |

(ConvertBin by by', Bin bx) => ConvertBin (Bin2D bx by) (Bin2D bx by') Source # | |

Defined in Data.Histogram.Bin convertBin :: Bin2D bx by -> Bin2D bx by' Source # | |

(ConvertBin bx bx', Bin by) => ConvertBin (Bin2D bx by) (Bin2D bx' by) Source # | |

Defined in Data.Histogram.Bin convertBin :: Bin2D bx by -> Bin2D bx' by Source # | |

type BinValue (Bin2D binX binY) Source # | |

Defined in Data.Histogram.Bin.Bin2D |

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