| Copyright | (C) 2026 - Eitan Chatav |
|---|---|
| License | BSD-style (see the file LICENSE) |
| Maintainer | Eitan Chatav <eitan.chatav@gmail.com> |
| Stability | provisional |
| Portability | non-portable |
| Safe Haskell | None |
| Language | Haskell2010 |
Control.Lens.Grammar.Internal.Orphanage
Contents
Description
An orphanage for instances without a home.
Orphan instances
| Filterable ReadP Source # | |
| Arrow p => Profunctor (WrappedArrow p) Source # | |
Methods dimap :: (a -> b) -> (c -> d) -> WrappedArrow p b c -> WrappedArrow p a d # lmap :: (a -> b) -> WrappedArrow p b c -> WrappedArrow p a c # rmap :: (b -> c) -> WrappedArrow p a b -> WrappedArrow p a c # (#.) :: forall a b c q. Coercible c b => q b c -> WrappedArrow p a b -> WrappedArrow p a c # (.#) :: forall a b c q. Coercible b a => WrappedArrow p b c -> q a b -> WrappedArrow p a c # | |
| (Profunctor p, Alternative (p a)) => Alternative (Coyoneda p a) Source # | |
| (Profunctor p, Alternative (p a)) => Alternative (Yoneda p a) Source # | |
| (Profunctor p, Applicative (p a)) => Applicative (Coyoneda p a) Source # | |
Methods pure :: a0 -> Coyoneda p a a0 # (<*>) :: Coyoneda p a (a0 -> b) -> Coyoneda p a a0 -> Coyoneda p a b # liftA2 :: (a0 -> b -> c) -> Coyoneda p a a0 -> Coyoneda p a b -> Coyoneda p a c # (*>) :: Coyoneda p a a0 -> Coyoneda p a b -> Coyoneda p a b # (<*) :: Coyoneda p a a0 -> Coyoneda p a b -> Coyoneda p a a0 # | |
| (Profunctor p, Applicative (p a)) => Applicative (Yoneda p a) Source # | |
| (Profunctor p, Filterable f) => Cochoice (WrappedPafb f p) Source # | |
Methods unleft :: WrappedPafb f p (Either a d) (Either b d) -> WrappedPafb f p a b # unright :: WrappedPafb f p (Either d a) (Either d b) -> WrappedPafb f p a b # | |
| (Closed p, Distributive f) => Closed (WrappedPafb f p) Source # | |
Methods closed :: WrappedPafb f p a b -> WrappedPafb f p (x -> a) (x -> b) # | |
| (Profunctor p, Filterable (p a)) => Filterable (Coyoneda p a) Source # | |
| (Profunctor p, Filterable (p a)) => Filterable (Yoneda p a) Source # | |
| (Profunctor p, Alternative (p a), Applicative f) => Alternative (WrappedPafb f p a) Source # | |
Methods empty :: WrappedPafb f p a a0 # (<|>) :: WrappedPafb f p a a0 -> WrappedPafb f p a a0 -> WrappedPafb f p a a0 # some :: WrappedPafb f p a a0 -> WrappedPafb f p a [a0] # many :: WrappedPafb f p a a0 -> WrappedPafb f p a [a0] # | |
| Applicative (Market a b s) Source # | |
Methods pure :: a0 -> Market a b s a0 # (<*>) :: Market a b s (a0 -> b0) -> Market a b s a0 -> Market a b s b0 # liftA2 :: (a0 -> b0 -> c) -> Market a b s a0 -> Market a b s b0 -> Market a b s c # (*>) :: Market a b s a0 -> Market a b s b0 -> Market a b s b0 # (<*) :: Market a b s a0 -> Market a b s b0 -> Market a b s a0 # | |
| (Profunctor p, Applicative (p a), Applicative f) => Applicative (WrappedPafb f p a) Source # | |
Methods pure :: a0 -> WrappedPafb f p a a0 # (<*>) :: WrappedPafb f p a (a0 -> b) -> WrappedPafb f p a a0 -> WrappedPafb f p a b # liftA2 :: (a0 -> b -> c) -> WrappedPafb f p a a0 -> WrappedPafb f p a b -> WrappedPafb f p a c # (*>) :: WrappedPafb f p a a0 -> WrappedPafb f p a b -> WrappedPafb f p a b # (<*) :: WrappedPafb f p a a0 -> WrappedPafb f p a b -> WrappedPafb f p a a0 # | |
| Monoid r => Applicative (Forget r a :: Type -> Type) Source # | |
| (Profunctor p, Functor f) => Functor (WrappedPafb f p a) Source # | |
Methods fmap :: (a0 -> b) -> WrappedPafb f p a a0 -> WrappedPafb f p a b # (<$) :: a0 -> WrappedPafb f p a b -> WrappedPafb f p a a0 # | |
| Filterable f => Cochoice (Joker f :: Type -> Type -> Type) Source # | |
| (Profunctor p, Functor (p a), Filterable f) => Filterable (WrappedPafb f p a) Source # | |
Methods mapMaybe :: (a0 -> Maybe b) -> WrappedPafb f p a a0 -> WrappedPafb f p a b # catMaybes :: WrappedPafb f p a (Maybe a0) -> WrappedPafb f p a a0 # filter :: (a0 -> Bool) -> WrappedPafb f p a a0 -> WrappedPafb f p a a0 # drain :: WrappedPafb f p a a0 -> WrappedPafb f p a b # | |
| Filterable (Forget r a :: Type -> Type) Source # | |
| Filterable f => Filterable (Star f a) Source # | |
| MonadFail m => MonadFail (Joker m a) Source # | |
| Alternative f => Alternative (Joker f a) Source # | |
| Decidable f => Applicative (Clown f a :: Type -> Type) Source # | |
| Applicative f => Applicative (Joker f a) Source # | |
| Arrow p => Applicative (WrappedArrow p a) Source # | |
Methods pure :: a0 -> WrappedArrow p a a0 # (<*>) :: WrappedArrow p a (a0 -> b) -> WrappedArrow p a a0 -> WrappedArrow p a b # liftA2 :: (a0 -> b -> c) -> WrappedArrow p a a0 -> WrappedArrow p a b -> WrappedArrow p a c # (*>) :: WrappedArrow p a a0 -> WrappedArrow p a b -> WrappedArrow p a b # (<*) :: WrappedArrow p a a0 -> WrappedArrow p a b -> WrappedArrow p a a0 # | |
| Arrow p => Functor (WrappedArrow p a) Source # | |
Methods fmap :: (a0 -> b) -> WrappedArrow p a a0 -> WrappedArrow p a b # (<$) :: a0 -> WrappedArrow p a b -> WrappedArrow p a a0 # | |
| Monad m => Monad (Joker m a) Source # | |
| MonadPlus m => MonadPlus (Joker m a) Source # | |
| Filterable f => Filterable (Joker f a) Source # | |
| (forall x. Applicative (p x), forall x. Applicative (q x)) => Applicative (Product p q a) Source # | |
Methods pure :: a0 -> Product p q a a0 # (<*>) :: Product p q a (a0 -> b) -> Product p q a a0 -> Product p q a b # liftA2 :: (a0 -> b -> c) -> Product p q a a0 -> Product p q a b -> Product p q a c # (*>) :: Product p q a a0 -> Product p q a b -> Product p q a b # (<*) :: Product p q a a0 -> Product p q a b -> Product p q a a0 # | |
| (Applicative f, Applicative (p a)) => Applicative (Cayley f p a) Source # | |
Methods pure :: a0 -> Cayley f p a a0 # (<*>) :: Cayley f p a (a0 -> b) -> Cayley f p a a0 -> Cayley f p a b # liftA2 :: (a0 -> b -> c) -> Cayley f p a a0 -> Cayley f p a b -> Cayley f p a c # (*>) :: Cayley f p a a0 -> Cayley f p a b -> Cayley f p a b # (<*) :: Cayley f p a a0 -> Cayley f p a b -> Cayley f p a a0 # | |
| (forall x. Applicative (p x), Profunctor p, Applicative (q a), Profunctor q) => Applicative (Procompose p q a) Source # | |
Methods pure :: a0 -> Procompose p q a a0 # (<*>) :: Procompose p q a (a0 -> b) -> Procompose p q a a0 -> Procompose p q a b # liftA2 :: (a0 -> b -> c) -> Procompose p q a a0 -> Procompose p q a b -> Procompose p q a c # (*>) :: Procompose p q a a0 -> Procompose p q a b -> Procompose p q a b # (<*) :: Procompose p q a a0 -> Procompose p q a b -> Procompose p q a a0 # | |
| (Functor f, Functor (p a)) => Functor (Cayley f p a) Source # | |