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.

  1. setMaximumFormInputSize :: Int64 -> UploadPolicy -> UploadPolicy

    snap-core Snap.Util.FileUploads

    Set the maximum size of a form input which will be read into our rqParams map.

  2. setMaximumNumberOfFormInputs :: Int -> UploadPolicy -> UploadPolicy

    snap-core Snap.Util.FileUploads

    Set the maximum size of a form input which will be read into our rqParams map.

  3. setProcessFormInputs :: Bool -> UploadPolicy -> UploadPolicy

    snap-core Snap.Util.FileUploads

    Set the upload policy for treating parts without filenames as form input.

  4. X_Forwarded_For :: ProxyType

    snap-core Snap.Util.Proxy

    Use the Forwarded-For or X-Forwarded-For header

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

    uniplate Data.Generics.Biplate

    No documentation available.

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

    uniplate Data.Generics.Biplate

    No documentation available.

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

    uniplate Data.Generics.Uniplate

    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
    

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

    uniplate Data.Generics.Uniplate

    Monadic variant of transform

  9. data Transformer

    uniplate Data.Generics.Uniplate.Data

    No documentation available.

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

    uniplate Data.Generics.Uniplate.Data

    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.

Page 584 of many | Previous | Next