Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. smapMaybeM :: forall r ix a b f . (Stream r ix a, Applicative f) => (a -> f (Maybe b)) -> Array r ix a -> f (Vector DS b)

   massiv	Data.Massiv.Vector

   Similar to smapMaybe, but with the Applicative function. Similar to mapMaybe id $ mapM f arr

   Examples

2. data InsOrdHashMap k v

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   HashMap which tries its best to remember insertion order of elements.

3. foldMapWithKey :: Monoid m => (k -> a -> m) -> InsOrdHashMap k a -> m

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   No documentation available.

4. fromHashMap :: HashMap k v -> InsOrdHashMap k v

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   No documentation available.

5. hashMap :: forall k a b p f . (Profunctor p, Functor f) => p (HashMap k a) (f (HashMap k b)) -> p (InsOrdHashMap k a) (f (InsOrdHashMap k b))

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   This is a slight lie, as roundtrip doesn't preserve ordering.

6. toHashMap :: InsOrdHashMap k v -> HashMap k v

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   No documentation available.

7. unorderedFoldMap :: Monoid m => (a -> m) -> InsOrdHashMap k a -> m

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   More efficient than foldMap, when folding in insertion order is not important.

8. unorderedFoldMapWithKey :: Monoid m => (k -> a -> m) -> InsOrdHashMap k a -> m

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   More efficient than foldMapWithKey, when folding in insertion order is not important.

9. _discriminatorMapping :: Discriminator -> InsOrdHashMap Text Text

   openapi3	Data.OpenApi

   An object to hold mappings between payload values and schema names or references.

10. _schemaPattern :: Schema -> Maybe Pattern

    openapi3	Data.OpenApi

    No documentation available.

Page 570 of many | Previous | Next