Safe Haskell | None |
---|---|
Language | Haskell2010 |
Documentation
Instances
Bifunctor p => Functor (Join p) Source # | |
Bifoldable p => Foldable (Join p) Source # | |
Defined in Data.Functor.Join fold :: Monoid m => Join p m -> m # foldMap :: Monoid m => (a -> m) -> Join p a -> m # foldr :: (a -> b -> b) -> b -> Join p a -> b # foldr' :: (a -> b -> b) -> b -> Join p a -> b # foldl :: (b -> a -> b) -> b -> Join p a -> b # foldl' :: (b -> a -> b) -> b -> Join p a -> b # foldr1 :: (a -> a -> a) -> Join p a -> a # foldl1 :: (a -> a -> a) -> Join p a -> a # elem :: Eq a => a -> Join p a -> Bool # maximum :: Ord a => Join p a -> a # minimum :: Ord a => Join p a -> a # | |
Bitraversable p => Traversable (Join p) Source # | |
Eq2 p => Eq1 (Join p) Source # | |
Ord2 p => Ord1 (Join p) Source # | |
Defined in Data.Functor.Join | |
Read2 p => Read1 (Join p) Source # | |
Defined in Data.Functor.Join | |
Show2 p => Show1 (Join p) Source # | |
Bicotraversable p => Cotraversable (Join p) Source # | |
(Eq2 p, Eq a) => Eq (Join p a) Source # | |
(Ord2 p, Ord a) => Ord (Join p a) Source # | |
Defined in Data.Functor.Join | |
(Read2 p, Read a) => Read (Join p a) Source # | |
(Show2 p, Show a) => Show (Join p a) Source # | |