histogram-fill-0.9.0.0: Library for histograms creation.

Data.Histogram.Bin.Extra

Description

Extra binning algorithms

Synopsis

# Documentation

class Enum2D a where Source #

Type class very similar to Enum but elements of type are enumerated on 2-dimensional grid

Minimal complete definition

Methods

fromEnum2D :: a -> (Int, Int) Source #

Convert value to index

toEnum2D :: (Int, Int) -> a Source #

Convert index to value

Instances

 (Enum a, Enum b) => Enum2D (a, b) Source # MethodsfromEnum2D :: (a, b) -> (Int, Int) Source #toEnum2D :: (Int, Int) -> (a, b) Source #

data BinEnum2D i Source #

Binning for 2D enumerations

Instances

 Eq (BinEnum2D i) Source # Methods(==) :: BinEnum2D i -> BinEnum2D i -> Bool #(/=) :: BinEnum2D i -> BinEnum2D i -> Bool # Data i => Data (BinEnum2D i) Source # Methodsgfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BinEnum2D i -> c (BinEnum2D i) #gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (BinEnum2D i) #toConstr :: BinEnum2D i -> Constr #dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (BinEnum2D i)) #dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (BinEnum2D i)) #gmapT :: (forall b. Data b => b -> b) -> BinEnum2D i -> BinEnum2D i #gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BinEnum2D i -> r #gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BinEnum2D i -> r #gmapQ :: (forall d. Data d => d -> u) -> BinEnum2D i -> [u] #gmapQi :: Int -> (forall d. Data d => d -> u) -> BinEnum2D i -> u #gmapM :: Monad m => (forall d. Data d => d -> m d) -> BinEnum2D i -> m (BinEnum2D i) #gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BinEnum2D i -> m (BinEnum2D i) #gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BinEnum2D i -> m (BinEnum2D i) # (Read i, Enum2D i) => Read (BinEnum2D i) Source # MethodsreadsPrec :: Int -> ReadS (BinEnum2D i) # (Show i, Enum2D i) => Show (BinEnum2D i) Source # MethodsshowsPrec :: Int -> BinEnum2D i -> ShowS #show :: BinEnum2D i -> String #showList :: [BinEnum2D i] -> ShowS # Source # Methodsrnf :: BinEnum2D i -> () # Enum2D i => Bin (BinEnum2D i) Source # Associated Typestype BinValue (BinEnum2D i) :: * Source # MethodstoIndex :: BinEnum2D i -> BinValue (BinEnum2D i) -> Int Source #nBins :: BinEnum2D i -> Int Source #inRange :: BinEnum2D i -> BinValue (BinEnum2D i) -> Bool Source # type BinValue (BinEnum2D i) Source # type BinValue (BinEnum2D i) = i

binEnum2D :: Enum2D i => i -> i -> BinEnum2D i Source #

Construct indexed bin

data BinPermute b Source #

Direct permutation of indices.

Instances

 Eq b => Eq (BinPermute b) Source # Methods(==) :: BinPermute b -> BinPermute b -> Bool #(/=) :: BinPermute b -> BinPermute b -> Bool # Data b => Data (BinPermute b) Source # Methodsgfoldl :: (forall d a. Data d => c (d -> a) -> d -> c a) -> (forall g. g -> c g) -> BinPermute b -> c (BinPermute b) #gunfold :: (forall a r. Data a => c (a -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (BinPermute b) #dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (BinPermute b)) #dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (BinPermute b)) #gmapT :: (forall a. Data a => a -> a) -> BinPermute b -> BinPermute b #gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BinPermute b -> r #gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BinPermute b -> r #gmapQ :: (forall d. Data d => d -> u) -> BinPermute b -> [u] #gmapQi :: Int -> (forall d. Data d => d -> u) -> BinPermute b -> u #gmapM :: Monad m => (forall d. Data d => d -> m d) -> BinPermute b -> m (BinPermute b) #gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BinPermute b -> m (BinPermute b) #gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BinPermute b -> m (BinPermute b) # Source # Methods Show b => Show (BinPermute b) Source # MethodsshowsPrec :: Int -> BinPermute b -> ShowS #show :: BinPermute b -> String #showList :: [BinPermute b] -> ShowS # NFData b => NFData (BinPermute b) Source # Methodsrnf :: BinPermute b -> () # Source # Methods Source # Methods Source # MethodsbinInterval :: BinPermute b -> Int -> (BinValue (BinPermute b), BinValue (BinPermute b)) Source #binsList :: Vector v (BinValue (BinPermute b), BinValue (BinPermute b)) => BinPermute b -> v (BinValue (BinPermute b), BinValue (BinPermute b)) Source # Bin b => Bin (BinPermute b) Source # Associated Typestype BinValue (BinPermute b) :: * Source # MethodstoIndex :: BinPermute b -> BinValue (BinPermute b) -> Int Source #inRange :: BinPermute b -> BinValue (BinPermute b) -> Bool Source # type BinValue (BinPermute b) Source # 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.