| Copyright | Copyright (c) 2010, Alexey Khudyakov <alexey.skladnoy@gmail.com> |
|---|---|
| License | BSD3 |
| Maintainer | Alexey Khudyakov <alexey.skladnoy@gmail.com> |
| Stability | experimental |
| Safe Haskell | None |
| Language | Haskell98 |
Data.Histogram.Bin.Extra
Description
Extra binning algorithms
- class Enum2D a where
- data BinEnum2D i
- binEnum2D :: Enum2D i => i -> i -> BinEnum2D i
- data BinPermute b
- permuteByTable :: Bin b => b -> Vector Int -> Maybe (BinPermute b)
- permuteBin :: Bin b => b -> (Int -> Int) -> Maybe (BinPermute b)
Documentation
Type class very similar to Enum but elements of type are
enumerated on 2-dimensional grid
Binning for 2D enumerations
data BinPermute b Source
Direct permutation of indices.
Instances
| Eq b => Eq (BinPermute b) | |
| Data b => Data (BinPermute b) | |
| Read BinI => Read (BinPermute BinI) | |
| Show b => Show (BinPermute b) | |
| NFData b => NFData (BinPermute b) | |
| UniformBin b => UniformBin (BinPermute b) | |
| VariableBin b => VariableBin (BinPermute b) | |
| IntervalBin b => IntervalBin (BinPermute b) | |
| Bin b => Bin (BinPermute b) | |
| Typeable (* -> *) BinPermute | |
| type BinValue (BinPermute b) = BinValue b |
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.