Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

1. data InsOrdHashMap k v

   openapi3	Data.HashMap.Strict.InsOrd.Compat

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

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

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   No documentation available.

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

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   No documentation available.

4. 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.

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

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   No documentation available.

6. 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.

7. 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.

8. _discriminatorMapping :: Discriminator -> InsOrdHashMap Text Text

   openapi3	Data.OpenApi

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

9. _schemaPattern :: Schema -> Maybe Pattern

   openapi3	Data.OpenApi

   No documentation available.

10. _schemaProperties :: Schema -> InsOrdHashMap Text (Referenced Schema)

    openapi3	Data.OpenApi

    No documentation available.

Page 570 of many | Previous | Next