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.
transformOf :: ASetter a b a b -> (b -> b) -> a -> blens Control.Lens.Plated 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.Plated 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.Plated 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
declareClassyFor :: [(String, (String, String))] -> [(String, String)] -> DecsQ -> DecsQlens Control.Lens.TH Similar to makeClassyFor, but takes a declaration quote.
declareLensesFor :: [(String, String)] -> DecsQ -> DecsQlens Control.Lens.TH Similar to makeLensesFor, but takes a declaration quote.
lensRulesFor :: [(String, String)] -> LensRuleslens Control.Lens.TH 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 -> DecsQlens Control.Lens.TH 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 -> DecsQlens Control.Lens.TH 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
iforMOf :: (Indexed i a (WrappedMonad m b) -> s -> WrappedMonad m t) -> s -> (i -> a -> m b) -> m tlens Control.Lens.Traversal Map each element of a structure targeted by a Lens to a monadic action, evaluate these actions from left to right, and collect the results, with access its position (and the arguments flipped).
forMOf l a ≡ iforMOf l a . const iforMOf ≡ flip . imapMOf
iforMOf :: Monad m => IndexedLens i s t a b -> s -> (i -> a -> m b) -> m t iforMOf :: Monad m => IndexedTraversal i s t a b -> s -> (i -> a -> m b) -> m t
iforOf :: (Indexed i a (f b) -> s -> f t) -> s -> (i -> a -> f b) -> f tlens Control.Lens.Traversal 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