Hoogle Search

Within LTS Haskell 24.26 (ghc-9.10.3)

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

  1. fmapMaybe :: Filterable f => (a -> Maybe b) -> f a -> f b

    reflex Reflex.Class

    Alias for mapMaybe

  2. fmapMaybe :: FunctorMaybe f => (a -> Maybe b) -> f a -> f b

    reflex Reflex.FunctorMaybe

    Combined mapping and filtering function.

  3. rigidMapM :: (ListLike full item, Monad m) => (item -> m item) -> full -> m full

    ListLike Data.ListLike

    Like mapM, but without the possibility of changing the type of the item. This can have performance benefits with some types.

  4. rigidMapM :: (ListLike full item, Monad m) => (item -> m item) -> full -> m full

    ListLike Data.ListLike.Base

    Like mapM, but without the possibility of changing the type of the item. This can have performance benefits with some types.

  5. fmapMaybeUB :: (a -> b) -> MaybeUB a -> MaybeUB b

    ghc-lib-parser GHC.Data.Unboxed

    No documentation available.

  6. concatMapM :: (Monad m, Traversable f) => (a -> m [b]) -> f a -> m [b]

    ghc-lib-parser GHC.Utils.Monad

    Monadic version of concatMap

  7. foldMapM :: (Applicative m, Foldable t, Monoid b) => (a -> m b) -> t a -> m b

    ghc-lib-parser GHC.Utils.Monad

    Monadic version of foldMap

  8. imapMutable :: forall (arr :: Type -> Type) a m . (Contiguous arr, Element arr a, PrimMonad m) => (Int -> a -> a) -> Mutable arr (PrimState m) a -> m ()

    contiguous Data.Primitive.Contiguous

    Map over a mutable array with indices, modifying the elements in place.

  9. imapMutable' :: forall m (arr :: Type -> Type) a . (PrimMonad m, Contiguous arr, Element arr a) => (Int -> a -> a) -> Mutable arr (PrimState m) a -> m ()

    contiguous Data.Primitive.Contiguous

    Strictly map over a mutable array with indices, modifying the elements in place.

  10. bimapM :: (Monad m, Ord k') => (k -> v -> m (k', v')) -> Map k v -> m (Map k' v')

    dbus DBus.Internal.Types

    No documentation available.

Page 81 of many | Previous | Next