Hoogle Search
Within LTS Haskell 24.52 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
smapMaybe :: Stream r ix a => (a -> Maybe b) -> Array r ix a -> Vector DS bmassiv Data.Massiv.Vector Apply a function to each element of the array, while discarding Nothing and keeping the Maybe result.
Examples
-
massiv Data.Massiv.Vector Similar to smapMaybe, but with the Applicative function. Similar to mapMaybe id $ mapM f arr
Examples
-
openapi3 Data.HashMap.Strict.InsOrd.Compat HashMap which tries its best to remember insertion order of elements.
foldMapWithKey :: Monoid m => (k -> a -> m) -> InsOrdHashMap k a -> mopenapi3 Data.HashMap.Strict.InsOrd.Compat No documentation available.
fromHashMap :: HashMap k v -> InsOrdHashMap k vopenapi3 Data.HashMap.Strict.InsOrd.Compat No documentation available.
-
openapi3 Data.HashMap.Strict.InsOrd.Compat This is a slight lie, as roundtrip doesn't preserve ordering.
toHashMap :: InsOrdHashMap k v -> HashMap k vopenapi3 Data.HashMap.Strict.InsOrd.Compat No documentation available.
unorderedFoldMap :: Monoid m => (a -> m) -> InsOrdHashMap k a -> mopenapi3 Data.HashMap.Strict.InsOrd.Compat More efficient than foldMap, when folding in insertion order is not important.
unorderedFoldMapWithKey :: Monoid m => (k -> a -> m) -> InsOrdHashMap k a -> mopenapi3 Data.HashMap.Strict.InsOrd.Compat More efficient than foldMapWithKey, when folding in insertion order is not important.
_discriminatorMapping :: Discriminator -> InsOrdHashMap Text Textopenapi3 Data.OpenApi An object to hold mappings between payload values and schema names or references.