Hoogle Search

Within LTS Haskell 22.21 (ghc-9.6.5)

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

  1. EQ :: Ordering

    ghc-prim GHC.Types

    No documentation available.

  2. EQ :: Ordering

    hedgehog Hedgehog.Internal.Prelude

    No documentation available.

  3. class () => Eq a

    hedgehog Hedgehog.Internal.Prelude

    The Eq class defines equality (==) and inequality (/=). All the basic datatypes exported by the Prelude are instances of Eq, and Eq may be derived for any datatype whose constituents are also instances of Eq. The Haskell Report defines no laws for Eq. However, instances are encouraged to follow these properties:

    • Reflexivity x == x = True
    • Symmetry x == y = y == x
    • Transitivity if x == y && y == z = True, then x == z = True
    • Extensionality if x == y = True and f is a function whose return type is an instance of Eq, then f x == f y = True
    • Negation x /= y = not (x == y)
    Minimal complete definition: either == or /=.

  4. Eq :: PersistFilter

    persistent Database.Persist.Types

    No documentation available.

  5. EQ :: Cond

    ghc GHC.CmmToAsm.AArch64.Cond

    No documentation available.

  6. EQ :: Ordering

    ghc GHC.Prelude.Basic

    No documentation available.

  7. class () => Eq a

    ghc GHC.Prelude.Basic

    No documentation available.

  8. module Data.Eq

    No documentation available.

  9. module Test.Validity.Eq

    Eq properties You will need TypeApplications to use these.

  10. class () => Eq a

    haskell-gi-base Data.GI.Base.ShortPrelude

    The Eq class defines equality (==) and inequality (/=). All the basic datatypes exported by the Prelude are instances of Eq, and Eq may be derived for any datatype whose constituents are also instances of Eq. The Haskell Report defines no laws for Eq. However, instances are encouraged to follow these properties:

    • Reflexivity x == x = True
    • Symmetry x == y = y == x
    • Transitivity if x == y && y == z = True, then x == z = True
    • Extensionality if x == y = True and f is a function whose return type is an instance of Eq, then f x == f y = True
    • Negation x /= y = not (x == y)
    Minimal complete definition: either == or /=.

Page 2 of many | Previous | Next