Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

  1. ( #%= ) :: MonadState s m => ALens s s a b -> (a -> b) -> m ()

    lens Control.Lens.Lens

    A version of (%=) that works on ALens.

  2. ( #%~ ) :: ALens s t a b -> (a -> b) -> s -> t

    lens Control.Lens.Lens

    A version of (%~) that works on ALens.

    >>> ("hello","world") & _2 #%~ length
    ("hello",5)
    

  3. (<#%=) :: MonadState s m => ALens s s a b -> (a -> b) -> m b

    lens Control.Lens.Lens

    A version of (<%=) that works on ALens.

  4. (<#%~) :: ALens s t a b -> (a -> b) -> s -> (b, t)

    lens Control.Lens.Lens

    A version of (<%~) that works on ALens.

    >>> ("hello","world") & _2 <#%~ length
    (5,("hello",5))
    

  5. (<%=) :: MonadState s m => LensLike ((,) b) s s a b -> (a -> b) -> m b

    lens Control.Lens.Lens

    Modify the target of a Lens into your Monad's state by a user supplied function and return the result. When applied to a Traversal, it this will return a monoidal summary of all of the intermediate results. When you do not need the result of the operation, (%=) is more flexible.

    (<%=) :: MonadState s m             => Lens' s a      -> (a -> a) -> m a
    (<%=) :: MonadState s m             => Iso' s a       -> (a -> a) -> m a
    (<%=) :: (MonadState s m, Monoid a) => Traversal' s a -> (a -> a) -> m a
    

  6. (<%@=) :: MonadState s m => Over (Indexed i) ((,) b) s s a b -> (i -> a -> b) -> m b

    lens Control.Lens.Lens

    Adjust the target of an IndexedLens returning the intermediate result, or adjust all of the targets of an IndexedTraversal within the current state, and return a monoidal summary of the intermediate results.

    (<%@=) :: MonadState s m                 => IndexedLens i s s a b      -> (i -> a -> b) -> m b
    (<%@=) :: (MonadState s m, Monoid b) => IndexedTraversal i s s a b -> (i -> a -> b) -> m b
    

  7. (<%@~) :: Over (Indexed i) ((,) b) s t a b -> (i -> a -> b) -> s -> (b, t)

    lens Control.Lens.Lens

    Adjust the target of an IndexedLens returning the intermediate result, or adjust all of the targets of an IndexedTraversal and return a monoidal summary along with the answer.

    l <%~ f ≡ l <%@~ const f
    
    When you do not need access to the index then (<%~) is more liberal in what it can accept. If you do not need the intermediate result, you can use (%@~) or even (%~).
    (<%@~) ::             IndexedLens i s t a b      -> (i -> a -> b) -> s -> (b, t)
    (<%@~) :: Monoid b => IndexedTraversal i s t a b -> (i -> a -> b) -> s -> (b, t)
    

  8. (<%~) :: LensLike ((,) b) s t a b -> (a -> b) -> s -> (b, t)

    lens Control.Lens.Lens

    Modify the target of a Lens and return the result. When you do not need the result of the operation, (%~) is more flexible.

    (<%~) ::             Lens s t a b      -> (a -> b) -> s -> (b, t)
    (<%~) ::             Iso s t a b       -> (a -> b) -> s -> (b, t)
    (<%~) :: Monoid b => Traversal s t a b -> (a -> b) -> s -> (b, t)
    

  9. (<<%=) :: (Strong p, MonadState s m) => Over p ((,) a) s s a b -> p a b -> m a

    lens Control.Lens.Lens

    Modify the target of a Lens into your Monad's state by a user supplied function and return the old value that was replaced. When applied to a Traversal, this will return a monoidal summary of all of the old values present. When you do not need the result of the operation, (%=) is more flexible.

    (<<%=) :: MonadState s m             => Lens' s a      -> (a -> a) -> m a
    (<<%=) :: MonadState s m             => Iso' s a       -> (a -> a) -> m a
    (<<%=) :: (MonadState s m, Monoid a) => Traversal' s a -> (a -> a) -> m a
    
    (<<%=) :: MonadState s m => LensLike ((,)a) s s a b -> (a -> b) -> m a
    

  10. (<<%@=) :: MonadState s m => Over (Indexed i) ((,) a) s s a b -> (i -> a -> b) -> m a

    lens Control.Lens.Lens

    Adjust the target of an IndexedLens returning the old value, or adjust all of the targets of an IndexedTraversal within the current state, and return a monoidal summary of the old values.

    (<<%@=) :: MonadState s m                 => IndexedLens i s s a b      -> (i -> a -> b) -> m a
    (<<%@=) :: (MonadState s m, Monoid b) => IndexedTraversal i s s a b -> (i -> a -> b) -> m a
    

Page 27 of many | Previous | Next