| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Traq.Data.Probability.List
Documentation
Constructors
| ProbList | |
Fields
| |
Instances
| ProbType probT => MonadExp probT (ProbList probT) # | |
Defined in Traq.Data.Probability.List Methods expectationA :: (Applicative f, RVType probT r) => (a -> f r) -> ProbList probT a -> f r # | |
| ProbType probT => MonadProb probT (ProbList probT) # | |
| Foldable (ProbList probT) # | |
Defined in Traq.Data.Probability.List Methods fold :: Monoid m => ProbList probT m -> m # foldMap :: Monoid m => (a -> m) -> ProbList probT a -> m # foldMap' :: Monoid m => (a -> m) -> ProbList probT a -> m # foldr :: (a -> b -> b) -> b -> ProbList probT a -> b # foldr' :: (a -> b -> b) -> b -> ProbList probT a -> b # foldl :: (b -> a -> b) -> b -> ProbList probT a -> b # foldl' :: (b -> a -> b) -> b -> ProbList probT a -> b # foldr1 :: (a -> a -> a) -> ProbList probT a -> a # foldl1 :: (a -> a -> a) -> ProbList probT a -> a # toList :: ProbList probT a -> [a] # null :: ProbList probT a -> Bool # length :: ProbList probT a -> Int # elem :: Eq a => a -> ProbList probT a -> Bool # maximum :: Ord a => ProbList probT a -> a # minimum :: Ord a => ProbList probT a -> a # | |
| Num probT => Applicative (ProbList probT) # | |
Defined in Traq.Data.Probability.List Methods pure :: a -> ProbList probT a # (<*>) :: ProbList probT (a -> b) -> ProbList probT a -> ProbList probT b # liftA2 :: (a -> b -> c) -> ProbList probT a -> ProbList probT b -> ProbList probT c # (*>) :: ProbList probT a -> ProbList probT b -> ProbList probT b # (<*) :: ProbList probT a -> ProbList probT b -> ProbList probT a # | |
| Functor (ProbList probT) # | |
| Num probT => Monad (ProbList probT) # | |
| (Read probT, Read a) => Read (ProbList probT a) # | |
| (Show probT, Show a) => Show (ProbList probT a) # | |
| (Eq probT, Eq a) => Eq (ProbList probT a) # | |