Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. 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
   

2. 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
   

3. 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
   

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

   lens	Control.Lens.Internal.FieldTH

   No documentation available.

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

   lens	Control.Lens.Internal.FieldTH

   No documentation available.

6. transform :: Plated a => (a -> a) -> a -> a

   lens	Control.Lens.Plated

   Transform every element in the tree, in a bottom-up manner. For example, replacing negative literals with literals:

   negLits = transform $ \x -> case x of
   Neg (Lit i) -> Lit (negate i)
   _           -> x
   

7. transformM :: (Monad m, Plated a) => (a -> m a) -> a -> m a

   lens	Control.Lens.Plated

   Transform every element in the tree, in a bottom-up manner, monadically.

8. transformMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m b) -> a -> m b

   lens	Control.Lens.Plated

   Transform every element in a tree using a user supplied Traversal in a bottom-up manner with a monadic effect.

   transformMOf :: Monad m => Traversal' a a -> (a -> m a) -> a -> m a
   

9. transformMOn :: (Monad m, Plated a) => LensLike (WrappedMonad m) s t a a -> (a -> m a) -> s -> m t

   lens	Control.Lens.Plated

   Transform every element in the tree in a region indicated by a supplied Traversal, in a bottom-up manner, monadically.

   transformMOn :: (Monad m, Plated a) => Traversal' s a -> (a -> m a) -> s -> m s
   

10. transformMOnOf :: Monad m => LensLike (WrappedMonad m) s t a b -> LensLike (WrappedMonad m) a b a b -> (b -> m b) -> s -> m t

    lens	Control.Lens.Plated

    Transform every element in a tree that lies in a region indicated by a supplied Traversal, walking with a user supplied Traversal in a bottom-up manner with a monadic effect.

    transformMOnOf :: Monad m => Traversal' s a -> Traversal' a a -> (a -> m a) -> s -> m s
    

Page 417 of many | Previous | Next