Hoogle Search

Within LTS Haskell 24.50 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

  1. _AllocationLimitExceeded :: AsAllocationLimitExceeded t => Prism' t ()

    lens Control.Exception.Lens

    There is no additional information carried in an AllocationLimitExceeded Exception. 

    _AllocationLimitExceeded :: Prism' AllocationLimitExceeded ()
_AllocationLimitExceeded :: Prism' SomeException           ()

  2. _ErrorCall :: AsErrorCall t => Prism' t String

    lens Control.Exception.Lens

    Retrieve the argument given to error. ErrorCall is isomorphic to a String. 

    >>> catching _ErrorCall (error "touch down!") return
"touch down!"

    _ErrorCall :: Prism' ErrorCall     String
_ErrorCall :: Prism' SomeException String

  3. _NestedAtomically :: AsNestedAtomically t => Prism' t ()

    lens Control.Exception.Lens

    There is no additional information carried in a NestedAtomically Exception. 

    _NestedAtomically :: Prism' NestedAtomically ()
_NestedAtomically :: Prism' SomeException    ()

  4. __AllocationLimitExceeded :: AsAllocationLimitExceeded t => Prism' t AllocationLimitExceeded

    lens Control.Exception.Lens 

    __AllocationLimitExceeded :: Prism' AllocationLimitExceeded AllocationLimitExceeded
__AllocationLimitExceeded :: Prism' SomeException           AllocationLimitExceeded

  5. __ErrorCall :: AsErrorCall t => Prism' t ErrorCall

    lens Control.Exception.Lens 

    __ErrorCall :: Prism' ErrorCall     ErrorCall
__ErrorCall :: Prism' SomeException ErrorCall

  6. __NestedAtomically :: AsNestedAtomically t => Prism' t NestedAtomically

    lens Control.Exception.Lens 

    __NestedAtomically :: Prism' NestedAtomically NestedAtomically
__NestedAtomically :: Prism' SomeException    NestedAtomically

  7. iall :: FoldableWithIndex i f => (i -> a -> Bool) -> f a -> Bool

    lens Control.Lens.Combinators

    Return whether or not all elements in a container satisfy a predicate, with access to the index i. When you don't need access to the index then all is more flexible in what it accepts. 

    all ≡ iall . const

  8. iallOf :: IndexedGetting i All s a -> (i -> a -> Bool) -> s -> Bool

    lens Control.Lens.Combinators

    Return whether or not all elements viewed through an IndexedFold or IndexedTraversal satisfy a predicate, with access to the i. When you don't need access to the index then allOf is more flexible in what it accepts. 

    allOf l ≡ iallOf l . const

    iallOf :: IndexedGetter i s a     -> (i -> a -> Bool) -> s -> Bool
iallOf :: IndexedFold i s a       -> (i -> a -> Bool) -> s -> Bool
iallOf :: IndexedLens' i s a      -> (i -> a -> Bool) -> s -> Bool
iallOf :: IndexedTraversal' i s a -> (i -> a -> Bool) -> s -> Bool

  9. ilocally :: MonadReader s m => AnIndexedSetter i s s a b -> (i -> a -> b) -> m r -> m r

    lens Control.Lens.Combinators

    This is a generalization of locally that allows one to make indexed local changes to a Reader environment associated with the target of a Setter, Lens, or Traversal. 

    locally l f ≡ ilocally l f . const
ilocally l f ≡ locally l f . Indexed

    ilocally :: MonadReader s m => IndexedLens s s a b      -> (i -> a -> b) -> m r -> m r
ilocally :: MonadReader s m => IndexedTraversal s s a b -> (i -> a -> b) -> m r -> m r
ilocally :: MonadReader s m => IndexedSetter s s a b    -> (i -> a -> b) -> m r -> m r

  10. locally :: MonadReader s m => ASetter s s a b -> (a -> b) -> m r -> m r

    lens Control.Lens.Combinators

    Modify the value of the Reader environment associated with the target of a Setter, Lens, or Traversal. 

    locally l id a ≡ a
locally l f . locally l g ≡ locally l (f . g)

    >>> (1,1) & locally _1 (+1) (uncurry (+))
3

    >>> "," & locally ($) ("Hello" <>) (<> " world!")
"Hello, world!"

    locally :: MonadReader s m => Iso s s a b       -> (a -> b) -> m r -> m r
locally :: MonadReader s m => Lens s s a b      -> (a -> b) -> m r -> m r
locally :: MonadReader s m => Traversal s s a b -> (a -> b) -> m r -> m r
locally :: MonadReader s m => Setter s s a b    -> (a -> b) -> m r -> m r

Page 213 of many | Previous | Next