monad-ideals-0.1.1.0: Ideal Monads and coproduct of them
Copyright(C) 2008 Edward Kmett (C) 2024 Koji Miyazato
LicenseBSD-style (see the file LICENSE)
MaintainerKoji Miyazato <viercc@gmail.com>
Stabilityexperimental
Portabilityportable
Safe HaskellSafe-Inferred
LanguageHaskell2010

Control.Functor.Internal.Mutual

Description

 

Documentation

newtype Mutual p m n a Source #

Constructors

Mutual 

Fields

Instances

Instances details
(Bifoldable p, Foldable m, Foldable n) => Foldable (Mutual p m n) Source # 
Instance details

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 #

sum :: Num a => Mutual p m n a -> a #

product :: Num a => Mutual p m n a -> a #

(Bitraversable p, Traversable m, Traversable n) => Traversable (Mutual p m n) Source # 
Instance details

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 # 
Instance details

Defined in Control.Functor.Internal.Mutual

Methods

fmap :: (a -> b) -> Mutual p m n a -> Mutual p m n b #

(<$) :: a -> Mutual p m n b -> Mutual p m n a #

(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 # 
Instance details

Defined in Control.Functor.Internal.Mutual

Methods

showsPrec :: Int -> Mutual p n m a -> ShowS #

show :: Mutual p n m a -> String #

showList :: [Mutual p n m a] -> ShowS #

(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 # 
Instance details

Defined in Control.Functor.Internal.Mutual

Methods

(==) :: Mutual p n m a -> Mutual p n m a -> Bool #

(/=) :: Mutual p n m a -> Mutual p n m a -> Bool #

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 #