Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. mapMaybeS :: forall (m :: Type -> Type) a b . Monad m => Automaton m a b -> Automaton m (Maybe a) (Maybe b)

   automaton	Data.Automaton

   Only step the automaton if the input is Just.

2. mapMaybeT :: (m (Maybe a) -> n (Maybe b)) -> MaybeT m a -> MaybeT n b

   automaton	Data.Automaton.Trans.Maybe

   Transform the computation inside a MaybeT.

   • runMaybeT (mapMaybeT f m) = f (runMaybeT
     m)

3. mapMapCursor :: (kc -> lc) -> (vc -> wc) -> (k -> l) -> (v -> w) -> MapCursor kc vc k v -> MapCursor lc wc l w

   cursor	Cursor.Map

   No documentation available.

4. mapMapCursor :: (k -> l) -> (v -> w) -> MapCursor k v -> MapCursor l w

   cursor	Cursor.Simple.Map

   No documentation available.

5. mapM_ :: (Vector v a, Applicative f) => (a -> f b) -> v a -> f ()

   fixed-vector	Data.Vector.Fixed

   Apply monadic action to each element of vector and ignore result.

6. mapM_ :: forall (n :: PeanoNum) f a b . (ArityPeano n, Applicative f) => (a -> f b) -> ContVec n a -> f ()

   fixed-vector	Data.Vector.Fixed.Cont

   Apply monadic action to each element of vector and ignore result.

7. mapMG :: (Vector v a, Vector w b, Dim w ~ Dim v, Monad m) => (a -> m b) -> v a -> m (w b)

   fixed-vector	Data.Vector.Fixed.Generic

   Monadic map over vector.

8. mapMonotonic :: Ord b => (a -> b) -> Heap a -> Heap b

   heaps	Data.Heap

   O(n). Map a monotone increasing function over the heap. Provides a better constant factor for performance than map, but no checking is performed that the function provided is monotone increasing. Misuse of this function can cause a Heap to violate the heap property.

   >>> mapMonotonic (+1) (fromList [1,2,3])
   fromList [2,3,4]
   
   >>> mapMonotonic (*2) (fromList [1,2,3])
   fromList [2,4,6]
   

9. mapM' :: (MapM' f ss, Applicative m) => (forall (s :: k) . () => t s -> m (t' (f s))) -> PL t ss -> m (PL t' (Ss' f ss))

   hetero-parameter-list	Data.HeteroParList

   No documentation available.

10. mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()

    mixed-types-num	Numeric.MixedTypes.PreludeHiding

    Map each element of a structure to a monadic action, evaluate these actions from left to right, and ignore the results. For a version that doesn't ignore the results see mapM. mapM_ is just like traverse_, but specialised to monadic actions.

Page 44 of many | Previous | Next