Hoogle Search
Within LTS Haskell 24.40 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
AlongsideRight :: f (a, b) -> AlongsideRight (f :: Type -> Type) a blens Control.Lens.Internal.Getter No documentation available.
getAlongsideLeft :: AlongsideLeft (f :: Type -> Type) b a -> f (a, b)lens Control.Lens.Internal.Getter No documentation available.
getAlongsideRight :: AlongsideRight (f :: Type -> Type) a b -> f (a, b)lens Control.Lens.Internal.Getter No documentation available.
-
lens Control.Lens.Lens alongside makes a Lens from two other lenses or a Getter from two other getters by executing them on their respective halves of a product.
>>> (Left a, Right b)^.alongside chosen chosen (a,b)
>>> (Left a, Right b) & alongside chosen chosen .~ (c,d) (Left c,Right d)
alongside :: Lens s t a b -> Lens s' t' a' b' -> Lens (s,s') (t,t') (a,a') (b,b') alongside :: Getter s a -> Getter s' a' -> Getter (s,s') (a,a')
-
lens Control.Lens.Lens Lift a Lens so it can run under a function (or other corepresentable profunctor).
inside :: Lens s t a b -> Lens (e -> s) (e -> t) (e -> a) (e -> b)
>>> (\x -> (x-1,x+1)) ^. inside _1 $ 5 4
>>> runState (modify (1:) >> modify (2:)) ^. (inside _2) $ [] [2,1]
_Void :: forall s a p f . (Choice p, Applicative f) => p a (f Void) -> p s (f s)lens Control.Lens.Prism Void is a logically uninhabited data type. This is a Prism that will always fail to match.
aside :: APrism s t a b -> Prism (e, s) (e, t) (e, a) (e, b)lens Control.Lens.Prism Use a Prism to work over part of a structure.
-
lens Control.Lens.Prism Use a Prism as a kind of first-class pattern.
outside :: Prism s t a b -> Lens (t -> r) (s -> r) (b -> r) (a -> r)
runIdentity :: Identity a -> alens Control.Lens.Setter No documentation available.
-
lens Control.Lens.TH Field rules for fields whose names are to be used verbatim, with no prefixes, no underscores, no transformations of any kind.