Hoogle Search

Within LTS Haskell 24.6 (ghc-9.10.2)

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

Exact lookup

1. (:<>:) :: ErrorMessage -> ErrorMessage -> ErrorMessage

   ghc-internal	GHC.Internal.TypeError

   Put two pieces of error message next to each other.

2. (:$$:) :: ErrorMessage -> ErrorMessage -> ErrorMessage

   ghc-internal	GHC.Internal.TypeLits

   Stack two pieces of error message on top of each other.

3. (:<>:) :: ErrorMessage -> ErrorMessage -> ErrorMessage

   ghc-internal	GHC.Internal.TypeLits

   Put two pieces of error message next to each other.

4. (:.) :: Int -> Int -> Ix2

   massiv	Data.Massiv.Core.Index

   No documentation available.

5. (:>) :: Int -> !Ix (n - 1) -> IxN (n :: Nat)

   massiv	Data.Massiv.Core.Index

   No documentation available.

6. data m :+: n

   monoid-extras	Data.Monoid.Coproduct

   m :+: n is the coproduct of monoids m and n. Values of type m :+: n consist of alternating lists of m and n values. The empty list is the identity, and composition is list concatenation, with appropriate combining of adjacent elements and removing identities when possible.

7. (:||:) :: m -> m -> Cut m

   monoid-extras	Data.Monoid.Cut

   No documentation available.

8. type a ::: l = (Maybe a, l)

   monoid-extras	Data.Monoid.MList

   No documentation available.

9. class l :>: a

   monoid-extras	Data.Monoid.MList

   The relation l :>: a holds when a is the type of an element in l. For example, (Char ::: Int ::: Bool ::: Nil) :>: Int.

10. (:|) :: m -> m -> Split m

    monoid-extras	Data.Monoid.Split

    No documentation available.

Page 20 of many | Previous | Next