Hoogle Search

Within LTS Haskell 22.23 (ghc-9.6.5)

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

Exact lookup

1. data () => Map k a

   rio	RIO.Prelude.Types

   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. newtype Map a b

   leancheck	Test.LeanCheck.Utils.Types

   Lists of pairs representing maps. The Listable tiers enumeration will not have repeated maps.

   > take 6 (list :: [Map Nat Nat])
   [Map [],Map [(0,0)],Map [(0,1)],Map [(1,0)],Map [(0,2)],Map [(1,1)]]
   

3. Map :: [(a, b)] -> Map a b

   leancheck	Test.LeanCheck.Utils.Types

   No documentation available.

4. data () => Map k a

   relude	Relude.Container.Reexport

   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. module Relude.Extra.Map

   Contains implementation of polymorphic type classes for data types Set and Map.

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

7. data () => Map k a

   Cabal-syntax	Distribution.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.

8. data Map

   first-class-families	Fcf

   Type-level fmap for type-level functors. Note: this name clashes with Map from containers. FMap is provided as a synonym to avoid this.

   Example

   >>> data Example where Ex :: a -> Example  -- Hide the type of examples to avoid brittleness in different GHC versions
   
   >>> data AddMul :: Nat -> Nat -> Exp Nat
   
   >>> type instance Eval (AddMul x y) = (x TL.+ y) TL.* (x TL.+ y)
   
   >>> :kind! Ex (Eval (Map (AddMul 2) '[0, 1, 2, 3, 4]) :: [Nat])
   Ex (Eval (Map (AddMul 2) '[0, 1, 2, 3, 4]) :: [Nat]) :: Example
   = Ex [4, 9, 16, 25, 36]
   

9. data Map

   first-class-families	Fcf.Class.Functor

   Type-level fmap for type-level functors. Note: this name clashes with Map from containers. FMap is provided as a synonym to avoid this.

   Example

   >>> data Example where Ex :: a -> Example  -- Hide the type of examples to avoid brittleness in different GHC versions
   
   >>> data AddMul :: Nat -> Nat -> Exp Nat
   
   >>> type instance Eval (AddMul x y) = (x TL.+ y) TL.* (x TL.+ y)
   
   >>> :kind! Ex (Eval (Map (AddMul 2) '[0, 1, 2, 3, 4]) :: [Nat])
   Ex (Eval (Map (AddMul 2) '[0, 1, 2, 3, 4]) :: [Nat]) :: Example
   = Ex [4, 9, 16, 25, 36]
   

10. data Map

    first-class-families	Fcf.Classes

    Type-level fmap for type-level functors. Note: this name clashes with Map from containers. FMap is provided as a synonym to avoid this.

    Example

    >>> data Example where Ex :: a -> Example  -- Hide the type of examples to avoid brittleness in different GHC versions
    
    >>> data AddMul :: Nat -> Nat -> Exp Nat
    
    >>> type instance Eval (AddMul x y) = (x TL.+ y) TL.* (x TL.+ y)
    
    >>> :kind! Ex (Eval (Map (AddMul 2) '[0, 1, 2, 3, 4]) :: [Nat])
    Ex (Eval (Map (AddMul 2) '[0, 1, 2, 3, 4]) :: [Nat]) :: Example
    = Ex [4, 9, 16, 25, 36]
    

Page 2 of many | Previous | Next