Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. mapHere :: (a -> c) -> These a b -> These c b

   these	Data.These.Combinators

   mapHere = over here
   

2. mapThat :: (b -> b) -> These a b -> These a b

   these	Data.These.Combinators

   No documentation available.

3. mapThere :: (b -> d) -> These a b -> These a d

   these	Data.These.Combinators

   mapThere = over there
   

4. mapThese :: ((a, b) -> (a, b)) -> These a b -> These a b

   these	Data.These.Combinators

   No documentation available.

5. mapThis :: (a -> a) -> These a b -> These a b

   these	Data.These.Combinators

   No documentation available.

6. mapC :: Constructor -> Converter

   haskell-gi	Data.GI.CodeGen.Conversions

   No documentation available.

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

   foldl	Control.Foldl

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

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

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

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

Page 116 of many | Previous | Next