Copyright | (c) 2017 Athan Clark |
---|---|
License | BSD-3 |
Maintainer | athan.clark@gmail.com |
Stability | experimental |
Portability | GHC |
Safe Haskell | None |
Language | Haskell2010 |
Documentation
Monadoid | |
|
Instances
MonadTrans Monadoid Source # | |
Defined in Data.Monadoid | |
MonadTransControl Monadoid Source # | |
(MonadReader r m, MonadWriter w m, MonadState s m) => MonadRWS r w s (Monadoid m) Source # | |
Defined in Data.Monadoid | |
MonadBase b m => MonadBase b (Monadoid m) Source # | |
Defined in Data.Monadoid | |
(MonadBase b m, MonadBaseControl b m) => MonadBaseControl b (Monadoid m) Source # | |
MonadWriter w m => MonadWriter w (Monadoid m) Source # | |
MonadState s m => MonadState s (Monadoid m) Source # | |
MonadReader r m => MonadReader r (Monadoid m) Source # | |
MonadError e m => MonadError e (Monadoid m) Source # | |
Defined in Data.Monadoid throwError :: e -> Monadoid m a # catchError :: Monadoid m a -> (e -> Monadoid m a) -> Monadoid m a # | |
Monad m => Monad (Monadoid m) Source # | |
Functor m => Functor (Monadoid m) Source # | |
Applicative m => Applicative (Monadoid m) Source # | |
Foldable m => Foldable (Monadoid m) Source # | |
Defined in Data.Monadoid fold :: Monoid m0 => Monadoid m m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> Monadoid m a -> m0 # foldr :: (a -> b -> b) -> b -> Monadoid m a -> b # foldr' :: (a -> b -> b) -> b -> Monadoid m a -> b # foldl :: (b -> a -> b) -> b -> Monadoid m a -> b # foldl' :: (b -> a -> b) -> b -> Monadoid m a -> b # foldr1 :: (a -> a -> a) -> Monadoid m a -> a # foldl1 :: (a -> a -> a) -> Monadoid m a -> a # toList :: Monadoid m a -> [a] # null :: Monadoid m a -> Bool # length :: Monadoid m a -> Int # elem :: Eq a => a -> Monadoid m a -> Bool # maximum :: Ord a => Monadoid m a -> a # minimum :: Ord a => Monadoid m a -> a # | |
Traversable m => Traversable (Monadoid m) Source # | |
Defined in Data.Monadoid | |
MonadIO m => MonadIO (Monadoid m) Source # | |
Defined in Data.Monadoid | |
MonadCont m => MonadCont (Monadoid m) Source # | |
Eq (m a) => Eq (Monadoid m a) Source # | |
(Typeable m, Typeable a, Data (m a)) => Data (Monadoid m a) Source # | |
Defined in Data.Monadoid gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Monadoid m a -> c (Monadoid m a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Monadoid m a) # toConstr :: Monadoid m a -> Constr # dataTypeOf :: Monadoid m a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Monadoid m a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Monadoid m a)) # gmapT :: (forall b. Data b => b -> b) -> Monadoid m a -> Monadoid m a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Monadoid m a -> r # gmapQr :: (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Monadoid m a -> r # gmapQ :: (forall d. Data d => d -> u) -> Monadoid m a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Monadoid m a -> u # gmapM :: Monad m0 => (forall d. Data d => d -> m0 d) -> Monadoid m a -> m0 (Monadoid m a) # gmapMp :: MonadPlus m0 => (forall d. Data d => d -> m0 d) -> Monadoid m a -> m0 (Monadoid m a) # gmapMo :: MonadPlus m0 => (forall d. Data d => d -> m0 d) -> Monadoid m a -> m0 (Monadoid m a) # | |
Ord (m a) => Ord (Monadoid m a) Source # | |
Defined in Data.Monadoid | |
Show (m a) => Show (Monadoid m a) Source # | |
Generic (Monadoid m a) Source # | |
(Applicative m, Semigroup a) => Semigroup (Monadoid m a) Source # | |
(Applicative m, Monoid a) => Monoid (Monadoid m a) Source # | The only important instance |
type StT Monadoid a Source # | |
Defined in Data.Monadoid | |
type StM (Monadoid m) a Source # | |
Defined in Data.Monadoid | |
type Rep (Monadoid m a) Source # | |
Defined in Data.Monadoid |