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.

Exact lookup

1. mapMaybe :: forall k a b . (a -> Maybe b) -> MonoidalMap k a -> MonoidalMap k b

   monoidal-containers	Data.Map.Monoidal.Strict

   No documentation available.

2. mapMaybe :: (a -> Maybe b) -> NEIntMap a -> IntMap b

   nonempty-containers	Data.IntMap.NonEmpty

   O(n). Map values and collect the Just results. Returns a potentially empty map (IntMap), because the function could potentially return Nothing on all items in the NEIntMap.

   let f x = if x == "a" then Just "new a" else Nothing
   mapMaybe f (fromList ((5,"a") :| [(3,"b")])) == Data.IntMap.singleton 5 "new a"
   

3. mapMaybe :: (a -> Maybe b) -> NEMap k a -> Map k b

   nonempty-containers	Data.Map.NonEmpty

   O(n). Map values and collect the Just results. Returns a potentially empty map (Map), because the function could potentially return Nothing on all items in the NEMap.

   let f x = if x == "a" then Just "new a" else Nothing
   mapMaybe f (fromList ((5,"a") :| [(3,"b")])) == Data.Map.singleton 5 "new a"
   

4. mapMaybe :: (a -> Maybe b) -> Vector a -> Vector b

   rebase	Rebase.Data.Vector

   No documentation available.

5. mapMaybe :: forall (m :: Type -> Type) a b . Monad m => (a -> Maybe b) -> Stream m a -> Stream m b

   rebase	Rebase.Data.Vector.Fusion.Stream.Monadic

   No documentation available.

6. mapMaybe :: (Vector v a, Vector v b) => (a -> Maybe b) -> v a -> v b

   rebase	Rebase.Data.Vector.Generic

   No documentation available.

7. mapMaybe :: (Prim a, Prim b) => (a -> Maybe b) -> Vector a -> Vector b

   rebase	Rebase.Data.Vector.Primitive

   No documentation available.

8. mapMaybe :: (Storable a, Storable b) => (a -> Maybe b) -> Vector a -> Vector b

   rebase	Rebase.Data.Vector.Storable

   No documentation available.

9. mapMaybe :: (Unbox a, Unbox b) => (a -> Maybe b) -> Vector a -> Vector b

   rebase	Rebase.Data.Vector.Unboxed

   No documentation available.

10. mapMaybe :: forall (m :: Type -> Type) cl a b . Monad m => ClSF m cl a b -> ClSF m cl (Maybe a) (Maybe b)

    rhine	FRP.Rhine.ClSF.Core

    Call a ClSF every time the input is 'Just a'. Caution: This will not change the time differences since the last tick. For example, while integrate 1 is approximately the same as timeInfoOf sinceInit, mapMaybe $ integrate 1 is very different from mapMaybe $ timeInfoOf sinceInit. The former only integrates when the input is Just 1, whereas the latter always returns the correct time since initialisation.

Page 8 of many | Previous | Next