Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. package map-syntax

   Syntax sugar for defining maps Haskell's canonical list of tuples syntax for defining maps is not very convenient and also has ambiguous semantics. This package leverages do notation to create a lighter syntax that makes semantics explicit and also allows the option of fail-fast handling of duplicate keys.

2. mapK :: (k1 -> k2) -> MapSyntaxM k1 v a -> MapSyntax k2 v

   map-syntax	Data.Map.Syntax

   Maps a function over all the keys.

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

   map-syntax	Data.Map.Syntax

   Maps a function over all the values.

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

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

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

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

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

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

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

Page 292 of many | Previous | Next