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

Language | Haskell98 |

# Documentation

## Instances

Ord k => Functor (T k) Source # | |

Ord k => Foldable (T k) Source # | |

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

Ord k => Traversable (T k) Source # | |

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

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

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

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

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

Defined in Data.NonEmpty.Map |

minViewWithKey :: T k a -> ((k, a), Map k a) Source #