Hoogle Search

Within LTS Haskell 24.41 (ghc-9.10.3)

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

  1. data (a :: Nat) :=: (b :: Nat)

    natural-arithmetic Arithmetic.Types

    Proof that the first argument is equal to the second argument.

  2. data (a :: Nat) :=:# (b :: Nat)

    natural-arithmetic Arithmetic.Types

    No documentation available.

  3. data (a :: Nat) :=: (b :: Nat)

    natural-arithmetic Arithmetic.Unsafe

    Proof that the first argument is equal to the second argument.

  4. newtype (a :: Nat) :=:# (b :: Nat)

    natural-arithmetic Arithmetic.Unsafe

    No documentation available.

  5. pattern (:<) :: Ord a => a -> MinQueue a -> MinQueue a

    pqueue Data.PQueue.Min

    A bidirectional pattern synonym for working with the minimum view of a MinQueue. Using :< to construct a queue performs an insertion in <math> amortized time. When matching on a :< q, forcing q takes <math> time.

  6. pattern (:<) :: Ord k => (k, a) -> MinPQueue k a -> MinPQueue k a

    pqueue Data.PQueue.Prio.Min

    A bidirectional pattern synonym for working with the minimum view of a MinPQueue. Using :< to construct a queue performs an insertion in <math> amortized time. When matching on (k, a) :< q, forcing q takes <math> time.

  7. type family x :&&: y

    tfp Type.Data.Bool

    No documentation available.

  8. type family x :||: y

    tfp Type.Data.Bool

    No documentation available.

  9. type family x :*: y

    tfp Type.Data.Num

    No documentation available.

  10. type family x :+: y

    tfp Type.Data.Num

    No documentation available.

Page 26 of many | Previous | Next