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.
writeWord8ArrayAsWideChar# :: MutableByteArray# s -> Int# -> Char# -> State# s -> State# sghc-prim GHC.PrimopWrappers No documentation available.
writeWord8OffAddrAsWideChar# :: Addr# -> Int# -> Char# -> State# s -> State# sghc-prim GHC.PrimopWrappers No documentation available.
-
ghc-prim GHC.Types Deprecated: Void# is now an alias for the unboxed tuple (# #).
pattern
DivideByZero_ :: AsArithException s => slens Control.Exception.Lens No documentation available.
_DivideByZero :: AsArithException t => Prism' t ()lens Control.Exception.Lens Handle division by zero.
_DivideByZero ≡ _ArithException . _DivideByZero
_DivideByZero :: Prism' ArithException ArithException _DivideByZero :: Prism' SomeException ArithException
_Void :: forall s a p f . (Choice p, Applicative f) => p a (f Void) -> p s (f s)lens Control.Lens.Combinators Void is a logically uninhabited data type. This is a Prism that will always fail to match.
-
lens Control.Lens.Combinators 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')
aside :: APrism s t a b -> Prism (e, s) (e, t) (e, a) (e, b)lens Control.Lens.Combinators Use a Prism to work over part of a structure.
-
lens Control.Lens.Combinators Apply a different Traversal or Fold to each side of a Bitraversable container.
beside :: Traversal s t a b -> Traversal s' t' a b -> Traversal (r s s') (r t t') a b beside :: IndexedTraversal i s t a b -> IndexedTraversal i s' t' a b -> IndexedTraversal i (r s s') (r t t') a b beside :: IndexPreservingTraversal s t a b -> IndexPreservingTraversal s' t' a b -> IndexPreservingTraversal (r s s') (r t t') a b
beside :: Traversal s t a b -> Traversal s' t' a b -> Traversal (s,s') (t,t') a b beside :: Lens s t a b -> Lens s' t' a b -> Traversal (s,s') (t,t') a b beside :: Fold s a -> Fold s' a -> Fold (s,s') a beside :: Getter s a -> Getter s' a -> Fold (s,s') a
beside :: IndexedTraversal i s t a b -> IndexedTraversal i s' t' a b -> IndexedTraversal i (s,s') (t,t') a b beside :: IndexedLens i s t a b -> IndexedLens i s' t' a b -> IndexedTraversal i (s,s') (t,t') a b beside :: IndexedFold i s a -> IndexedFold i s' a -> IndexedFold i (s,s') a beside :: IndexedGetter i s a -> IndexedGetter i s' a -> IndexedFold i (s,s') a
beside :: IndexPreservingTraversal s t a b -> IndexPreservingTraversal s' t' a b -> IndexPreservingTraversal (s,s') (t,t') a b beside :: IndexPreservingLens s t a b -> IndexPreservingLens s' t' a b -> IndexPreservingTraversal (s,s') (t,t') a b beside :: IndexPreservingFold s a -> IndexPreservingFold s' a -> IndexPreservingFold (s,s') a beside :: IndexPreservingGetter s a -> IndexPreservingGetter s' a -> IndexPreservingFold (s,s') a
>>> ("hello",["world","!!!"])^..beside id traverse ["hello","world","!!!"] -
lens Control.Lens.Combinators Field rules for fields whose names are to be used verbatim, with no prefixes, no underscores, no transformations of any kind.