Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Data.Functor.Compose.Compat
Documentation
newtype Compose (f :: k -> Type) (g :: k1 -> k) (a :: k1) #
Constructors
Compose | |
Fields
|
Instances
TestEquality f => TestEquality (Compose f g :: k2 -> Type) | |||||
Defined in Data.Functor.Compose | |||||
Functor f => Generic1 (Compose f g :: k -> Type) | |||||
Defined in Data.Functor.Compose Associated Types
| |||||
(Foldable1 f, Foldable1 g) => Foldable1 (Compose f g) | |||||
Defined in Data.Foldable1 Methods fold1 :: Semigroup m => Compose f g m -> m # foldMap1 :: Semigroup m => (a -> m) -> Compose f g a -> m # foldMap1' :: Semigroup m => (a -> m) -> Compose f g a -> m # toNonEmpty :: Compose f g a -> NonEmpty a # maximum :: Ord a => Compose f g a -> a # minimum :: Ord a => Compose f g a -> a # foldrMap1 :: (a -> b) -> (a -> b -> b) -> Compose f g a -> b # foldlMap1' :: (a -> b) -> (b -> a -> b) -> Compose f g a -> b # foldlMap1 :: (a -> b) -> (b -> a -> b) -> Compose f g a -> b # foldrMap1' :: (a -> b) -> (a -> b -> b) -> Compose f g a -> b # | |||||
(Eq1 f, Eq1 g) => Eq1 (Compose f g) | |||||
(Ord1 f, Ord1 g) => Ord1 (Compose f g) | |||||
Defined in Data.Functor.Compose Methods liftCompare :: (a -> b -> Ordering) -> Compose f g a -> Compose f g b -> Ordering | |||||
(Read1 f, Read1 g) => Read1 (Compose f g) | |||||
Defined in Data.Functor.Compose | |||||
(Show1 f, Show1 g) => Show1 (Compose f g) | |||||
Defined in Data.Functor.Compose | |||||
(Functor f, Contravariant g) => Contravariant (Compose f g) | |||||
(Alternative f, Applicative g) => Alternative (Compose f g) | |||||
(Applicative f, Applicative g) => Applicative (Compose f g) | |||||
Defined in Data.Functor.Compose | |||||
(Functor f, Functor g) => Functor (Compose f g) | |||||
(Foldable f, Foldable g) => Foldable (Compose f g) | |||||
Defined in Data.Functor.Compose Methods fold :: Monoid m => Compose f g m -> m # foldMap :: Monoid m => (a -> m) -> Compose f g a -> m # foldMap' :: Monoid m => (a -> m) -> Compose f g a -> m # foldr :: (a -> b -> b) -> b -> Compose f g a -> b # foldr' :: (a -> b -> b) -> b -> Compose f g a -> b # foldl :: (b -> a -> b) -> b -> Compose f g a -> b # foldl' :: (b -> a -> b) -> b -> Compose f g a -> b # foldr1 :: (a -> a -> a) -> Compose f g a -> a # foldl1 :: (a -> a -> a) -> Compose f g a -> a # toList :: Compose f g a -> [a] # null :: Compose f g a -> Bool # length :: Compose f g a -> Int # elem :: Eq a => a -> Compose f g a -> Bool # maximum :: Ord a => Compose f g a -> a # minimum :: Ord a => Compose f g a -> a # | |||||
(Traversable f, Traversable g) => Traversable (Compose f g) | |||||
Defined in Data.Functor.Compose | |||||
Monoid (f (g a)) => Monoid (Compose f g a) | |||||
Semigroup (f (g a)) => Semigroup (Compose f g a) | |||||
(Typeable a, Typeable f, Typeable g, Typeable k1, Typeable k2, Data (f (g a))) => Data (Compose f g a) | |||||
Defined in Data.Functor.Compose Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g0. g0 -> c g0) -> Compose f g a -> c (Compose f g a) gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Compose f g a) toConstr :: Compose f g a -> Constr dataTypeOf :: Compose f g a -> DataType dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Compose f g a)) dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Compose f g a)) gmapT :: (forall b. Data b => b -> b) -> Compose f g a -> Compose f g a gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Compose f g a -> r gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Compose f g a -> r gmapQ :: (forall d. Data d => d -> u) -> Compose f g a -> [u] gmapQi :: Int -> (forall d. Data d => d -> u) -> Compose f g a -> u gmapM :: Monad m => (forall d. Data d => d -> m d) -> Compose f g a -> m (Compose f g a) gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Compose f g a -> m (Compose f g a) gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Compose f g a -> m (Compose f g a) | |||||
Bounded (f (g a)) => Bounded (Compose f g a) | |||||
Enum (f (g a)) => Enum (Compose f g a) | |||||
Defined in Data.Functor.Compose Methods succ :: Compose f g a -> Compose f g a # pred :: Compose f g a -> Compose f g a # toEnum :: Int -> Compose f g a # fromEnum :: Compose f g a -> Int # enumFrom :: Compose f g a -> [Compose f g a] # enumFromThen :: Compose f g a -> Compose f g a -> [Compose f g a] # enumFromTo :: Compose f g a -> Compose f g a -> [Compose f g a] # enumFromThenTo :: Compose f g a -> Compose f g a -> Compose f g a -> [Compose f g a] # | |||||
Floating (f (g a)) => Floating (Compose f g a) | |||||
Defined in Data.Functor.Compose Methods exp :: Compose f g a -> Compose f g a # log :: Compose f g a -> Compose f g a # sqrt :: Compose f g a -> Compose f g a # (**) :: Compose f g a -> Compose f g a -> Compose f g a # logBase :: Compose f g a -> Compose f g a -> Compose f g a # sin :: Compose f g a -> Compose f g a # cos :: Compose f g a -> Compose f g a # tan :: Compose f g a -> Compose f g a # asin :: Compose f g a -> Compose f g a # acos :: Compose f g a -> Compose f g a # atan :: Compose f g a -> Compose f g a # sinh :: Compose f g a -> Compose f g a # cosh :: Compose f g a -> Compose f g a # tanh :: Compose f g a -> Compose f g a # asinh :: Compose f g a -> Compose f g a # acosh :: Compose f g a -> Compose f g a # atanh :: Compose f g a -> Compose f g a # log1p :: Compose f g a -> Compose f g a # expm1 :: Compose f g a -> Compose f g a # | |||||
RealFloat (f (g a)) => RealFloat (Compose f g a) | |||||
Defined in Data.Functor.Compose Methods floatRadix :: Compose f g a -> Integer # floatDigits :: Compose f g a -> Int # floatRange :: Compose f g a -> (Int, Int) # decodeFloat :: Compose f g a -> (Integer, Int) # encodeFloat :: Integer -> Int -> Compose f g a # exponent :: Compose f g a -> Int # significand :: Compose f g a -> Compose f g a # scaleFloat :: Int -> Compose f g a -> Compose f g a # isNaN :: Compose f g a -> Bool # isInfinite :: Compose f g a -> Bool # isDenormalized :: Compose f g a -> Bool # isNegativeZero :: Compose f g a -> Bool # | |||||
Generic (Compose f g a) | |||||
Defined in Data.Functor.Compose Associated Types
| |||||
Num (f (g a)) => Num (Compose f g a) | |||||
Defined in Data.Functor.Compose Methods (+) :: Compose f g a -> Compose f g a -> Compose f g a # (-) :: Compose f g a -> Compose f g a -> Compose f g a # (*) :: Compose f g a -> Compose f g a -> Compose f g a # negate :: Compose f g a -> Compose f g a # abs :: Compose f g a -> Compose f g a # signum :: Compose f g a -> Compose f g a # fromInteger :: Integer -> Compose f g a # | |||||
Read (f (g a)) => Read (Compose f g a) | |||||
Fractional (f (g a)) => Fractional (Compose f g a) | |||||
Integral (f (g a)) => Integral (Compose f g a) | |||||
Defined in Data.Functor.Compose Methods quot :: Compose f g a -> Compose f g a -> Compose f g a # rem :: Compose f g a -> Compose f g a -> Compose f g a # div :: Compose f g a -> Compose f g a -> Compose f g a # mod :: Compose f g a -> Compose f g a -> Compose f g a # quotRem :: Compose f g a -> Compose f g a -> (Compose f g a, Compose f g a) # divMod :: Compose f g a -> Compose f g a -> (Compose f g a, Compose f g a) # | |||||
Real (f (g a)) => Real (Compose f g a) | |||||
Defined in Data.Functor.Compose Methods toRational :: Compose f g a -> Rational # | |||||
RealFrac (f (g a)) => RealFrac (Compose f g a) | |||||
Show (f (g a)) => Show (Compose f g a) | |||||
Eq (f (g a)) => Eq (Compose f g a) | |||||
Ord (f (g a)) => Ord (Compose f g a) | |||||
Defined in Data.Functor.Compose Methods compare :: Compose f g a -> Compose f g a -> Ordering # (<) :: Compose f g a -> Compose f g a -> Bool # (<=) :: Compose f g a -> Compose f g a -> Bool # (>) :: Compose f g a -> Compose f g a -> Bool # (>=) :: Compose f g a -> Compose f g a -> Bool # | |||||
type Rep1 (Compose f g :: k -> Type) | |||||
Defined in Data.Functor.Compose | |||||
type Rep (Compose f g a) | |||||
Defined in Data.Functor.Compose |