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. mapMBound :: forall m (f :: Type -> Type) b c a . (Monad m, Traversable f) => (b -> m c) -> Scope b f a -> m (Scope c f a)

    bound Bound.Scope

    mapM over both bound and free variables

  2. mapMBound_ :: forall g (f :: Type -> Type) b d a . (Monad g, Foldable f) => (b -> g d) -> Scope b f a -> g ()

    bound Bound.Scope

    mapM_ over the variables bound by this scope

  3. mapMScope :: forall m (f :: Type -> Type) b d a c . (Monad m, Traversable f) => (b -> m d) -> (a -> m c) -> Scope b f a -> m (Scope d f c)

    bound Bound.Scope

    A traverseScope that can be used when you only have a Monad instance

  4. mapMScope_ :: forall m (f :: Type -> Type) b d a c . (Monad m, Foldable f) => (b -> m d) -> (a -> m c) -> Scope b f a -> m ()

    bound Bound.Scope

    A traverseScope_ that can be used when you only have a Monad instance

  5. mapMBound :: forall m (f :: Type -> Type) b c a . (Monad m, Traversable f) => (b -> m c) -> Scope b f a -> m (Scope c f a)

    bound Bound.Scope.Simple

    mapM over both bound and free variables

  6. mapMBound_ :: forall g (f :: Type -> Type) b d a . (Monad g, Foldable f) => (b -> g d) -> Scope b f a -> g ()

    bound Bound.Scope.Simple

    mapM_ over the variables bound by this scope

  7. mapMScope :: forall m (f :: Type -> Type) b d a c . (Monad m, Traversable f) => (b -> m d) -> (a -> m c) -> Scope b f a -> m (Scope d f c)

    bound Bound.Scope.Simple

    A traverseScope that can be used when you only have a Monad instance

  8. mapMScope_ :: forall m (f :: Type -> Type) b d a c . (Monad m, Foldable f) => (b -> m d) -> (a -> m c) -> Scope b f a -> m ()

    bound Bound.Scope.Simple

    A traverseScope_ that can be used when you only have a Monad instance

  9. mapM_ :: (Contiguous arr, Element arr a, Element arr b, Applicative f) => (a -> f b) -> arr a -> f ()

    contiguous Data.Primitive.Contiguous

    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_ = traverse_

  10. mapMaybe :: forall arr1 arr2 a b . (Contiguous arr1, Element arr1 a, Contiguous arr2, Element arr2 b) => (a -> Maybe b) -> arr1 a -> arr2 b

    contiguous Data.Primitive.Contiguous

    The mapMaybe function is a version of map which can throw out elements. In particular, the functional arguments returns something of type Maybe b. If this is Nothing, no element is added on to the result array. If it is Just b, then b is included in the result array.

Page 38 of many | Previous | Next