| Safe Haskell | Safe |
|---|---|
| Language | Haskell2010 |
FTypes.Classes.FTraversable
Documentation
class FFunctor r => FTraversable r where
Minimal complete definition
Methods
ftraverse :: Applicative g => (f ==> Compose g h) -> r f -> g (r h)
fsequenceA :: Applicative g => r (Compose g h) -> g (r h)
Instances
| FTraversable * r => FTraversable * (Precompose r f) | |
| (FTraversable * rec, Traversable f) => FTraversable * (Postcompose rec f) | |
| FTraversable k (FApply k x) | |
| (FTraversable k r, FTraversable k s) => FTraversable k (FSum (k -> *) r s) | |
| (FTraversable k r, FTraversable k s) => FTraversable k (FProd (k -> *) r s) |
ftraverse' :: (FTraversable r, Applicative g) => (f ==> g) -> r f -> g (r Identity)
fsequenceA' :: (FTraversable r, Applicative f) => r f -> f (r Identity)
ftoList :: FTraversable rec => rec (Const a) -> [a]