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. Map :: Schema -> Schema

   avro	Data.Avro.Schema.Schema

   No documentation available.

2. module Cursor.Map

   No documentation available.

3. module Cursor.Simple.Map

   No documentation available.

4. Map :: forall a b c . (a -> b) -> (b -> a) -> (b :-> c) -> a :-> c

   hedgehog-fn	Hedgehog.Function.Internal

   No documentation available.

5. module StmContainers.Map

   No documentation available.

6. data Map key value

   stm-containers	StmContainers.Map

   Hash-table, based on STM-specialized Hash Array Mapped Trie.

7. module Synthesizer.Dimensional.Map

   Maps that handle pairs of amplitudes and sampled values. They are a special form of arrows.

8. type family Map (f :: k -> l) (m :: Maybe k) :: Maybe l

   typelevel-tools-yj	Data.TypeLevel.ParMaybe

   No documentation available.

9. data Map v

   bytehash	Data.Bytes.HashMap

   A static perfect hash table where the keys are byte arrays. This table cannot be updated after its creation, but all lookups have guaranteed O(1) worst-case cost. It consumes linear space. This is an excellent candidate for use with compact regions.

10. data Map

    bytehash	Data.Bytes.HashMap.Word

    A static perfect hash table where the keys are byte arrays. This table cannot be updated after its creation, but all lookups have guaranteed O(1) worst-case cost. It consumes linear space. This is an excellent candidate for use with compact regions.

Page 41 of many | Previous | Next