Hoogle Search
Within LTS Haskell 24.39 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
filterMaybe :: (a -> Bool) -> Maybe a -> Maybe aghc-lib-parser GHC.Data.TrieMap No documentation available.
foldMaybe :: (a -> b -> b) -> Maybe a -> b -> bghc-lib-parser GHC.Data.TrieMap No documentation available.
apMaybeUB :: MaybeUB (a -> b) -> MaybeUB a -> MaybeUB bghc-lib-parser GHC.Data.Unboxed No documentation available.
fmapMaybeUB :: (a -> b) -> MaybeUB a -> MaybeUB bghc-lib-parser GHC.Data.Unboxed No documentation available.
fromMaybeUB :: a -> MaybeUB a -> aghc-lib-parser GHC.Data.Unboxed No documentation available.
mapMaybe :: (a -> Maybe b) -> Word64Map a -> Word64Map bghc-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"
-
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. mapMaybeWithKey :: (Key -> a -> Maybe b) -> Word64Map a -> Word64Map bghc-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"traverseMaybeMissing :: Applicative f => (Key -> x -> f (Maybe y)) -> WhenMissing f x yghc-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.
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.