Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Data.Wedge
Description
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
Bifunctor Wedge Source # | |
Bitraversable Wedge Source # | |
Defined in Data.Wedge Methods bitraverse :: Applicative f => (a -> f c) -> (b -> f d) -> Wedge a b -> f ( Wedge c d) Source # |
|
Bifoldable Wedge Source # | |
Monad ( Wedge a) Source # | |
Functor ( Wedge a) Source # | |
Applicative ( Wedge a) Source # | |
Defined in Data.Wedge |
|
Foldable ( Wedge a) Source # | |
Defined in Data.Wedge Methods fold :: Monoid m => Wedge a m -> m Source # foldMap :: Monoid m => (a0 -> m) -> Wedge a a0 -> m Source # foldMap' :: Monoid m => (a0 -> m) -> Wedge a a0 -> m Source # foldr :: (a0 -> b -> b) -> b -> Wedge a a0 -> b Source # foldr' :: (a0 -> b -> b) -> b -> Wedge a a0 -> b Source # foldl :: (b -> a0 -> b) -> b -> Wedge a a0 -> b Source # foldl' :: (b -> a0 -> b) -> b -> Wedge a a0 -> b Source # foldr1 :: (a0 -> a0 -> a0) -> Wedge a a0 -> a0 Source # foldl1 :: (a0 -> a0 -> a0) -> Wedge a a0 -> a0 Source # toList :: Wedge a a0 -> [a0] Source # null :: Wedge a a0 -> Bool Source # length :: Wedge a a0 -> Int Source # elem :: Eq a0 => a0 -> Wedge a a0 -> Bool Source # maximum :: Ord a0 => Wedge a a0 -> a0 Source # minimum :: Ord a0 => Wedge a a0 -> a0 Source # |
|
Eq a, Eq b) => Eq ( Wedge a b) ( Source # | |
Ord a, Ord b) => Ord ( Wedge a b) ( Source # | |
Defined in Data.Wedge Methods compare :: Wedge a b -> Wedge a b -> Ordering Source # (<) :: Wedge a b -> Wedge a b -> Bool Source # (<=) :: Wedge a b -> Wedge a b -> Bool Source # (>) :: Wedge a b -> Wedge a b -> Bool Source # (>=) :: Wedge a b -> Wedge a b -> Bool Source # |
|
Show a, Show b) => Show ( Wedge a b) ( Source # | |