Safe Haskell	None
Language	Haskell2010

Data.ITraversable

Contents

Synopsis

class IFunctor f => ITraversable f where
- itraverse :: (Applicative m, SingI ix) => (forall ix. SingI ix => a ix -> m (b ix)) -> f a ix -> m (f b ix)
imapDefault :: ITraversable f => (a ~~> b) -> f a ~~> f b
module Data.IFunctor

Documentation

Methods

itraverse :: (Applicative m, SingI ix) => (forall ix. SingI ix => a ix -> m (b ix)) -> f a ix -> m (f b ix) Source #

Instances details

ITraversable (IIdentity :: (k -> Type) -> k -> Type) Source #
Instance details Defined in Data.IFunctor.IIdentity Methods itraverse :: forall m (ix :: k0) a b. (Applicative m, SingI ix) => (forall (ix :: k1). SingI ix => a ix -> m (b ix)) -> IIdentity a ix -> m (IIdentity b ix) Source #
ITraversable (Product a :: (k -> Type) -> k -> Type) Source #
Instance details Defined in Data.ITraversable Methods itraverse :: forall m (ix :: k0) a0 b. (Applicative m, SingI ix) => (forall (ix :: k1). SingI ix => a0 ix -> m (b ix)) -> Product a a0 ix -> m (Product a b ix) Source #
ITraversable (Sum a :: (k -> Type) -> k -> Type) Source #
Instance details Defined in Data.ITraversable Methods itraverse :: forall m (ix :: k0) a0 b. (Applicative m, SingI ix) => (forall (ix :: k1). SingI ix => a0 ix -> m (b ix)) -> Sum a a0 ix -> m (Sum a b ix) Source #
ITraversable f => ITraversable (IFree f :: (k -> Type) -> k -> Type) Source #
Instance details Defined in Data.IFunctor.IFree Methods itraverse :: forall m (ix :: k0) a b. (Applicative m, SingI ix) => (forall (ix :: k1). SingI ix => a ix -> m (b ix)) -> IFree f a ix -> m (IFree f b ix) Source #
ITraversable f => ITraversable (ICofree f :: (k -> Type) -> k -> Type) Source #
Instance details Defined in Data.IFunctor.ICofree Methods itraverse :: forall m (ix :: k0) a b. (Applicative m, SingI ix) => (forall (ix :: k1). SingI ix => a ix -> m (b ix)) -> ICofree f a ix -> m (ICofree f b ix) Source #

Default imap for deriving IFunctor

Re-exports