Hoogle Search

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

iforOf :: (Indexed i a (f b) -> s -> f t) -> s -> (i -> a -> f b) -> f t

diagrams-lib	Diagrams.Prelude

Traverse with an index (and the arguments flipped).

forOf l a ≡ iforOf l a . const
iforOf ≡ flip . itraverseOf

iforOf :: Functor f     => IndexedLens i s t a b       -> s -> (i -> a -> f b) -> f t
iforOf :: Applicative f => IndexedTraversal i s t a b  -> s -> (i -> a -> f b) -> f t
iforOf :: Apply f       => IndexedTraversal1 i s t a b -> s -> (i -> a -> f b) -> f t

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

diagrams-lib	Diagrams.Prelude

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_ :: (FoldableWithIndex i t, Applicative f) => t a -> (i -> a -> f b) -> f ()

diagrams-lib Diagrams.Prelude

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
```
lensRulesFor :: [(String, String)] -> LensRules

diagrams-lib Diagrams.Prelude

Construct a LensRules value for generating top-level definitions using the given map from field names to definition names.
makeClassyFor :: String -> String -> [(String, String)] -> Name -> DecsQ

diagrams-lib Diagrams.Prelude

Derive lenses and traversals, using a named wrapper class, and specifying explicit pairings of (fieldName, traversalName). Example usage:
```
makeClassyFor "HasFoo" "foo" [("_foo", "fooLens"), ("bar", "lbar")] ''Foo
```
makeLensesFor :: [(String, String)] -> Name -> DecsQ

diagrams-lib Diagrams.Prelude

Derive lenses and traversals, specifying explicit pairings of (fieldName, lensName). If you map multiple names to the same label, and it is present in the same constructor then this will generate a Traversal. e.g.
```
makeLensesFor [("_foo", "fooLens"), ("baz", "lbaz")] ''Foo
makeLensesFor [("_barX", "bar"), ("_barY", "bar")] ''Bar
```
transformM :: (Monad m, Plated a) => (a -> m a) -> a -> m a

diagrams-lib Diagrams.Prelude

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 b

diagrams-lib Diagrams.Prelude

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 t

diagrams-lib Diagrams.Prelude

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
```
transformMOnOf :: Monad m => LensLike (WrappedMonad m) s t a b -> LensLike (WrappedMonad m) a b a b -> (b -> m b) -> s -> m t

diagrams-lib Diagrams.Prelude

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 553 of many | Previous | Next