Hoogle Search

Within LTS Haskell 24.16 (ghc-9.10.3)

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

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

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

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

  4. data Map k a

    classy-prelude ClassyPrelude

    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.

  5. type family Map (f :: a ~> b) (xs :: [a]) :: [b]

    defun-core DeFun.List

    List map 

    >>> :kind! Map NotSym [True, False]
Map NotSym [True, False] :: [Bool]
= [False, True]

    >>> :kind! Map (Con1 Just) [1, 2, 3]
Map (Con1 Just) [1, 2, 3] :: [Maybe Natural]
= [Just 1, Just 2, Just 3]

  6. module GHC.Internal.TH.Lib.Map

    No documentation available.

  7. data Map k a

    ghc-lib-parser GHC.Internal.TH.Lib.Map

    No documentation available.

  8. module GHC.Types.Unique.Map

    No documentation available.

  9. module Skeletest.Internal.Utils.Map

    No documentation available.

  10. module Dhall.Map

    Map type used to represent records and unions

Page 39 of many | Previous | Next