Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. apMaybeUB :: MaybeUB (a -> b) -> MaybeUB a -> MaybeUB b

   ghc-lib-parser	GHC.Data.Unboxed

   No documentation available.

2. fmapMaybeUB :: (a -> b) -> MaybeUB a -> MaybeUB b

   ghc-lib-parser	GHC.Data.Unboxed

   No documentation available.

3. fromMaybeUB :: a -> MaybeUB a -> a

   ghc-lib-parser	GHC.Data.Unboxed

   No documentation available.

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

   ghc-lib-parser	GHC.Data.Word64Map.Internal

   Map values and collect the Just results.

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

5. mapMaybeMissing :: forall (f :: Type -> Type) x y . Applicative f => (Key -> x -> Maybe y) -> WhenMissing f x y

   ghc-lib-parser	GHC.Data.Word64Map.Internal

   Map over the entries whose keys are missing from the other map, optionally removing some. This is the most powerful SimpleWhenMissing tactic, but others are usually more efficient.

   mapMaybeMissing :: (Key -> x -> Maybe y) -> SimpleWhenMissing x y
   

   mapMaybeMissing f = traverseMaybeMissing (\k x -> pure (f k x))
   

   but mapMaybeMissing uses fewer unnecessary Applicative operations.

6. mapMaybeWithKey :: (Key -> a -> Maybe b) -> Word64Map a -> Word64Map b

   ghc-lib-parser	GHC.Data.Word64Map.Internal

   Map keys/values and collect the Just results.

   let f k _ = if k < 5 then Just ("key : " ++ (show k)) else Nothing
   mapMaybeWithKey f (fromList [(5,"a"), (3,"b")]) == singleton 3 "key : 3"
   

7. traverseMaybeMissing :: Applicative f => (Key -> x -> f (Maybe y)) -> WhenMissing f x y

   ghc-lib-parser	GHC.Data.Word64Map.Internal

   Traverse over the entries whose keys are missing from the other map, optionally producing values to put in the result. This is the most powerful WhenMissing tactic, but others are usually more efficient.

8. traverseMaybeWithKey :: Applicative f => (Key -> a -> f (Maybe b)) -> Word64Map a -> f (Word64Map b)

   ghc-lib-parser	GHC.Data.Word64Map.Internal

   Traverse keys/values and collect the Just results.

9. zipWithMaybeAMatched :: (Key -> x -> y -> f (Maybe z)) -> WhenMatched f x y z

   ghc-lib-parser	GHC.Data.Word64Map.Internal

   When a key is found in both maps, apply a function to the key and values, perform the resulting action, and maybe use the result in the merged map. This is the fundamental WhenMatched tactic.

10. zipWithMaybeMatched :: forall (f :: Type -> Type) x y z . Applicative f => (Key -> x -> y -> Maybe z) -> WhenMatched f x y z

    ghc-lib-parser	GHC.Data.Word64Map.Internal

    When a key is found in both maps, apply a function to the key and values and maybe use the result in the merged map.

    zipWithMaybeMatched
    :: (Key -> x -> y -> Maybe z)
    -> SimpleWhenMatched x y z
    

Page 201 of many | Previous | Next