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

Language | Haskell2010 |

# Documentation

#### Instances

Bifunctor Entry Source # | |

Functor (Entry p) Source # | |

Foldable (Entry p) Source # | |

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

Traversable (Entry p) Source # | |

Eq p => Eq (Entry p a) Source # | |

Ord p => Ord (Entry p a) Source # | |

Defined in Data.Entry | |

(Read p, Read a) => Read (Entry p a) Source # | |

(Show p, Show a) => Show (Entry p a) Source # | |