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.

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

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

  3. module GHC.Internal.TH.Lib.Map

    No documentation available.

  4. data Map k a

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

    No documentation available.

  5. module GHC.Types.Unique.Map

    No documentation available.

  6. module Skeletest.Internal.Utils.Map

    No documentation available.

  7. module Dhall.Map

    Map type used to represent records and unions

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

  9. module Data.Express.Map

    Utilities for mapping or transforming Exprs.

  10. module Data.Patch.Map

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

Page 4 of many | Previous | Next