Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. mapMaybe2 :: (a -> Maybe b) -> Trie2 a -> Maybe (Trie2 b)

    bcp47 Data.BCP47.Trie.Internal

    No documentation available.

  2. mapMaybeA :: (Filtrable f, Traversable f, Applicative p) => (a -> p (Maybe b)) -> f a -> p (f b)

    filtrable Data.Filtrable

    Traverse the container with the given function, dropping the elements for which it returns Nothing.

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

    incremental-parser Text.ParserCombinators.Incremental

    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)
    

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

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

  6. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Stream m a -> Stream m b

    streamly-core Streamly.Data.Stream

    Like mapMaybe but maps a monadic function. Equivalent to:

    >>> mapMaybeM f = Stream.catMaybes . Stream.mapM f
    
    >>> mapM f = Stream.mapMaybeM (\x -> Just <$> f x)
    

  7. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Fold m b r -> Fold m a r

    streamly-core Streamly.Internal.Data.Fold

    >>> mapMaybeM f = Fold.lmapM f . Fold.catMaybes
    

  8. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Stream m a -> Stream m b

    streamly-core Streamly.Internal.Data.Stream

    Like mapMaybe but maps a monadic function. Equivalent to:

    >>> mapMaybeM f = Stream.catMaybes . Stream.mapM f
    
    >>> mapM f = Stream.mapMaybeM (\x -> Just <$> f x)
    

  9. mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Stream m a -> Stream m b

    vector-stream Data.Stream.Monadic

    Apply monadic function to each element and drop all Nothings

  10. mapMaybeWithKey :: (Ord k, Semigroup v2) => (k -> v1 -> a1 -> Maybe (v2, a2)) -> AnnotatedMap k v1 a1 -> AnnotatedMap k v2 a2

    what4 What4.Utils.AnnotatedMap

    No documentation available.

Page 24 of many | Previous | Next