Hoogle Search

Within LTS Haskell 24.17 (ghc-9.10.3)

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

Exact lookup

1. data Map k v

   dhall	Dhall.Map

   A Map that remembers the original ordering of keys This is primarily used so that formatting preserves field order This is done primarily to avoid a dependency on insert-ordered-containers and also to improve performance

2. module Data.Express.Map

   Utilities for mapping or transforming Exprs.

3. module Data.Patch.Map

   Patches of this type consist only of insertions (including overwrites) and deletions.

4. module Rebase.Data.Map

   No documentation available.

5. data Map k a

   rebase	Rebase.Prelude

   A Map from keys k to values a. The Semigroup operation for Map is union, which prefers values from the left operand. If m1 maps a key k to a value a1, and m2 maps the same key to a different value a2, then their union m1 <> m2 maps k to a1.

6. data Map c

   apecs	Apecs

   A map based on Strict. O(log(n)) for most operations.

7. data Map c

   apecs	Apecs.Stores

   A map based on Strict. O(log(n)) for most operations.

8. Map :: Schema -> Schema

   avro	Data.Avro

   No documentation available.

9. Map :: HashMap Text Value -> Value

   avro	Data.Avro.Encoding.FromAvro

   No documentation available.

10. Map :: ReadSchema -> ReadSchema

    avro	Data.Avro.Schema.ReadSchema

    No documentation available.

Page 40 of many | Previous | Next