Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. mapMaybeInput :: (Monoid s, Monoid s') => (s -> Maybe s') -> (s' -> Maybe s) -> Parser t s r -> Parser t s' r

   incremental-parser	Text.ParserCombinators.Incremental.LeftBiasedLocal

   Converts a parser accepting one input type to another, just like 'mapMaybeInput except the two argument functions can demand more input by returning Nothing. If 'mapMaybeInput is defined for the two input inputs, then

   mapInput f g == mapMaybeInput (Just . f) (Just . g)
   

2. mapMaybeInput :: (Monoid s, Monoid s') => (s -> Maybe s') -> (s' -> Maybe s) -> Parser t s r -> Parser t s' r

   incremental-parser	Text.ParserCombinators.Incremental.Symmetric

   Converts a parser accepting one input type to another, just like 'mapMaybeInput except the two argument functions can demand more input by returning Nothing. If 'mapMaybeInput is defined for the two input inputs, then

   mapInput f g == mapMaybeInput (Just . f) (Just . g)
   

3. mapMSEnv :: Monad m => (a -> m b) -> SEnv a -> m (SEnv b)

   liquid-fixpoint	Language.Fixpoint.Types.Environments

   No documentation available.

4. mapMExpr :: Monad m => (Expr -> m Expr) -> Expr -> m Expr

   liquid-fixpoint	Language.Fixpoint.Types.Visitor

   No documentation available.

5. mapMLocLHNames :: forall m a . (Data a, Monad m) => (Located LHName -> m (Located LHName)) -> a -> m a

   liquidhaskell-boot	Language.Haskell.Liquid.Types.Names

   No documentation available.

6. mapMeasureTy :: (ty0 -> ty1) -> MeasureV v ty0 ctor -> MeasureV v ty1 ctor

   liquidhaskell-boot	Language.Haskell.Liquid.Types.Types

   No documentation available.

7. mapMeasureV :: (v -> v') -> MeasureV v ty ctor -> MeasureV v' ty ctor

   liquidhaskell-boot	Language.Haskell.Liquid.Types.Types

   No documentation available.

8. mapM_ :: MonadParallel m => (a -> m b) -> [a] -> m ()

   monad-parallel	Control.Monad.Parallel

   Like mapM_, but applying the function to the individual list items in parallel.

9. mapMaybe :: (Key -> Maybe Key) -> IntMultiSet -> IntMultiSet

   multiset	Data.IntMultiSet

   O(n). Map and collect the Just results.

10. mapMonotonic :: (Key -> Key) -> IntMultiSet -> IntMultiSet

    multiset	Data.IntMultiSet

    O(n). mapMonotonic f s == map f s, but works only when f is strictly monotonic. The precondition is not checked. Semi-formally, we have:

    and [x < y ==> f x < f y | x <- ls, y <- ls]
    ==> mapMonotonic f s == map f s
    where ls = toList s
    

Page 47 of many | Previous | Next