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

Language | Haskell98 |

# Documentation

## Instances

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

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

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

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

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

Gen f => Gen (T f) Source # | |

Arbitrary f => Arbitrary (T f) Source # | |

Show f => Show (T f) Source # | |

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

(InsertBy f, SortBy f) => SortBy (T f) Source # | |

(Insert f, Sort f) => Sort (T f) Source # | |

Iterate f => Iterate (T f) Source # | |

Defined in Data.Optional | |

Repeat f => Repeat (T f) Source # | |

Defined in Data.Optional | |

Zip f => Zip (T f) Source # | |

(Cons f, Empty f) => Cons (T f) Source # | |

Empty (T f) Source # | |

Defined in Data.Optional | |

InsertBy f => InsertBy (T f) Source # | |

Insert f => Insert (T f) Source # | |

(Eq a, Eq (f a)) => Eq (T f a) Source # | |

(Ord a, Ord (f a)) => Ord (T f a) Source # | |

(Show f, Show a) => Show (T f a) Source # | |

(Arbitrary f, Arbitrary a) => Arbitrary (T f a) Source # | |

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

Defined in Data.Optional |

fromNonEmpty :: T f a -> T f a Source #