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. mapMaybe :: Ord k => (a -> Maybe b) -> MinPQueue k a -> MinPQueue k b

    pqueue Data.PQueue.Prio.Min

    Map values and collect the Just results.

  2. mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> MinPQueue k a -> MinPQueue k b

    pqueue Data.PQueue.Prio.Min

    Map values and collect the Just results.

  3. mapWithKey :: (k -> a -> b) -> MinPQueue k a -> MinPQueue k b

    pqueue Data.PQueue.Prio.Min

    Map a function over all values in the queue.

  4. mappend :: Monoid a => a -> a -> a

    terminfo System.Console.Terminfo.Base

    No documentation available.

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

    bound Bound.Scope

    Perform a change of variables on bound variables.

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

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

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

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

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

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

Page 190 of many | Previous | Next