Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

Exact lookup

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

   hedgehog-fn	Hedgehog.Function.Internal

   No documentation available.

2. module StmContainers.Map

   No documentation available.

3. data Map key value

   stm-containers	StmContainers.Map

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

4. module Synthesizer.Dimensional.Map

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

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

   typelevel-tools-yj	Data.TypeLevel.ParMaybe

   No documentation available.

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

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

8. data Map k a

   cabal-install-solver	Distribution.Solver.Compat.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.

9. data Map κ ν

   core-data	Core.Data.Structures

   A mapping from keys to values. The keys in a map needs to be an instance of the Key typeclass. Instances are already provided for many common element types. Map implements Foldable, Monoid, etc so many common operations such as foldr to reduce the structure with a right fold, length to get the number of key/value pairs in the dictionary, null to test whether the map is empty, and (<>) to join two maps together are available. To convert to other dictionary types see fromMap below. (this is a thin wrapper around unordered-containers's HashMap, but if you use the conversion functions to extract the key/value pairs in a list the list will be ordered according to the keys' Ord instance)

10. newtype Map a b

    cql	Database.CQL.Protocol

    No documentation available.

Page 6 of many | Previous | Next