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

Language | Haskell98 |

# Documentation

## Instances

Functor T Source # | |

Foldable T Source # | |

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

Traversable T Source # | |

NFData T Source # | |

Show T Source # | |

Reverse T Source # | |

SortBy T Source # | |

Sort T Source # | |

Iterate T Source # | |

Defined in Data.Empty | |

Repeat T Source # | |

Defined in Data.Empty | |

Zip T Source # | |

View T Source # | |

Defined in Data.Empty | |

ViewR T Source # | |

ViewL T Source # | |

Empty T Source # | |

Defined in Data.Empty | |

InsertBy T Source # | |

Insert T Source # | |

Choose T Source # | |

Defined in Data.NonEmpty.Mixed | |

Eq (T a) Source # | |

Ord (T a) Source # | |

Show (T a) Source # | |

Arbitrary (T a) Source # | |

NFData (T a) Source # | |

Defined in Data.Empty |