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.

Exact lookup

1. transformOn :: Plated a => ASetter s t a a -> (a -> a) -> s -> t

   lens	Control.Lens.Combinators

   Transform every element in the tree in a bottom-up manner over a region indicated by a Setter.

   transformOn :: Plated a => Traversal' s a -> (a -> a) -> s -> s
   transformOn :: Plated a => Setter' s a    -> (a -> a) -> s -> s
   

2. transformOnOf :: ASetter s t a b -> ASetter a b a b -> (b -> b) -> s -> t

   lens	Control.Lens.Combinators

   Transform every element in a region indicated by a Setter by recursively applying another Setter in a bottom-up manner.

   transformOnOf :: Setter' s a -> Traversal' a a -> (a -> a) -> s -> s
   transformOnOf :: Setter' s a -> Setter' a a    -> (a -> a) -> s -> s
   

3. iforMOf_ :: Monad m => IndexedGetting i (Sequenced r m) s a -> s -> (i -> a -> m r) -> m ()

   lens	Control.Lens.Fold

   Run monadic actions for each target of an IndexedFold or IndexedTraversal with access to the index, discarding the results (with the arguments flipped).

   iforMOf_ ≡ flip . imapMOf_
   

   When you don't need access to the index then forMOf_ is more flexible in what it accepts.

   forMOf_ l a ≡ iforMOf l a . const
   

   iforMOf_ :: Monad m => IndexedGetter i s a     -> s -> (i -> a -> m r) -> m ()
   iforMOf_ :: Monad m => IndexedFold i s a       -> s -> (i -> a -> m r) -> m ()
   iforMOf_ :: Monad m => IndexedLens' i s a      -> s -> (i -> a -> m r) -> m ()
   iforMOf_ :: Monad m => IndexedTraversal' i s a -> s -> (i -> a -> m r) -> m ()
   

4. iforOf_ :: Functor f => IndexedGetting i (Traversed r f) s a -> s -> (i -> a -> f r) -> f ()

   lens	Control.Lens.Fold

   Traverse the targets of an IndexedFold or IndexedTraversal with access to the index, discarding the results (with the arguments flipped).

   iforOf_ ≡ flip . itraverseOf_
   

   When you don't need access to the index then forOf_ is more flexible in what it accepts.

   forOf_ l a ≡ iforOf_ l a . const
   

   iforOf_ :: Functor f     => IndexedGetter i s a     -> s -> (i -> a -> f r) -> f ()
   iforOf_ :: Applicative f => IndexedFold i s a       -> s -> (i -> a -> f r) -> f ()
   iforOf_ :: Functor f     => IndexedLens' i s a      -> s -> (i -> a -> f r) -> f ()
   iforOf_ :: Applicative f => IndexedTraversal' i s a -> s -> (i -> a -> f r) -> f ()
   

5. ifor :: (TraversableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f (t b)

   lens	Control.Lens.Indexed

   Traverse with an index (and the arguments flipped).

   for a ≡ ifor a . const
   ifor ≡ flip itraverse
   

6. iforM :: (TraversableWithIndex i t, Monad m) => t a -> (i -> a -> m b) -> m (t b)

   lens	Control.Lens.Indexed

   Map each element of a structure to a monadic action, evaluate these actions from left to right, and collect the results, with access its position (and the arguments flipped).

   forM a ≡ iforM a . const
   iforM ≡ flip imapM
   

7. iforM_ :: (FoldableWithIndex i t, Monad m) => t a -> (i -> a -> m b) -> m ()

   lens	Control.Lens.Indexed

   Run monadic actions for each target of an IndexedFold or IndexedTraversal with access to the index, discarding the results (with the arguments flipped).

   iforM_ ≡ flip imapM_
   

   When you don't need access to the index then forM_ is more flexible in what it accepts.

   forM_ a ≡ iforM a . const
   

8. ifor_ :: (FoldableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f ()

   lens	Control.Lens.Indexed

   Traverse elements with access to the index i, discarding the results (with the arguments flipped).

   ifor_ ≡ flip itraverse_
   

   When you don't need access to the index then for_ is more flexible in what it accepts.

   for_ a ≡ ifor_ a . const
   

9. makeFieldOpticsForDec :: LensRules -> Dec -> DecsQ

   lens	Control.Lens.Internal.FieldTH

   No documentation available.

10. makeFieldOpticsForDec' :: LensRules -> Dec -> HasFieldClasses [Dec]

    lens	Control.Lens.Internal.FieldTH

    No documentation available.

Page 417 of many | Previous | Next