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.
transformM :: (Monad m, Plated a) => (a -> m a) -> a -> m alens Control.Lens.Combinators Transform every element in the tree, in a bottom-up manner, monadically.
transformMOf :: Monad m => LensLike (WrappedMonad m) a b a b -> (b -> m b) -> a -> m blens Control.Lens.Combinators 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
transformMOn :: (Monad m, Plated a) => LensLike (WrappedMonad m) s t a a -> (a -> m a) -> s -> m tlens Control.Lens.Combinators 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
-
lens Control.Lens.Combinators 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
transformOf :: ASetter a b a b -> (b -> b) -> a -> blens Control.Lens.Combinators Transform every element by recursively applying a given Setter in a bottom-up manner.
transformOf :: Traversal' a a -> (a -> a) -> a -> a transformOf :: Setter' a a -> (a -> a) -> a -> a
transformOn :: Plated a => ASetter s t a a -> (a -> a) -> s -> tlens 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
transformOnOf :: ASetter s t a b -> ASetter a b a b -> (b -> b) -> s -> tlens 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
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 ()
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 ()
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