Functor Async | |
Instance detailsDefined in Control.Concurrent.Async |
Functor Concurrently | |
Instance detailsDefined in Control.Concurrent.Async |
Functor ZipList | |
Instance detailsDefined in Control.Applicative |
Functor Handler | |
Instance detailsDefined in Control.Exception |
Functor Complex | |
Instance detailsDefined in Data.Complex |
Functor Identity | |
Instance detailsDefined in Data.Functor.Identity |
Functor First | |
Instance detailsDefined in Data.Monoid Methods fmap :: (a -> b) -> First a -> First b # (<$) :: a -> First b -> First a # |
Functor Last | |
Instance detailsDefined in Data.Monoid Methods fmap :: (a -> b) -> Last a -> Last b # (<$) :: a -> Last b -> Last a # |
Functor Down | |
Instance detailsDefined in Data.Ord |
Functor First | |
Instance detailsDefined in Data.Semigroup Methods fmap :: (a -> b) -> First a -> First b # (<$) :: a -> First b -> First a # |
Functor Last | |
Instance detailsDefined in Data.Semigroup Methods fmap :: (a -> b) -> Last a -> Last b # (<$) :: a -> Last b -> Last a # |
Functor Max | |
Instance detailsDefined in Data.Semigroup Methods fmap :: (a -> b) -> Max a -> Max b # (<$) :: a -> Max b -> Max a # |
Functor Min | |
Instance detailsDefined in Data.Semigroup Methods fmap :: (a -> b) -> Min a -> Min b # (<$) :: a -> Min b -> Min a # |
Functor Dual | |
Instance detailsDefined in Data.Semigroup.Internal Methods fmap :: (a -> b) -> Dual a -> Dual b # (<$) :: a -> Dual b -> Dual a # |
Functor Product | |
Instance detailsDefined in Data.Semigroup.Internal Methods fmap :: (a -> b) -> Product a -> Product b # (<$) :: a -> Product b -> Product a # |
Functor Sum | |
Instance detailsDefined in Data.Semigroup.Internal Methods fmap :: (a -> b) -> Sum a -> Sum b # (<$) :: a -> Sum b -> Sum a # |
Functor STM | |
Instance detailsDefined in GHC.Conc.Sync |
Functor Par1 | |
Instance detailsDefined in GHC.Generics Methods fmap :: (a -> b) -> Par1 a -> Par1 b # (<$) :: a -> Par1 b -> Par1 a # |
Functor P | |
Instance detailsDefined in Text.ParserCombinators.ReadP Methods fmap :: (a -> b) -> P a -> P b # (<$) :: a -> P b -> P a # |
Functor ReadP | |
Instance detailsDefined in Text.ParserCombinators.ReadP Methods fmap :: (a -> b) -> ReadP a -> ReadP b # (<$) :: a -> ReadP b -> ReadP a # |
Functor Put | |
Instance detailsDefined in Data.ByteString.Builder.Internal Methods fmap :: (a -> b) -> Put a -> Put b # (<$) :: a -> Put b -> Put a # |
Functor IntMap | |
Instance detailsDefined in Data.IntMap.Internal |
Functor Digit | |
Instance detailsDefined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Digit a -> Digit b # (<$) :: a -> Digit b -> Digit a # |
Functor Elem | |
Instance detailsDefined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Elem a -> Elem b # (<$) :: a -> Elem b -> Elem a # |
Functor FingerTree | |
Instance detailsDefined in Data.Sequence.Internal Methods fmap :: (a -> b) -> FingerTree a -> FingerTree b # (<$) :: a -> FingerTree b -> FingerTree a # |
Functor Node | |
Instance detailsDefined in Data.Sequence.Internal Methods fmap :: (a -> b) -> Node a -> Node b # (<$) :: a -> Node b -> Node a # |
Functor Seq | |
Instance detailsDefined in Data.Sequence.Internal |
Functor ViewL | |
Instance detailsDefined in Data.Sequence.Internal Methods fmap :: (a -> b) -> ViewL a -> ViewL b # (<$) :: a -> ViewL b -> ViewL a # |
Functor ViewR | |
Instance detailsDefined in Data.Sequence.Internal Methods fmap :: (a -> b) -> ViewR a -> ViewR b # (<$) :: a -> ViewR b -> ViewR a # |
Functor IO | |
Instance detailsDefined in GHC.Base |
Functor NonEmpty | |
Instance detailsDefined in GHC.Base |
Functor Maybe | |
Instance detailsDefined in GHC.Base |
Functor Solo | |
Instance detailsDefined in GHC.Base Methods fmap :: (a -> b) -> Solo a -> Solo b # (<$) :: a -> Solo b -> Solo a # |
Functor [] | |
Instance detailsDefined in GHC.Base Methods fmap :: (a -> b) -> [a] -> [b] # (<$) :: a -> [b] -> [a] # |
Monad m => Functor (WrappedMonad m) | |
Instance detailsDefined in Control.Applicative Methods fmap :: (a -> b) -> WrappedMonad m a -> WrappedMonad m b # (<$) :: a -> WrappedMonad m b -> WrappedMonad m a # |
Arrow a => Functor (ArrowMonad a) | |
Instance detailsDefined in Control.Arrow Methods fmap :: (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b # (<$) :: a0 -> ArrowMonad a b -> ArrowMonad a a0 # |
Functor (Either a) | |
Instance detailsDefined in Data.Either |
Functor (Proxy :: Type -> Type) | |
Instance detailsDefined in Data.Proxy |
Functor (Arg a) | |
Instance detailsDefined in Data.Semigroup Methods fmap :: (a0 -> b) -> Arg a a0 -> Arg a b # (<$) :: a0 -> Arg a b -> Arg a a0 # |
Functor (Array i) | |
Instance detailsDefined in GHC.Arr Methods fmap :: (a -> b) -> Array i a -> Array i b # (<$) :: a -> Array i b -> Array i a # |
Functor (U1 :: Type -> Type) | |
Instance detailsDefined in GHC.Generics |
Functor (V1 :: TYPE LiftedRep -> Type) | |
Instance detailsDefined in GHC.Generics |
Functor (ST s) | |
Instance detailsDefined in GHC.ST |
Functor (Map k) | |
Instance detailsDefined in Data.Map.Internal |
Functor m => Functor (ListT m) | |
Instance detailsDefined in Control.Monad.Trans.List Methods fmap :: (a -> b) -> ListT m a -> ListT m b # (<$) :: a -> ListT m b -> ListT m a # |
Functor m => Functor (MaybeT m) | |
Instance detailsDefined in Control.Monad.Trans.Maybe Methods fmap :: (a -> b) -> MaybeT m a -> MaybeT m b # (<$) :: a -> MaybeT m b -> MaybeT m a # |
Functor ((,) a) | |
Instance detailsDefined in GHC.Base Methods fmap :: (a0 -> b) -> (a, a0) -> (a, b) # (<$) :: a0 -> (a, b) -> (a, a0) # |
Arrow a => Functor (WrappedArrow a b) | |
Instance detailsDefined in Control.Applicative Methods fmap :: (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 # (<$) :: a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0 # |
Functor m => Functor (Kleisli m a) | |
Instance detailsDefined in Control.Arrow Methods fmap :: (a0 -> b) -> Kleisli m a a0 -> Kleisli m a b # (<$) :: a0 -> Kleisli m a b -> Kleisli m a a0 # |
Functor (Const m :: Type -> Type) | |
Instance detailsDefined in Data.Functor.Const |
Functor f => Functor (Ap f) | |
Instance detailsDefined in Data.Monoid Methods fmap :: (a -> b) -> Ap f a -> Ap f b # (<$) :: a -> Ap f b -> Ap f a # |
Functor f => Functor (Alt f) | |
Instance detailsDefined in Data.Semigroup.Internal Methods fmap :: (a -> b) -> Alt f a -> Alt f b # (<$) :: a -> Alt f b -> Alt f a # |
Functor f => Functor (Rec1 f) | |
Instance detailsDefined in GHC.Generics Methods fmap :: (a -> b) -> Rec1 f a -> Rec1 f b # (<$) :: a -> Rec1 f b -> Rec1 f a # |
Functor (URec (Ptr ()) :: TYPE LiftedRep -> Type) | |
Instance detailsDefined in GHC.Generics |
Functor (URec Char :: TYPE LiftedRep -> Type) | |
Instance detailsDefined in GHC.Generics |
Functor (URec Double :: TYPE LiftedRep -> Type) | |
Instance detailsDefined in GHC.Generics |
Functor (URec Float :: TYPE LiftedRep -> Type) | |
Instance detailsDefined in GHC.Generics |
Functor (URec Int :: TYPE LiftedRep -> Type) | |
Instance detailsDefined in GHC.Generics |
Functor (URec Word :: TYPE LiftedRep -> Type) | |
Instance detailsDefined in GHC.Generics |
(Applicative f, Monad f) => Functor (WhenMissing f x) | |
Instance detailsDefined in Data.IntMap.Internal Methods fmap :: (a -> b) -> WhenMissing f x a -> WhenMissing f x b # (<$) :: a -> WhenMissing f x b -> WhenMissing f x a # |
Functor m => Functor (ErrorT e m) | |
Instance detailsDefined in Control.Monad.Trans.Error Methods fmap :: (a -> b) -> ErrorT e m a -> ErrorT e m b # (<$) :: a -> ErrorT e m b -> ErrorT e m a # |
Functor m => Functor (ExceptT e m) | |
Instance detailsDefined in Control.Monad.Trans.Except |
Functor m => Functor (IdentityT m) | |
Instance detailsDefined in Control.Monad.Trans.Identity Methods fmap :: (a -> b) -> IdentityT m a -> IdentityT m b # (<$) :: a -> IdentityT m b -> IdentityT m a # |
Functor m => Functor (ReaderT r m) | |
Instance detailsDefined in Control.Monad.Trans.Reader |
Functor m => Functor (StateT s m) | |
Instance detailsDefined in Control.Monad.Trans.State.Lazy |
Functor m => Functor (StateT s m) | |
Instance detailsDefined in Control.Monad.Trans.State.Strict Methods fmap :: (a -> b) -> StateT s m a -> StateT s m b # (<$) :: a -> StateT s m b -> StateT s m a # |
Functor m => Functor (WriterT w m) | |
Instance detailsDefined in Control.Monad.Trans.Writer.Lazy Methods fmap :: (a -> b) -> WriterT w m a -> WriterT w m b # (<$) :: a -> WriterT w m b -> WriterT w m a # |
Functor m => Functor (WriterT w m) | |
Instance detailsDefined in Control.Monad.Trans.Writer.Strict Methods fmap :: (a -> b) -> WriterT w m a -> WriterT w m b # (<$) :: a -> WriterT w m b -> WriterT w m a # |
Functor ((,,) a b) | |
Instance detailsDefined in GHC.Base Methods fmap :: (a0 -> b0) -> (a, b, a0) -> (a, b, b0) # (<$) :: a0 -> (a, b, b0) -> (a, b, a0) # |
(Functor f, Functor g) => Functor (Product f g) | |
Instance detailsDefined in Data.Functor.Product Methods fmap :: (a -> b) -> Product f g a -> Product f g b # (<$) :: a -> Product f g b -> Product f g a # |
(Functor f, Functor g) => Functor (Sum f g) | |
Instance detailsDefined in Data.Functor.Sum Methods fmap :: (a -> b) -> Sum f g a -> Sum f g b # (<$) :: a -> Sum f g b -> Sum f g a # |
(Functor f, Functor g) => Functor (f :*: g) | |
Instance detailsDefined in GHC.Generics |
(Functor f, Functor g) => Functor (f :+: g) | |
Instance detailsDefined in GHC.Generics |
Functor (K1 i c :: TYPE LiftedRep -> Type) | |
Instance detailsDefined in GHC.Generics |
Functor f => Functor (WhenMatched f x y) | |
Instance detailsDefined in Data.IntMap.Internal Methods fmap :: (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b # (<$) :: a -> WhenMatched f x y b -> WhenMatched f x y a # |
(Applicative f, Monad f) => Functor (WhenMissing f k x) | |
Instance detailsDefined in Data.Map.Internal Methods fmap :: (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b # (<$) :: a -> WhenMissing f k x b -> WhenMissing f k x a # |
Functor ((,,,) a b c) | |
Instance detailsDefined in GHC.Base Methods fmap :: (a0 -> b0) -> (a, b, c, a0) -> (a, b, c, b0) # (<$) :: a0 -> (a, b, c, b0) -> (a, b, c, a0) # |
Functor ((->) r) | |
Instance detailsDefined in GHC.Base Methods fmap :: (a -> b) -> (r -> a) -> r -> b # (<$) :: a -> (r -> b) -> r -> a # |
(Functor f, Functor g) => Functor (Compose f g) | |
Instance detailsDefined in Data.Functor.Compose Methods fmap :: (a -> b) -> Compose f g a -> Compose f g b # (<$) :: a -> Compose f g b -> Compose f g a # |
(Functor f, Functor g) => Functor (f :.: g) | |
Instance detailsDefined in GHC.Generics |
Functor f => Functor (M1 i c f) | |
Instance detailsDefined in GHC.Generics Methods fmap :: (a -> b) -> M1 i c f a -> M1 i c f b # (<$) :: a -> M1 i c f b -> M1 i c f a # |
Functor f => Functor (WhenMatched f k x y) | |
Instance detailsDefined in Data.Map.Internal Methods fmap :: (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b # (<$) :: a -> WhenMatched f k x y b -> WhenMatched f k x y a # |
Functor m => Functor (RWST r w s m) | |
Instance detailsDefined in Control.Monad.Trans.RWS.Lazy Methods fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b # (<$) :: a -> RWST r w s m b -> RWST r w s m a # |
Functor m => Functor (RWST r w s m) | |
Instance detailsDefined in Control.Monad.Trans.RWS.Strict Methods fmap :: (a -> b) -> RWST r w s m a -> RWST r w s m b # (<$) :: a -> RWST r w s m b -> RWST r w s m a # |