histogram-fill-0.8.5.0: Library for histograms creation.

Safe HaskellNone
LanguageHaskell98

Data.Histogram.Bin.BinEnum

Synopsis

Documentation

newtype BinEnum a Source #

Bin for types which are instnaces of Enum type class. Value are converted to Int using fromEnum first and then binned.

Constructors

BinEnum BinI 

Instances

Eq (BinEnum a) Source # 

Methods

(==) :: BinEnum a -> BinEnum a -> Bool #

(/=) :: BinEnum a -> BinEnum a -> Bool #

Data a => Data (BinEnum a) Source # 

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> BinEnum a -> c (BinEnum a) #

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (BinEnum a) #

toConstr :: BinEnum a -> Constr #

dataTypeOf :: BinEnum a -> DataType #

dataCast1 :: Typeable (* -> *) t => (forall d. Data d => c (t d)) -> Maybe (c (BinEnum a)) #

dataCast2 :: Typeable (* -> * -> *) t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (BinEnum a)) #

gmapT :: (forall b. Data b => b -> b) -> BinEnum a -> BinEnum a #

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> BinEnum a -> r #

gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> BinEnum a -> r #

gmapQ :: (forall d. Data d => d -> u) -> BinEnum a -> [u] #

gmapQi :: Int -> (forall d. Data d => d -> u) -> BinEnum a -> u #

gmapM :: Monad m => (forall d. Data d => d -> m d) -> BinEnum a -> m (BinEnum a) #

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> BinEnum a -> m (BinEnum a) #

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> BinEnum a -> m (BinEnum a) #

Read (BinEnum a) Source # 
Show (BinEnum a) Source # 

Methods

showsPrec :: Int -> BinEnum a -> ShowS #

show :: BinEnum a -> String #

showList :: [BinEnum a] -> ShowS #

NFData (BinEnum a) Source # 

Methods

rnf :: BinEnum a -> () #

(Enum a, Ord a) => SliceableBin (BinEnum a) Source # 

Methods

unsafeSliceBin :: Int -> Int -> BinEnum a -> BinEnum a Source #

(Enum a, Ord a) => Bin1D (BinEnum a) Source # 
(Enum a, Ord a) => IntervalBin (BinEnum a) Source # 
Enum a => BinEq (BinEnum a) Source # 

Methods

binEq :: BinEnum a -> BinEnum a -> Bool Source #

Enum a => Bin (BinEnum a) Source # 

Associated Types

type BinValue (BinEnum a) :: * Source #

type BinValue (BinEnum a) Source # 
type BinValue (BinEnum a) = a

binEnum :: Enum a => a -> a -> BinEnum a Source #

Create enum based bin

binEnumFull :: (Enum a, Bounded a) => BinEnum a Source #

Use full range of data