Hoogle Search

Within LTS Haskell 24.27 (ghc-9.10.3)

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

  1. mapBound :: forall (f :: Type -> Type) b b' a . Functor f => (b -> b') -> Scope b f a -> Scope b' f a

    bound Bound.Scope.Simple

    Perform a change of variables on bound variables.

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

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

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

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

  6. mapScope :: forall (f :: Type -> Type) b d a c . Functor f => (b -> d) -> (a -> c) -> Scope b f a -> Scope d f c

    bound Bound.Scope.Simple

    Perform a change of variables, reassigning both bound and free variables.

  7. map2 :: Text -> Builder -> Text -> Builder -> Builder

    bytebuild Data.Bytes.Builder.Avro

    Encode a map with exactly two key-value pairs. The keys are text. This is commonly used to encode the header in an avro file, which has a map with two keys: avro.schema and avro.codec.

  8. mapErrorEffectfully :: (e1 -> ST s e2) -> Parser e1 s a -> Parser e2 s a

    bytesmith Data.Bytes.Parser

    Effectfully adjusts the error message if an error occurs.

  9. map' :: (Contiguous arr1, Element arr1 b, Contiguous arr2, Element arr2 c) => (b -> c) -> arr1 b -> arr2 c

    contiguous Data.Primitive.Contiguous

    Map strictly over the elements of an array. Note that because a new array must be created, the resulting array type can be different than the original.

  10. mapAccum' :: forall arr1 arr2 a b c . (Contiguous arr1, Contiguous arr2, Element arr1 b, Element arr2 c, Monoid a) => (b -> (a, c)) -> arr1 b -> (a, arr2 c)

    contiguous Data.Primitive.Contiguous

    No documentation available.

Page 191 of many | Previous | Next