Safe Haskell	Safe
Language	Haskell98

Lens.Family.Clone

Contents

Types
Re-exports

Description

This module is provided for Haskell 98 compatibility. If you are able to use Rank2Types, I advise you to instead use the rank 2 aliases

Lens, Lens'
Traversal, Traversal'
Setter, Setter'
Fold, Fold'
Getter, Getter'

from the lens-family package instead.

cloneLens allows one to circumvent the need for rank 2 types by allowing one to take a universal monomorphic lens instance and rederive a polymorphic instance. When you require a lens family parameter you use the type ALens a a' b b' (or ALens' a b). Then, inside a where clause, you use cloneLens to create a Lens type.

For example.

example :: ALens a a' b b' -> Example
example l = ... x^.cl ... cl .~ y ...
 where
  cl x = cloneLens l x

Note: It is important to eta-expand the definition of cl to avoid the dreaded monomorphism restriction.

cloneTraversal, cloneGetter, cloneSetter, and cloneFold provides similar functionality for traversals, getters, setters, and folds respectively.

Note: Cloning is only need if you use a functional reference multiple times with different instances.

Synopsis

cloneLens :: Functor f => ALens a a' b b' -> LensLike f a a' b b'
cloneTraversal :: Applicative f => ATraversal a a' b b' -> LensLike f a a' b b'
cloneSetter :: Identical f => ASetter a a' b b' -> LensLike f a a' b b'
cloneGetter :: Phantom f => AGetter a a' b b' -> LensLike f a a' b b'
cloneFold :: (Phantom f, Applicative f) => AFold a a' b b' -> LensLike f a a' b b'
type ALens a a' b b' = LensLike (IStore b b') a a' b b'
type ALens' a b = LensLike' (IStore b b) a b
type ATraversal a a' b b' = LensLike (IKleeneStore b b') a a' b b'
type ATraversal' a b = LensLike' (IKleeneStore b b) a b
type AGetter a a' b b' = FoldLike b a a' b b'
type AGetter' a b = FoldLike' b a b
type AFold a a' b b' = FoldLike [b] a a' b b'
type AFold' a b = FoldLike' [b] a b
data IStore b b' a
data IKleeneStore b b' a
type LensLike f a a' b b' = (b -> f b') -> a -> f a'
type LensLike' f a b = (b -> f b) -> a -> f a
type FoldLike r a a' b b' = LensLike (Constant r) a a' b b'
type FoldLike' r a b = LensLike' (Constant r) a b
type ASetter a a' b b' = LensLike Identity a a' b b'
class Functor f => Applicative (f :: Type -> Type)
class Functor f => Phantom f
class Applicative f => Identical f

Documentation

cloneLens :: Functor f => ALens a a' b b' -> LensLike f a a' b b' Source #

Converts a universal lens instance back into a polymorphic lens.

cloneTraversal :: Applicative f => ATraversal a a' b b' -> LensLike f a a' b b' Source #

Converts a universal traversal instance back into a polymorphic traversal.

cloneSetter :: Identical f => ASetter a a' b b' -> LensLike f a a' b b' Source #

Converts a universal setter instance back into a polymorphic setter.

cloneGetter :: Phantom f => AGetter a a' b b' -> LensLike f a a' b b' Source #

Converts a universal getter instance back into a polymorphic getter.

cloneFold :: (Phantom f, Applicative f) => AFold a a' b b' -> LensLike f a a' b b' Source #

Converts a universal fold instance back into a polymorphic fold.

Types

type ALens a a' b b' = LensLike (IStore b b') a a' b b' Source #

ALens a a' b b' is a universal Lens a a' b b' instance

type ALens' a b = LensLike' (IStore b b) a b Source #

ALens' a b is a universal Lens' a b instance

type ATraversal a a' b b' = LensLike (IKleeneStore b b') a a' b b' Source #

ATraversal a a' b b' is a universal Traversal a a' b b' instance

type ATraversal' a b = LensLike' (IKleeneStore b b) a b Source #

ATraversal' a b is a universal Traversal' a b instance

type AGetter a a' b b' = FoldLike b a a' b b' Source #

AGetter a a' b b' is a universal Fold a a' b b' instance

type AGetter' a b = FoldLike' b a b Source #

AGetter' a b is a universal Fold' a b instance

type AFold a a' b b' = FoldLike [b] a a' b b' Source #

AFold a a' b b' is a universal Fold' a a' b b' instance

type AFold' a b = FoldLike' [b] a b Source #

AFold' a b is a universal Fold' a b instance

data IStore b b' a Source #

Instances

Functor (IStore b b') Source #
Instance details Defined in Lens.Family.Clone Methods fmap :: (a -> b0) -> IStore b b' a -> IStore b b' b0 (<$) :: a -> IStore b b' b0 -> IStore b b' a

data IKleeneStore b b' a Source #

Instances

Functor (IKleeneStore b b') Source #
Instance details Defined in Lens.Family.Clone Methods fmap :: (a -> b0) -> IKleeneStore b b' a -> IKleeneStore b b' b0 (<$) :: a -> IKleeneStore b b' b0 -> IKleeneStore b b' a
Applicative (IKleeneStore b b') Source #
Instance details Defined in Lens.Family.Clone Methods pure :: a -> IKleeneStore b b' a (<>) :: IKleeneStore b b' (a -> b0) -> IKleeneStore b b' a -> IKleeneStore b b' b0 liftA2 :: (a -> b0 -> c) -> IKleeneStore b b' a -> IKleeneStore b b' b0 -> IKleeneStore b b' c (>) :: IKleeneStore b b' a -> IKleeneStore b b' b0 -> IKleeneStore b b' b0 (<*) :: IKleeneStore b b' a -> IKleeneStore b b' b0 -> IKleeneStore b b' a

Re-exports

type LensLike f a a' b b' = (b -> f b') -> a -> f a' Source #

type LensLike' f a b = (b -> f b) -> a -> f a Source #

type FoldLike r a a' b b' = LensLike (Constant r) a a' b b' Source #

type FoldLike' r a b = LensLike' (Constant r) a b Source #

type ASetter a a' b b' = LensLike Identity a a' b b' Source #

class Functor f => Applicative (f :: Type -> Type) #

Minimal complete definition

pure, ((<*>) | liftA2)

Instances

Applicative []
Instance details Defined in GHC.Base Methods pure :: a -> [a] (<>) :: [a -> b] -> [a] -> [b] liftA2 :: (a -> b -> c) -> [a] -> [b] -> [c] (>) :: [a] -> [b] -> [b] (<*) :: [a] -> [b] -> [a]
Applicative Maybe
Instance details Defined in GHC.Base Methods pure :: a -> Maybe a (<>) :: Maybe (a -> b) -> Maybe a -> Maybe b liftA2 :: (a -> b -> c) -> Maybe a -> Maybe b -> Maybe c (>) :: Maybe a -> Maybe b -> Maybe b (<*) :: Maybe a -> Maybe b -> Maybe a
Applicative IO
Instance details Defined in GHC.Base Methods pure :: a -> IO a (<>) :: IO (a -> b) -> IO a -> IO b liftA2 :: (a -> b -> c) -> IO a -> IO b -> IO c (>) :: IO a -> IO b -> IO b (<*) :: IO a -> IO b -> IO a
Applicative Par1
Instance details Defined in GHC.Generics Methods pure :: a -> Par1 a (<>) :: Par1 (a -> b) -> Par1 a -> Par1 b liftA2 :: (a -> b -> c) -> Par1 a -> Par1 b -> Par1 c (>) :: Par1 a -> Par1 b -> Par1 b (<*) :: Par1 a -> Par1 b -> Par1 a
Applicative Product
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Product a (<>) :: Product (a -> b) -> Product a -> Product b liftA2 :: (a -> b -> c) -> Product a -> Product b -> Product c (>) :: Product a -> Product b -> Product b (<*) :: Product a -> Product b -> Product a
Applicative Sum
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Sum a (<>) :: Sum (a -> b) -> Sum a -> Sum b liftA2 :: (a -> b -> c) -> Sum a -> Sum b -> Sum c (>) :: Sum a -> Sum b -> Sum b (<*) :: Sum a -> Sum b -> Sum a
Applicative P
Instance details Defined in Text.ParserCombinators.ReadP Methods pure :: a -> P a (<>) :: P (a -> b) -> P a -> P b liftA2 :: (a -> b -> c) -> P a -> P b -> P c (>) :: P a -> P b -> P b (<*) :: P a -> P b -> P a
Applicative Identity
Instance details Defined in Data.Functor.Identity Methods pure :: a -> Identity a (<>) :: Identity (a -> b) -> Identity a -> Identity b liftA2 :: (a -> b -> c) -> Identity a -> Identity b -> Identity c (>) :: Identity a -> Identity b -> Identity b (<*) :: Identity a -> Identity b -> Identity a
Applicative NonEmpty
Instance details Defined in GHC.Base Methods pure :: a -> NonEmpty a (<>) :: NonEmpty (a -> b) -> NonEmpty a -> NonEmpty b liftA2 :: (a -> b -> c) -> NonEmpty a -> NonEmpty b -> NonEmpty c (>) :: NonEmpty a -> NonEmpty b -> NonEmpty b (<*) :: NonEmpty a -> NonEmpty b -> NonEmpty a
Applicative Dual
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Dual a (<>) :: Dual (a -> b) -> Dual a -> Dual b liftA2 :: (a -> b -> c) -> Dual a -> Dual b -> Dual c (>) :: Dual a -> Dual b -> Dual b (<*) :: Dual a -> Dual b -> Dual a
Applicative ZipList
Instance details Defined in Control.Applicative Methods pure :: a -> ZipList a (<>) :: ZipList (a -> b) -> ZipList a -> ZipList b liftA2 :: (a -> b -> c) -> ZipList a -> ZipList b -> ZipList c (>) :: ZipList a -> ZipList b -> ZipList b (<*) :: ZipList a -> ZipList b -> ZipList a
Applicative ReadP
Instance details Defined in Text.ParserCombinators.ReadP Methods pure :: a -> ReadP a (<>) :: ReadP (a -> b) -> ReadP a -> ReadP b liftA2 :: (a -> b -> c) -> ReadP a -> ReadP b -> ReadP c (>) :: ReadP a -> ReadP b -> ReadP b (<*) :: ReadP a -> ReadP b -> ReadP a
Applicative First
Instance details Defined in Data.Monoid Methods pure :: a -> First a (<>) :: First (a -> b) -> First a -> First b liftA2 :: (a -> b -> c) -> First a -> First b -> First c (>) :: First a -> First b -> First b (<*) :: First a -> First b -> First a
Applicative Last
Instance details Defined in Data.Monoid Methods pure :: a -> Last a (<>) :: Last (a -> b) -> Last a -> Last b liftA2 :: (a -> b -> c) -> Last a -> Last b -> Last c (>) :: Last a -> Last b -> Last b (<*) :: Last a -> Last b -> Last a
Applicative Down
Instance details Defined in Data.Ord Methods pure :: a -> Down a (<>) :: Down (a -> b) -> Down a -> Down b liftA2 :: (a -> b -> c) -> Down a -> Down b -> Down c (>) :: Down a -> Down b -> Down b (<*) :: Down a -> Down b -> Down a
Applicative (Either e)
Instance details Defined in Data.Either Methods pure :: a -> Either e a (<>) :: Either e (a -> b) -> Either e a -> Either e b liftA2 :: (a -> b -> c) -> Either e a -> Either e b -> Either e c (>) :: Either e a -> Either e b -> Either e b (<*) :: Either e a -> Either e b -> Either e a
Applicative (U1 :: Type -> Type)
Instance details Defined in GHC.Generics Methods pure :: a -> U1 a (<>) :: U1 (a -> b) -> U1 a -> U1 b liftA2 :: (a -> b -> c) -> U1 a -> U1 b -> U1 c (>) :: U1 a -> U1 b -> U1 b (<*) :: U1 a -> U1 b -> U1 a
Monoid a => Applicative ((,) a)
Instance details Defined in GHC.Base Methods pure :: a0 -> (a, a0) (<>) :: (a, a0 -> b) -> (a, a0) -> (a, b) liftA2 :: (a0 -> b -> c) -> (a, a0) -> (a, b) -> (a, c) (>) :: (a, a0) -> (a, b) -> (a, b) (<*) :: (a, a0) -> (a, b) -> (a, a0)
Monad m => Applicative (WrappedMonad m)
Instance details Defined in Control.Applicative Methods pure :: a -> WrappedMonad m a (<>) :: WrappedMonad m (a -> b) -> WrappedMonad m a -> WrappedMonad m b liftA2 :: (a -> b -> c) -> WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m c (>) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m b (<*) :: WrappedMonad m a -> WrappedMonad m b -> WrappedMonad m a
Arrow a => Applicative (ArrowMonad a)
Instance details Defined in Control.Arrow Methods pure :: a0 -> ArrowMonad a a0 (<>) :: ArrowMonad a (a0 -> b) -> ArrowMonad a a0 -> ArrowMonad a b liftA2 :: (a0 -> b -> c) -> ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a c (>) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a b (<*) :: ArrowMonad a a0 -> ArrowMonad a b -> ArrowMonad a a0
Applicative (Proxy :: Type -> Type)
Instance details Defined in Data.Proxy Methods pure :: a -> Proxy a (<>) :: Proxy (a -> b) -> Proxy a -> Proxy b liftA2 :: (a -> b -> c) -> Proxy a -> Proxy b -> Proxy c (>) :: Proxy a -> Proxy b -> Proxy b (<*) :: Proxy a -> Proxy b -> Proxy a
Applicative f => Applicative (Rec1 f)
Instance details Defined in GHC.Generics Methods pure :: a -> Rec1 f a (<>) :: Rec1 f (a -> b) -> Rec1 f a -> Rec1 f b liftA2 :: (a -> b -> c) -> Rec1 f a -> Rec1 f b -> Rec1 f c (>) :: Rec1 f a -> Rec1 f b -> Rec1 f b (<*) :: Rec1 f a -> Rec1 f b -> Rec1 f a
Applicative f => Applicative (Backwards f)
Instance details Defined in Control.Applicative.Backwards Methods pure :: a -> Backwards f a (<>) :: Backwards f (a -> b) -> Backwards f a -> Backwards f b liftA2 :: (a -> b -> c) -> Backwards f a -> Backwards f b -> Backwards f c (>) :: Backwards f a -> Backwards f b -> Backwards f b (<*) :: Backwards f a -> Backwards f b -> Backwards f a
Arrow a => Applicative (WrappedArrow a b)
Instance details Defined in Control.Applicative Methods pure :: a0 -> WrappedArrow a b a0 (<>) :: WrappedArrow a b (a0 -> b0) -> WrappedArrow a b a0 -> WrappedArrow a b b0 liftA2 :: (a0 -> b0 -> c) -> WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b c (>) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b b0 (<*) :: WrappedArrow a b a0 -> WrappedArrow a b b0 -> WrappedArrow a b a0
Monoid m => Applicative (Const m :: Type -> Type)
Instance details Defined in Data.Functor.Const Methods pure :: a -> Const m a (<>) :: Const m (a -> b) -> Const m a -> Const m b liftA2 :: (a -> b -> c) -> Const m a -> Const m b -> Const m c (>) :: Const m a -> Const m b -> Const m b (<*) :: Const m a -> Const m b -> Const m a
Monoid a => Applicative (Constant a :: Type -> Type)
Instance details Defined in Data.Functor.Constant Methods pure :: a0 -> Constant a a0 (<>) :: Constant a (a0 -> b) -> Constant a a0 -> Constant a b liftA2 :: (a0 -> b -> c) -> Constant a a0 -> Constant a b -> Constant a c (>) :: Constant a a0 -> Constant a b -> Constant a b (<*) :: Constant a a0 -> Constant a b -> Constant a a0
Applicative f => Applicative (Ap f)
Instance details Defined in Data.Monoid Methods pure :: a -> Ap f a (<>) :: Ap f (a -> b) -> Ap f a -> Ap f b liftA2 :: (a -> b -> c) -> Ap f a -> Ap f b -> Ap f c (>) :: Ap f a -> Ap f b -> Ap f b (<*) :: Ap f a -> Ap f b -> Ap f a
Applicative f => Applicative (Alt f)
Instance details Defined in Data.Semigroup.Internal Methods pure :: a -> Alt f a (<>) :: Alt f (a -> b) -> Alt f a -> Alt f b liftA2 :: (a -> b -> c) -> Alt f a -> Alt f b -> Alt f c (>) :: Alt f a -> Alt f b -> Alt f b (<*) :: Alt f a -> Alt f b -> Alt f a
(Monoid c, Monad m) => Applicative (Zooming m c) Source #
Instance details Defined in Lens.Family.State.Zoom Methods pure :: a -> Zooming m c a (<>) :: Zooming m c (a -> b) -> Zooming m c a -> Zooming m c b liftA2 :: (a -> b -> c0) -> Zooming m c a -> Zooming m c b -> Zooming m c c0 (>) :: Zooming m c a -> Zooming m c b -> Zooming m c b (<*) :: Zooming m c a -> Zooming m c b -> Zooming m c a
(Applicative f, Monad f) => Applicative (WhenMissing f x)
Instance details Defined in Data.IntMap.Internal Methods pure :: a -> WhenMissing f x a (<>) :: WhenMissing f x (a -> b) -> WhenMissing f x a -> WhenMissing f x b liftA2 :: (a -> b -> c) -> WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x c (>) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x b (<*) :: WhenMissing f x a -> WhenMissing f x b -> WhenMissing f x a
(Monoid w, Applicative m) => Applicative (WriterT w m)
Instance details Defined in Control.Monad.Trans.Writer.Lazy Methods pure :: a -> WriterT w m a (<>) :: WriterT w m (a -> b) -> WriterT w m a -> WriterT w m b liftA2 :: (a -> b -> c) -> WriterT w m a -> WriterT w m b -> WriterT w m c (>) :: WriterT w m a -> WriterT w m b -> WriterT w m b (<*) :: WriterT w m a -> WriterT w m b -> WriterT w m a
(Functor m, Monad m) => Applicative (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Strict Methods pure :: a -> StateT s m a (<>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c (>) :: StateT s m a -> StateT s m b -> StateT s m b (<*) :: StateT s m a -> StateT s m b -> StateT s m a
(Functor m, Monad m) => Applicative (StateT s m)
Instance details Defined in Control.Monad.Trans.State.Lazy Methods pure :: a -> StateT s m a (<>) :: StateT s m (a -> b) -> StateT s m a -> StateT s m b liftA2 :: (a -> b -> c) -> StateT s m a -> StateT s m b -> StateT s m c (>) :: StateT s m a -> StateT s m b -> StateT s m b (<*) :: StateT s m a -> StateT s m b -> StateT s m a
Applicative (IKleeneStore b b') Source #
Instance details Defined in Lens.Family.Clone Methods pure :: a -> IKleeneStore b b' a (<>) :: IKleeneStore b b' (a -> b0) -> IKleeneStore b b' a -> IKleeneStore b b' b0 liftA2 :: (a -> b0 -> c) -> IKleeneStore b b' a -> IKleeneStore b b' b0 -> IKleeneStore b b' c (>) :: IKleeneStore b b' a -> IKleeneStore b b' b0 -> IKleeneStore b b' b0 (<*) :: IKleeneStore b b' a -> IKleeneStore b b' b0 -> IKleeneStore b b' a
Applicative ((->) a :: Type -> Type)
Instance details Defined in GHC.Base Methods pure :: a0 -> a -> a0 (<>) :: (a -> (a0 -> b)) -> (a -> a0) -> a -> b liftA2 :: (a0 -> b -> c) -> (a -> a0) -> (a -> b) -> a -> c (>) :: (a -> a0) -> (a -> b) -> a -> b (<*) :: (a -> a0) -> (a -> b) -> a -> a0
Monoid c => Applicative (K1 i c :: Type -> Type)
Instance details Defined in GHC.Generics Methods pure :: a -> K1 i c a (<>) :: K1 i c (a -> b) -> K1 i c a -> K1 i c b liftA2 :: (a -> b -> c0) -> K1 i c a -> K1 i c b -> K1 i c c0 (>) :: K1 i c a -> K1 i c b -> K1 i c b (<*) :: K1 i c a -> K1 i c b -> K1 i c a
(Applicative f, Applicative g) => Applicative (f :*: g)
Instance details Defined in GHC.Generics Methods pure :: a -> (f :: g) a (<>) :: (f :: g) (a -> b) -> (f :: g) a -> (f :: g) b liftA2 :: (a -> b -> c) -> (f :: g) a -> (f :: g) b -> (f :: g) c (>) :: (f :: g) a -> (f :: g) b -> (f :: g) b (<) :: (f :: g) a -> (f :: g) b -> (f :: g) a
(Applicative f, Monad f) => Applicative (WhenMissing f k x)
Instance details Defined in Data.Map.Internal Methods pure :: a -> WhenMissing f k x a (<>) :: WhenMissing f k x (a -> b) -> WhenMissing f k x a -> WhenMissing f k x b liftA2 :: (a -> b -> c) -> WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x c (>) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x b (<*) :: WhenMissing f k x a -> WhenMissing f k x b -> WhenMissing f k x a
(Monad f, Applicative f) => Applicative (WhenMatched f x y)
Instance details Defined in Data.IntMap.Internal Methods pure :: a -> WhenMatched f x y a (<>) :: WhenMatched f x y (a -> b) -> WhenMatched f x y a -> WhenMatched f x y b liftA2 :: (a -> b -> c) -> WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y c (>) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y b (<*) :: WhenMatched f x y a -> WhenMatched f x y b -> WhenMatched f x y a
Applicative f => Applicative (M1 i c f)
Instance details Defined in GHC.Generics Methods pure :: a -> M1 i c f a (<>) :: M1 i c f (a -> b) -> M1 i c f a -> M1 i c f b liftA2 :: (a -> b -> c0) -> M1 i c f a -> M1 i c f b -> M1 i c f c0 (>) :: M1 i c f a -> M1 i c f b -> M1 i c f b (<*) :: M1 i c f a -> M1 i c f b -> M1 i c f a
(Applicative f, Applicative g) => Applicative (f :.: g)
Instance details Defined in GHC.Generics Methods pure :: a -> (f :.: g) a (<>) :: (f :.: g) (a -> b) -> (f :.: g) a -> (f :.: g) b liftA2 :: (a -> b -> c) -> (f :.: g) a -> (f :.: g) b -> (f :.: g) c (>) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) b (<*) :: (f :.: g) a -> (f :.: g) b -> (f :.: g) a
(Applicative f, Applicative g) => Applicative (Compose f g)
Instance details Defined in Data.Functor.Compose Methods pure :: a -> Compose f g a (<>) :: Compose f g (a -> b) -> Compose f g a -> Compose f g b liftA2 :: (a -> b -> c) -> Compose f g a -> Compose f g b -> Compose f g c (>) :: Compose f g a -> Compose f g b -> Compose f g b (<*) :: Compose f g a -> Compose f g b -> Compose f g a
(Monad f, Applicative f) => Applicative (WhenMatched f k x y)
Instance details Defined in Data.Map.Internal Methods pure :: a -> WhenMatched f k x y a (<>) :: WhenMatched f k x y (a -> b) -> WhenMatched f k x y a -> WhenMatched f k x y b liftA2 :: (a -> b -> c) -> WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y c (>) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y b (<*) :: WhenMatched f k x y a -> WhenMatched f k x y b -> WhenMatched f k x y a

class Functor f => Phantom f Source #

Minimal complete definition

coerce

Instances

Phantom f => Phantom (Backwards f) Source #
Instance details Defined in Lens.Family.Phantom Methods coerce :: Backwards f a -> Backwards f b
Phantom (Const a :: Type -> Type) Source #
Instance details Defined in Lens.Family.Phantom Methods coerce :: Const a a0 -> Const a b
Phantom (Constant a :: Type -> Type) Source #
Instance details Defined in Lens.Family.Phantom Methods coerce :: Constant a a0 -> Constant a b
Phantom f => Phantom (AlongsideRight f a) Source #
Instance details Defined in Lens.Family.Stock Methods coerce :: AlongsideRight f a a0 -> AlongsideRight f a b
Phantom f => Phantom (AlongsideLeft f a) Source #
Instance details Defined in Lens.Family.Stock Methods coerce :: AlongsideLeft f a a0 -> AlongsideLeft f a b
(Phantom f, Functor g) => Phantom (Compose f g) Source #
Instance details Defined in Lens.Family.Phantom Methods coerce :: Compose f g a -> Compose f g b

class Applicative f => Identical f Source #

Minimal complete definition

extract

Instances

Identical Identity Source #
Instance details Defined in Lens.Family.Identical Methods extract :: Identity a -> a
Identical f => Identical (Backwards f) Source #
Instance details Defined in Lens.Family.Identical Methods extract :: Backwards f a -> a
(Identical f, Identical g) => Identical (Compose f g) Source #
Instance details Defined in Lens.Family.Identical Methods extract :: Compose f g a -> a