Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

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

  1. mapV :: (v1 -> v2) -> MapSyntaxM k v1 a -> MapSyntax k v2

    map-syntax Data.Map.Syntax

    Maps a function over all the values.

  2. mapExpr :: (Floating m, Floating n, Ord u, Ord v, Eq n, Ord m) => (n -> m) -> (v -> u) -> Expr v n -> Expr u m

    mfsolve Math.MFSolve

    map an expression using the given substitution.

  3. mapSimple :: (Floating m, Floating n) => (n -> m) -> (v -> u) -> SimpleExpr v n -> SimpleExpr u m

    mfsolve Math.MFSolve

    map a simple expression using the given substitution.

  4. mapM :: MonadParallel m => (a -> m b) -> [a] -> m [b]

    monad-parallel Control.Monad.Parallel

    Like mapM, but applying the function to the individual list items in parallel.

  5. mapM_ :: MonadParallel m => (a -> m b) -> [a] -> m ()

    monad-parallel Control.Monad.Parallel

    Like mapM_, but applying the function to the individual list items in parallel.

  6. mapException :: (Exception e1, Exception e2) => (e1 -> e2) -> a -> a

    monad-peel Control.Exception.Peel

    This function maps one exception into another as proposed in the paper "A semantics for imprecise exceptions".

  7. mapG :: (InsertLeft t b, Monoid (t b)) => (a -> b) -> t a -> t b

    monoid-insertleft Data.InsertLeft

    Inspired by: Graham Hutton. A tutorial on the universality and expressiveness of fold. J. Functional Programming 9 (4): 355–372, July 1999. that is available at the URL: https://www.cs.nott.ac.uk/~pszgmh/fold.pdf. Acts similarly to the map function from Prelude.

  8. mapAccumL :: MonoidNull v2 => (s -> v1 -> (s, v2)) -> s -> MonoidMap k v1 -> (s, MonoidMap k v2)

    monoidmap-internal Data.MonoidMap.Internal

    Threads an accumulating argument through the map in ascending order of keys. Satisfies the following property: 

    mapAccumL f s m ==
fmap fromMap (Traversable.mapAccumL f s (toMap m))

  9. mapAccumLWithKey :: MonoidNull v2 => (s -> k -> v1 -> (s, v2)) -> s -> MonoidMap k v1 -> (s, MonoidMap k v2)

    monoidmap-internal Data.MonoidMap.Internal

    Threads an accumulating argument through the map in ascending order of keys. Satisfies the following property: 

    mapAccumLWithKey f s m ==
fmap fromMap (Map.mapAccumWithKey f s (toMap m))

  10. mapAccumR :: MonoidNull v2 => (s -> v1 -> (s, v2)) -> s -> MonoidMap k v1 -> (s, MonoidMap k v2)

    monoidmap-internal Data.MonoidMap.Internal

    Threads an accumulating argument through the map in descending order of keys. Satisfies the following property: 

    mapAccumR f s m ==
fmap fromMap (Traversable.mapAccumR f s (toMap m))

Page 293 of many | Previous | Next