Safe Haskell | Safe-Inferred |
---|---|

Language | Haskell98 |

# Documentation

#### Instances

(Functor f, Functor g) => Functor (T f g) Source # | |

(Foldable f, Foldable g) => Foldable (T f g) Source # | |

Defined in Data.Append fold :: Monoid m => T f g m -> m # foldMap :: Monoid m => (a -> m) -> T f g a -> m # foldMap' :: Monoid m => (a -> m) -> T f g a -> m # foldr :: (a -> b -> b) -> b -> T f g a -> b # foldr' :: (a -> b -> b) -> b -> T f g a -> b # foldl :: (b -> a -> b) -> b -> T f g a -> b # foldl' :: (b -> a -> b) -> b -> T f g a -> b # foldr1 :: (a -> a -> a) -> T f g a -> a # foldl1 :: (a -> a -> a) -> T f g a -> a # elem :: Eq a => a -> T f g a -> Bool # maximum :: Ord a => T f g a -> a # minimum :: Ord a => T f g a -> a # | |

(Traversable f, Traversable g) => Traversable (T f g) Source # | |

(NFData f, NFData g) => NFData (T f g) Source # | |

(NFData f, NFData g, NFData a) => NFData (T f g a) Source # | |

Defined in Data.Append |