Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

Exact lookup

1. mapMaybe :: (a -> Maybe b) -> Array a -> Array b

   unordered-containers	Data.HashMap.Internal.Array

   No documentation available.

2. mapMaybe :: (v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

   unordered-containers	Data.HashMap.Internal.Strict

   Transform this map by applying a function to every value and retaining only some of them.

3. mapMaybeWithKey :: (k -> v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

   unordered-containers	Data.HashMap.Internal.Strict

   Transform this map by applying a function to every value and retaining only some of them.

4. mapMaybe :: (v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

   unordered-containers	Data.HashMap.Lazy

   Transform this map by applying a function to every value and retaining only some of them.

5. mapMaybeWithKey :: (k -> v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

   unordered-containers	Data.HashMap.Lazy

   Transform this map by applying a function to every value and retaining only some of them.

6. mapMaybe :: (v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

   unordered-containers	Data.HashMap.Strict

   Transform this map by applying a function to every value and retaining only some of them.

7. mapMaybeWithKey :: (k -> v1 -> Maybe v2) -> HashMap k v1 -> HashMap k v2

   unordered-containers	Data.HashMap.Strict

   Transform this map by applying a function to every value and retaining only some of them.

8. suchThatMaybe :: Gen a -> (a -> Bool) -> Gen (Maybe a)

   tasty-quickcheck	Test.Tasty.QuickCheck

   Tries to generate a value that satisfies a predicate. If it fails to do so after enough attempts, returns Nothing.

9. mapMaybePrimArray :: (Prim a, Prim b) => (a -> Maybe b) -> PrimArray a -> PrimArray b

   primitive	Data.Primitive.PrimArray

   Map over a primitive array, optionally discarding some elements. This has the same behavior as Data.Maybe.mapMaybe.

10. mapMaybePrimArrayA :: (Applicative f, Prim a, Prim b) => (a -> f (Maybe b)) -> PrimArray a -> f (PrimArray b)

    primitive	Data.Primitive.PrimArray

    Map over the primitive array, keeping the elements for which the applicative predicate provides a Just.

Page 108 of many | Previous | Next