Data.Cotraversable

Documentation

class Functor f => Cotraversable f where

Methods

collect :: Functor g => (a -> f b) -> g a -> f (g b)

cosequence :: Functor g => g (f a) -> f (g a)

cotraverse :: Functor g => (g a -> b) -> g (f a) -> f b

Instances

Cotraversable Identity

Methods

collect :: Functor g => (a -> Identity b) -> g a -> Identity (g b)

cosequence :: Functor g => g (Identity a) -> Identity (g a)

cotraverse :: Functor g => (g a -> b) -> g (Identity a) -> Identity b

Cotraversable ((->) r)

Methods

collect :: Functor g => (a -> r -> b) -> g a -> r -> g b

cosequence :: Functor g => g (r -> a) -> r -> g a

cotraverse :: Functor g => (g a -> b) -> g (r -> a) -> r -> b

Cotraversable (Proxy *)

Methods

collect :: Functor g => (a -> Proxy * b) -> g a -> Proxy * (g b)

cosequence :: Functor g => g (Proxy * a) -> Proxy * (g a)

cotraverse :: Functor g => (g a -> b) -> g (Proxy * a) -> Proxy * b

Cotraversable f => Cotraversable (Reverse * f)

Methods

collect :: Functor g => (a -> Reverse * f b) -> g a -> Reverse * f (g b)

cosequence :: Functor g => g (Reverse * f a) -> Reverse * f (g a)

cotraverse :: Functor g => (g a -> b) -> g (Reverse * f a) -> Reverse * f b

Cotraversable f => Cotraversable (Backwards * f)

Methods

collect :: Functor g => (a -> Backwards * f b) -> g a -> Backwards * f (g b)

cosequence :: Functor g => g (Backwards * f a) -> Backwards * f (g a)

cotraverse :: Functor g => (g a -> b) -> g (Backwards * f a) -> Backwards * f b

Cotraversable f => Cotraversable (IdentityT * f)

Methods

collect :: Functor g => (a -> IdentityT * f b) -> g a -> IdentityT * f (g b)

cosequence :: Functor g => g (IdentityT * f a) -> IdentityT * f (g a)

cotraverse :: Functor g => (g a -> b) -> g (IdentityT * f a) -> IdentityT * f b

(Cotraversable f, Cotraversable g) => Cotraversable (Product * f g)

Methods

collect :: Functor g => (a -> Product * f g b) -> g a -> Product * f g (g b)

cosequence :: Functor g => g (Product * f g a) -> Product * f g (g a)

cotraverse :: Functor g => (g a -> b) -> g (Product * f g a) -> Product * f g b

Cotraversable f => Cotraversable (ReaderT * r f)

Methods

collect :: Functor g => (a -> ReaderT * r f b) -> g a -> ReaderT * r f (g b)

cosequence :: Functor g => g (ReaderT * r f a) -> ReaderT * r f (g a)

cotraverse :: Functor g => (g a -> b) -> g (ReaderT * r f a) -> ReaderT * r f b

(Cotraversable f, Cotraversable g) => Cotraversable (Compose * * f g)

Methods

collect :: Functor g => (a -> Compose * * f g b) -> g a -> Compose * * f g (g b)

cosequence :: Functor g => g (Compose * * f g a) -> Compose * * f g (g a)

cotraverse :: Functor g => (g a -> b) -> g (Compose * * f g a) -> Compose * * f g b