Hoogle Search
Within LTS Haskell 24.18 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapMaybe :: (a -> Maybe b) -> Word64Map a -> Word64Map bghc GHC.Data.Word64Map.Strict 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"
mapMaybeWithKey :: (Key -> a -> Maybe b) -> Word64Map a -> Word64Map bghc GHC.Data.Word64Map.Strict 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"mapMaybe :: (a -> Maybe b) -> Word64Map a -> Word64Map bghc GHC.Data.Word64Map.Strict.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"
mapMaybeWithKey :: (Key -> a -> Maybe b) -> Word64Map a -> Word64Map bghc GHC.Data.Word64Map.Strict.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"mapMonotonic :: (Key -> Key) -> Word64Set -> Word64Setghc GHC.Data.Word64Set The mapMonotonic f s == map f s, but works only when f is strictly increasing. The precondition is not checked. Semi-formally, we have:
and [x < y ==> f x < f y | x <- ls, y <- ls] ==> mapMonotonic f s == map f s where ls = toList s
mapMonotonic :: (Key -> Key) -> Word64Set -> Word64Setghc GHC.Data.Word64Set.Internal The mapMonotonic f s == map f s, but works only when f is strictly increasing. The precondition is not checked. Semi-formally, we have:
and [x < y ==> f x < f y | x <- ls, y <- ls] ==> mapMonotonic f s == map f s where ls = toList s
mapMaybeOccEnv :: (a -> Maybe b) -> OccEnv a -> OccEnv bghc GHC.Plugins mapMaybe for b OccEnv.
mapMaybeOccEnv :: (a -> Maybe b) -> OccEnv a -> OccEnv bghc GHC.Plugins mapMaybe for b OccEnv.
mapM_ :: (Foldable t, Monad m) => (a -> m b) -> t a -> m ()ghc GHC.Prelude.Basic No documentation available.
mapMaybeFvRn :: (a -> RnM (b, FreeVars)) -> Maybe a -> RnM (Maybe b, FreeVars)ghc GHC.Rename.Utils No documentation available.