Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

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

Exact lookup

1. mapM_ :: Monad m => (a -> m ()) -> FoldM m a ()

   foldl	Control.Foldl

   Converts an effectful function to a fold. Specialized version of sink.

2. mapAdjacent :: Traversable f => (a -> a -> b) -> T f a -> f b

   non-empty	Data.NonEmpty

   No documentation available.

3. mapHead :: forall a (f :: Type -> Type) . (a -> a) -> T f a -> T f a

   non-empty	Data.NonEmpty

   No documentation available.

4. mapTail :: (f a -> g a) -> T f a -> T g a

   non-empty	Data.NonEmpty

   No documentation available.

5. mapWithKey :: Ord k => (k -> a -> b) -> T k a -> T k b

   non-empty	Data.NonEmpty.Map

   No documentation available.

6. mapAdjacent :: (Cons f, Zip f) => (a -> a -> b) -> T f a -> f b

   non-empty	Data.NonEmpty.Mixed

   No documentation available.

7. mapState :: forall (g :: Type -> Type) a b . Functor g => ((a, Rep g) -> (b, Rep g)) -> State g a -> State g b

   adjunctions	Control.Monad.Representable.State

   Map both the return value and final state of a computation using the given function.

   • runState (mapState f m) = f . runState
     m

8. mapStateT :: forall (g :: Type -> Type) m a n b . Functor g => (m (a, Rep g) -> n (b, Rep g)) -> StateT g m a -> StateT g n b

   adjunctions	Control.Monad.Representable.State

   No documentation available.

9. mapDefault :: Ord key => elem -> key -> T (Map key elem) elem

   data-accessor	Data.Accessor.Container

   Treats a finite map like an infinite map, where all undefined elements are replaced by a default value.

10. mapMaybe :: Ord key => key -> T (Map key elem) (Maybe elem)

    data-accessor	Data.Accessor.Container

    Treats a finite map like an infinite map, where all undefined elements are Nothing and defined elements are Just.

Page 157 of many | Previous | Next