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.
mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> MaxPQueue k a -> MaxPQueue k bpqueue Data.PQueue.Prio.Max Map values and collect the Just results.
mapMaybeWithKey :: Ord k => (k -> a -> Maybe b) -> MinPQueue k a -> MinPQueue k bpqueue Data.PQueue.Prio.Min Map values and collect the Just results.
mapMaybeWithKey :: (Int -> a -> Maybe b) -> MonoidalIntMap a -> MonoidalIntMap bmonoidal-containers Data.IntMap.Monoidal No documentation available.
mapMaybeWithKey :: (Int -> a -> Maybe b) -> MonoidalIntMap a -> MonoidalIntMap bmonoidal-containers Data.IntMap.Monoidal.Strict No documentation available.
mapMaybeWithKey :: (k -> a -> Maybe b) -> MonoidalMap k a -> MonoidalMap k bmonoidal-containers Data.Map.Monoidal No documentation available.
mapMaybeWithKey :: (k -> a -> Maybe b) -> MonoidalMap k a -> MonoidalMap k bmonoidal-containers Data.Map.Monoidal.Strict No documentation available.
mapMaybeWithKey :: (Key -> a -> Maybe b) -> NEIntMap a -> IntMap bnonempty-containers Data.IntMap.NonEmpty O(n). Map keys/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 k _ = if k < 5 then Just ("key : " ++ (show k)) else Nothing mapMaybeWithKey f (fromList ((5,"a") :| [(3,"b")])) == Data.IntMap.singleton 3 "key : 3"
mapMaybeWithKey :: (k -> a -> Maybe b) -> NEMap k a -> Map k bnonempty-containers Data.Map.NonEmpty O(n). Map keys/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 k _ = if k < 5 then Just ("key : " ++ (show k)) else Nothing mapMaybeWithKey f (fromList ((5,"a") :| [(3,"b")])) == Data.Map.singleton 3 "key : 3"
mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Vector a -> m (Vector b)rebase Rebase.Data.Vector No documentation available.
mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Stream m a -> Stream m brebase Rebase.Data.Vector.Fusion.Stream.Monadic Apply monadic function to each element and drop all Nothings