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. type family Map (a1 :: a ~> b) (a2 :: NonEmpty a) :: NonEmpty b

   singletons-base	Data.List.NonEmpty.Singletons

   No documentation available.

2. type family Map (a1 :: a ~> b) (a2 :: [a]) :: [b]

   singletons-base	Data.List.Singletons

   No documentation available.

3. type family Map (a1 :: a ~> b) (a2 :: [a]) :: [b]

   singletons-base	Prelude.Singletons

   No documentation available.

4. data Map k v

   uniplate	Data.Generics.Uniplate.Data.Instances

   Invariant preserving version of Map from the containers packages, suitable for use with Uniplate. Use toMap to construct values, and fromMap to deconstruct values.

5. module Data.Validity.Map

   No documentation available.

6. module Data.GenValidity.Map

   No documentation available.

7. data Map k a

   protolude	Protolude

   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.

8. module Data.Convertible.Instances.Map

   Instances to convert between Map and association list. Copyright (C) 2009-2011 John Goerzen [email protected] All rights reserved. For license and copyright information, see the file LICENSE

9. module Data.Parameterized.Map

   This module defines finite maps where the key and value types are parameterized by an arbitrary kind. Some code was adapted from containers.

10. data Map k a

    basic-prelude	CorePrelude

    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.

Page 3 of many | Previous | Next