Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. transformer :: Data a => (a -> a) -> Transformer

   uniplate	Data.Generics.Uniplate.Data

   Wrap up a (a -> a) transformation function, to use with transformBis

2. data Transformer

   uniplate	Data.Generics.Uniplate.DataOnly

   No documentation available.

3. transform :: Uniplate on => (on -> on) -> on -> on

   uniplate	Data.Generics.Uniplate.DataOnly

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

   negLits = transform f
   where f (Neg (Lit i)) = Lit (negate i)
   f x = x
   

4. transformBi :: Biplate from to => (to -> to) -> from -> from

   uniplate	Data.Generics.Uniplate.DataOnly

   No documentation available.

5. transformBiM :: (Monad m, Applicative m, Biplate from to) => (to -> m to) -> from -> m from

   uniplate	Data.Generics.Uniplate.DataOnly

   No documentation available.

6. transformBis :: Data a => [[Transformer]] -> a -> a

   uniplate	Data.Generics.Uniplate.DataOnly

   Apply a sequence of transformations in order. This function obeys the equivalence:

   transformBis [[transformer f],[transformer g],...] == transformBi f . transformBi g . ...
   

   Each item of type [Transformer] is applied in turn, right to left. Within each [Transformer], the individual Transformer values may be interleaved. The implementation will attempt to perform fusion, and avoid walking any part of the data structure more than necessary. To further improve performance, you may wish to partially apply the first argument, which will calculate information about the relationship between the transformations.

7. transformM :: (Monad m, Applicative m, Uniplate on) => (on -> m on) -> on -> m on

   uniplate	Data.Generics.Uniplate.DataOnly

   Applicative variant of transform

8. transformer :: Data a => (a -> a) -> Transformer

   uniplate	Data.Generics.Uniplate.DataOnly

   Wrap up a (a -> a) transformation function, to use with transformBis

9. transform :: Uniplate on => (on -> on) -> on -> on

   uniplate	Data.Generics.Uniplate.Operations

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

   negLits = transform f
   where f (Neg (Lit i)) = Lit (negate i)
   f x = x
   

10. transformBi :: Biplate from to => (to -> to) -> from -> from

    uniplate	Data.Generics.Uniplate.Operations

    No documentation available.

Page 585 of many | Previous | Next