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

Language | Haskell2010 |

This module is a simplified version of https://hackage.haskell.org/package/smash/docs/Data-Wedge.html#t:Wedge, which is copyrighted by Emily Pillmore and originally pulished using BSD-3-Clause license.

copyright: Emily Pillmore 2020-2021, iohk 2021

# Documentation

#### Instances

Bifoldable Wedge Source # | |

Bifunctor Wedge Source # | |

Bitraversable Wedge Source # | |

Defined in Data.Wedge bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Wedge a b -> f (Wedge c d) # | |

Applicative (Wedge a) Source # | |

Functor (Wedge a) Source # | |

Monad (Wedge a) Source # | |

Foldable (Wedge a) Source # | |

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

(Show a, Show b) => Show (Wedge a b) Source # | |

(Eq a, Eq b) => Eq (Wedge a b) Source # | |

(Ord a, Ord b) => Ord (Wedge a b) Source # | |

Defined in Data.Wedge |