| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
UVMHS.Core.Classes.Functors
Documentation
Constructors
| NoCostID a |
class FunctorM (t :: Type -> Type) where Source #
Minimal complete definition
Nothing
Methods
Instances
| FunctorM 𝐼 Source # | |
| FunctorM 𝐿 Source # | |
| FunctorM 𝑂 Source # | |
| FunctorM AddBT Source # | |
| FunctorM AddBot Source # | |
| FunctorM AddNull Source # | |
| FunctorM AddTop Source # | |
| FunctorM ZOM Source # | |
| FunctorM 𝐼C Source # | |
| FunctorM 𝕍 Source # | |
| FunctorM FrameGrouping Source # | |
Defined in UVMHS.Lib.Dataframe Methods mapM :: Monad m => (a -> m b) -> FrameGrouping a -> m (FrameGrouping b) Source # | |
| FunctorM AddInf Source # | |
| FunctorM AddZI Source # | |
| FunctorM AddZer Source # | |
| FunctorM [] Source # | |
Defined in UVMHS.Core.Data.LazyList | |
| Ord k => FunctorM (EDct (StdESD k)) Source # | |
| FunctorM ((⇰) k) Source # | |
| FunctorM ((∧) a) Source # | |
| FunctorM ((∨) a) Source # | |
| FunctorM (𝐴 t) Source # | |
class KFunctorM k (t :: Type -> Type) | t -> k where Source #
Minimal complete definition
Nothing
Methods
kmapM :: Monad m => (k -> a -> m b) -> t a -> m (t b) Source #
default kmapM :: (OKFunctorM k t, Monad m) => (k -> a -> m b) -> t a -> m (t b) Source #
kmapAtM :: Monad m => k -> (a -> m a) -> t a -> m (t a) Source #
default kmapAtM :: (OKFunctorM k t, Monad m) => k -> (a -> m a) -> t a -> m (t a) Source #
class OKFunctorM k (t :: Type -> Type) | t -> k where Source #
class BiFunctorM (t :: Type -> Type) where Source #
Minimal complete definition
Nothing
class OBiFunctorM (t :: Type -> Type) where Source #
class KBiFunctorM k (t :: Type -> Type) | t -> k where Source #
Minimal complete definition
Nothing
class OKBiFunctorM k (t :: Type -> Type) | t -> k where Source #
class Functor (t :: Type -> Type) where Source #
Minimal complete definition
Nothing
Methods
Instances
class KFunctor k (t :: Type -> Type) | t -> k where Source #
Minimal complete definition
Nothing
class OKFunctor k (t :: Type -> Type) | t -> k where Source #
Minimal complete definition
Nothing
class BiFunctor (t :: Type -> Type) where Source #
Minimal complete definition
Nothing
class OBiFunctor (t :: Type -> Type) where Source #
Minimal complete definition
Nothing
class KBiFunctor k (t :: Type -> Type) where Source #
Minimal complete definition
Nothing
class OKBiFunctor k (t :: Type -> Type) where Source #
Minimal complete definition
Nothing
okmapAtMOn :: (OKFunctorM k t, Monad m) => k -> t a -> (𝑂 a -> m (𝑂 a)) -> m (t a) Source #
bimapMOn :: (BiFunctorM t, Monad m) => t a -> t b -> (a -> m c) -> (b -> m c) -> (a -> b -> m c) -> m (t c) Source #
obimapMOn :: (OBiFunctorM t, Monad m) => t a -> t b -> (a -> m (𝑂 c)) -> (b -> m (𝑂 c)) -> (a -> b -> m (𝑂 c)) -> m (t c) Source #
kbimapMOn :: (KBiFunctorM k t, Monad m) => t a -> t b -> (k -> a -> m c) -> (k -> b -> m c) -> (k -> a -> b -> m c) -> m (t c) Source #
okbimapMOn :: (OKBiFunctorM k t, Monad m) => t a -> t b -> (k -> a -> m (𝑂 c)) -> (k -> b -> m (𝑂 c)) -> (k -> a -> b -> m (𝑂 c)) -> m (t c) Source #
obimapOn :: OBiFunctor t => t a -> t b -> (a -> 𝑂 c) -> (b -> 𝑂 c) -> (a -> b -> 𝑂 c) -> t c Source #
kbimapOn :: KBiFunctor k t => t a -> t b -> (k -> a -> c) -> (k -> b -> c) -> (k -> a -> b -> c) -> t c Source #
okbimapOn :: OKBiFunctor k t => t a -> t b -> (k -> a -> 𝑂 c) -> (k -> b -> 𝑂 c) -> (k -> a -> b -> 𝑂 c) -> t c Source #
class Functor2 (w :: (Type -> Type) -> Type -> Type) where Source #
Instances
| Functor2 FailT Source # | |
| Functor2 (DelayT :: (Type -> Type) -> Type -> Type) Source # | |
| Functor2 (ErrorT e) Source # | |
| Functor2 (StateT s) Source # | |
| Monoid o => Functor2 (WriterT o) Source # | |
| Functor2 (ReaderT r :: (Type -> Type) -> Type -> Type) Source # | |
| (Functor2 t₁, Functor2 t₂) => Functor2 (t₁ ⊡ t₂) Source # | |
| Monoid o => Functor2 (RWST r o s) Source # | |
class Functor2Iso (w :: (Type -> Type) -> Type -> Type) where Source #
class Return (m :: Type -> Type) where Source #
Instances
class Bind (m :: Type -> Type) where Source #
Instances
class (Functor m, Return m, Bind m) => Monad (m :: Type -> Type) Source #
Instances
class Transformer (t :: (Type -> Type) -> Type -> Type) where Source #
Instances
| Transformer FailT Source # | |
| Transformer NondetT Source # | |
| Transformer (DelayT :: (Type -> Type) -> Type -> Type) Source # | |
| Transformer (ErrorT e) Source # | |
| Transformer (StateT s) Source # | |
| Transformer (UContT :: (Type -> Type) -> Type -> Type) Source # | |
| Null o => Transformer (WriterT o) Source # | |
| Transformer (ContT u) Source # | |
| Transformer (ReaderT r :: (Type -> Type) -> Type -> Type) Source # | |
| Monoid o => Transformer (RWST r o s) Source # | |