Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

Exact lookup

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

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

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

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

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

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

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

8. transformOf :: ASetter a b a b -> (b -> b) -> a -> b

   diagrams-lib	Diagrams.Prelude

   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
   

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

   diagrams-lib	Diagrams.Prelude

   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
   

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

    diagrams-lib	Diagrams.Prelude

    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
    

Page 438 of many | Previous | Next