Safe Haskell | None |
---|
Documentation
module Algebra.Applicative
module Algebra.Foldable
class Foldable t => Traversable t whereSource
sequence :: Applicative f => t (f a) -> f (t a)Source
Traversable [] | |
Traversable Maybe | |
Traversable Tree | |
Traversable Interleave | |
Traversable OrdList | |
Traversable ZipTree | |
Traversable ZipList | |
Traversable TimeVal | |
Traversable (Either a) | |
Traversable ((,) c) | |
Eq k => Traversable (Map k) | |
Traversable m => Traversable (MaybeT m) | |
Traversable m => Traversable (TreeT m) | |
Traversable m => Traversable (ListT m) | |
Traversable (Future t) | |
Traversable (Event t) | |
(Traversable f, Traversable g) => Traversable (:++: f g) | |
(Traversable f, Traversable g) => Traversable (:**: f g) | |
(Traversable f, Traversable g) => Traversable (:.: f g) | |
(Traversable f, Traversable g) => Traversable (Compose' f g) | |
Traversable m => Traversable (WriterT w m) | |
Traversable m => Traversable (EitherT e m) | |
Traversable m => Traversable (RWST Void w Void m) |
class Functor t => Contravariant t whereSource
Contravariant Id | |
Contravariant ((->) a) |
traverse :: (Applicative f, Traversable t) => (a -> f b) -> t a -> f (t b)Source
foreach :: (Applicative f, Traversable t) => t a -> (a -> f b) -> f (t b)Source
transpose :: (Applicative f, Traversable t) => t (f a) -> f (t a)Source
flip :: (Contravariant c, Functor f) => f (c a) -> c (f a)Source