Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapMaybe :: (v1 -> Maybe v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2insert-ordered-containers Data.HashMap.Strict.InsOrd No documentation available.
mapMaybeWithKey :: (k -> v1 -> Maybe v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2insert-ordered-containers Data.HashMap.Strict.InsOrd No documentation available.
-
streaming Streaming.Prelude The catMaybes function takes a Stream of Maybes and returns a Stream of all of the Just values. concat has the same behavior, but is more general; it works for any foldable container type.
-
streaming Streaming.Prelude The mapMaybe function is a version of map which can throw out elements. In particular, the functional argument returns something of type Maybe b. If this is Nothing, no element is added on to the result Stream. If it is Just b, then b is included in the result Stream.
mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Stream (Of a) m r -> Stream (Of b) m rstreaming Streaming.Prelude Map monadically over a stream, producing a new stream only containing the Just values.
catMaybes :: Filterable f => f (Maybe a) -> f awitherable Witherable catMaybes ≡ mapMaybe id
forMaybe :: (Witherable t, Applicative f) => t a -> (a -> f (Maybe b)) -> f (t b)witherable Witherable forMaybe = flip wither
imapMaybe :: FilterableWithIndex i t => (i -> a -> Maybe b) -> t a -> t bwitherable Witherable No documentation available.
mapMaybe :: Filterable f => (a -> Maybe b) -> f a -> f bwitherable Witherable Like mapMaybe.
-
co-log-core Colog.Core.Action cmap for convertions that may fail