Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

  1. premap :: (a -> b) -> Fold b r -> Fold a r

    foldl Control.Foldl

    (premap f folder) returns a new Fold where f is applied at each step 

    fold (premap f folder) list = fold folder (List.map f list)

    >>> fold (premap Sum Foldl.mconcat) [1..10]
Sum {getSum = 55}

    >>> fold Foldl.mconcat (List.map Sum [1..10])
Sum {getSum = 55}

    premap id = id

premap (f . g) = premap g . premap f

    premap k (pure r) = pure r

premap k (f <*> x) = premap k f <*> premap k x

  2. premapM :: Monad m => (a -> m b) -> FoldM m b r -> FoldM m a r

    foldl Control.Foldl

    (premapM f folder) returns a new FoldM where f is applied to each input element 

    premapM return = id

premapM (f <=< g) = premap g . premap f

    premapM k (pure r) = pure r

premapM k (f <*> x) = premapM k f <*> premapM k x

  3. premap :: (a -> b) -> Fold1 b r -> Fold1 a r

    foldl Control.Foldl.NonEmpty

    (premap f folder) returns a new Fold1 where f is applied at each step 

    Foldl1.fold1 (premap f folder) list = Foldl1.fold1 folder (NonEmpty.map f list)

    >>> Foldl1.fold1 (premap Sum Foldl1.sconcat) (1 :| [2..10])
Sum {getSum = 55}

    >>> Foldl1.fold1 Foldl1.sconcat $ NonEmpty.map Sum (1 :| [2..10])
Sum {getSum = 55}

    premap id = id

premap (f . g) = premap g . premap f

    premap k (pure r) = pure r

premap k (f <*> x) = premap k f <*> premap k x

  4. premap :: (a -> b) -> Scan b r -> Scan a r

    foldl Control.Scanl

    (premap f scaner) returns a new Scan where f is applied at each step 

    scan (premap f scaner) list = scan scaner (map f list)

    premap id = id

premap (f . g) = premap g . premap f

    premap k (pure r) = pure r

premap k (f <*> x) = premap k f <*> premap k x

  5. premapM :: Monad m => (a -> m b) -> ScanM m b r -> ScanM m a r

    foldl Control.Scanl

    (premapM f scaner) returns a new ScanM where f is applied to each input element 

    premapM return = id

premapM (f <=< g) = premap g . premap f

    premapM k (pure r) = pure r

premapM k (f <*> x) = premapM k f <*> premapM k x

  6. type SessionMap = Map Text ByteString

    yesod-core Yesod.Core.Handler

    No documentation available.

  7. type KeyedTypeMap = HashMap (TypeRep, ByteString) Dynamic

    yesod-core Yesod.Core.Types

    No documentation available.

  8. type SessionMap = Map Text ByteString

    yesod-core Yesod.Core.Types

    No documentation available.

  9. type TypeMap = HashMap TypeRep Dynamic

    yesod-core Yesod.Core.Types

    No documentation available.

  10. colorMap :: Pixel a => (PixelBaseComponent a -> PixelBaseComponent a) -> a -> a

    JuicyPixels Codec.Picture

    Apply a function to each component of a pixel. If the color type possess an alpha (transparency channel), it is treated like the other color components.

Page 476 of many | Previous | Next