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.

Exact lookup

1. data Map (c :: a -> Exp b) (d :: f a) (e :: f b)

   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]
   

2. data Map (c :: a -> Exp b) (d :: f a) (e :: f b)

   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]
   

3. data Map (c :: a -> Exp b) (d :: f a) (e :: f b)

   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]
   

4. type family Map (a1 :: a ~> b) (a2 :: NonEmpty a) :: NonEmpty b

   singletons-base	Data.List.NonEmpty.Singletons

   No documentation available.

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

   singletons-base	Data.List.Singletons

   No documentation available.

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

   singletons-base	Prelude.Singletons

   No documentation available.

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

8. module Data.Validity.Map

   No documentation available.

9. module Data.GenValidity.Map

   No documentation available.

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

Page 38 of many | Previous | Next