Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

  1. makeMapM :: Name -> Q Exp

    deriving-compat Data.Traversable.Deriving

    Generates a lambda expression which behaves like mapM (without requiring a Traversable instance).

  2. makeMapMOptions :: FFTOptions -> Name -> Q Exp

    deriving-compat Data.Traversable.Deriving

    Like makeMapM, but takes an FFTOptions argument.

  3. gmapM :: (Data a, Monad m) => (forall d . Data d => d -> m d) -> a -> m a

    ghc-internal GHC.Internal.Data.Data

    A generic monadic transformation that maps over the immediate subterms The default definition instantiates the type constructor c in the type of gfoldl to the monad datatype constructor, defining injection and projection using return and >>=.

  4. gmapMo :: (Data a, MonadPlus m) => (forall d . Data d => d -> m d) -> a -> m a

    ghc-internal GHC.Internal.Data.Data

    Transformation of one immediate subterm with success

  5. gmapMp :: (Data a, MonadPlus m) => (forall d . Data d => d -> m d) -> a -> m a

    ghc-internal GHC.Internal.Data.Data

    Transformation of at least one immediate subterm does not fail

  6. imapM :: forall r ix b r' a m . (Source r' a, Manifest r b, Index ix, Monad m) => (ix -> a -> m b) -> Array r' ix a -> m (Array r ix b)

    massiv Data.Massiv.Array

    Map an index aware monadic action over an array sequentially.

  7. imapM_ :: (Index ix, Source r a, Monad m) => (ix -> a -> m b) -> Array r ix a -> m ()

    massiv Data.Massiv.Array

    Map a monadic index aware function over an array sequentially, while discarding the result.

    Examples

    >>> import Data.Massiv.Array

>>> imapM_ (curry print) $ range Seq (Ix1 10) 15
(0,10)
(1,11)
(2,12)
(3,13)
(4,14)

  8. simapM :: forall r ix a b m . (Stream r ix a, Monad m) => (ix -> a -> m b) -> Array r ix a -> m (Vector DS b)

    massiv Data.Massiv.Vector

    Traverse a stream vector with a monadic index aware function. Corresponds to: mapM (uncurry f) . imap (,) v

    Examples

  9. simapM_ :: forall r ix a b m . (Stream r ix a, Monad m) => (ix -> a -> m b) -> Array r ix a -> m ()

    massiv Data.Massiv.Vector

    Traverse a stream vector with a monadic index aware function, while discarding the result

    Examples

  10. simapMaybe :: Stream r ix a => (ix -> a -> Maybe b) -> Array r ix a -> Vector DS b

    massiv Data.Massiv.Vector

    Similar to smapMaybe, but map with an index aware function.

    Examples

Page 79 of many | Previous | Next