Copyright | (C) 2008 Edward Kmett (C) 2024 Koji Miyazato |
---|---|
License | BSD-style (see the file LICENSE) |
Maintainer | Koji Miyazato <viercc@gmail.com> |
Stability | experimental |
Portability | portable |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Control.Functor.Internal.Mutual
Description
Documentation
newtype Mutual p m n a Source #
Instances
(Bifoldable p, Foldable m, Foldable n) => Foldable (Mutual p m n) Source # | |
Defined in Control.Functor.Internal.Mutual Methods fold :: Monoid m0 => Mutual p m n m0 -> m0 # foldMap :: Monoid m0 => (a -> m0) -> Mutual p m n a -> m0 # foldMap' :: Monoid m0 => (a -> m0) -> Mutual p m n a -> m0 # foldr :: (a -> b -> b) -> b -> Mutual p m n a -> b # foldr' :: (a -> b -> b) -> b -> Mutual p m n a -> b # foldl :: (b -> a -> b) -> b -> Mutual p m n a -> b # foldl' :: (b -> a -> b) -> b -> Mutual p m n a -> b # foldr1 :: (a -> a -> a) -> Mutual p m n a -> a # foldl1 :: (a -> a -> a) -> Mutual p m n a -> a # toList :: Mutual p m n a -> [a] # null :: Mutual p m n a -> Bool # length :: Mutual p m n a -> Int # elem :: Eq a => a -> Mutual p m n a -> Bool # maximum :: Ord a => Mutual p m n a -> a # minimum :: Ord a => Mutual p m n a -> a # | |
(Bitraversable p, Traversable m, Traversable n) => Traversable (Mutual p m n) Source # | |
Defined in Control.Functor.Internal.Mutual Methods traverse :: Applicative f => (a -> f b) -> Mutual p m n a -> f (Mutual p m n b) # sequenceA :: Applicative f => Mutual p m n (f a) -> f (Mutual p m n a) # mapM :: Monad m0 => (a -> m0 b) -> Mutual p m n a -> m0 (Mutual p m n b) # sequence :: Monad m0 => Mutual p m n (m0 a) -> m0 (Mutual p m n a) # | |
(Bifunctor p, Functor m, Functor n) => Functor (Mutual p m n) Source # | |
(Show (m (p a (Mutual p n m a))), Show (n (p a (Mutual p m n a)))) => Show (Mutual p n m a) Source # | |
(Eq (m (p a (Mutual p n m a))), Eq (n (p a (Mutual p m n a)))) => Eq (Mutual p n m a) Source # | |
foldMutual :: Bifunctor p => (forall a b. t a -> (a -> p b (t b)) -> t b) -> (forall a. m a -> t a) -> (forall a. n a -> t a) -> Mutual p m n c -> t c Source #
unfoldMutual :: Bifunctor p => (forall a b. (p a (s a) -> b) -> s a -> s b) -> (forall a. s a -> w a) -> (forall a. s a -> v a) -> s c -> Mutual p w v c Source #