Hoogle Search

Within LTS Haskell 24.5 (ghc-9.10.2)

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

Exact lookup

1. Eq :: Op

   pseudo-boolean	Data.PseudoBoolean

   equal

2. Eq :: Instance

   purescript-bridge	Language.PureScript.Bridge.SumType

   No documentation available.

3. Eq :: BinaryOp

   vivid-supercollider	Vivid.SC.SynthDef.Types

   No documentation available.

4. EQ :: Ordering

   classy-prelude-yesod	ClassyPrelude.Yesod

   No documentation available.

5. class Eq a

   classy-prelude-yesod	ClassyPrelude.Yesod

   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)

6. Eq :: PersistFilter

   classy-prelude-yesod	ClassyPrelude.Yesod

   No documentation available.

7. EQ :: Ordering

   constrained-categories	Control.Category.Constrained.Prelude

   No documentation available.

8. class Eq a

   constrained-categories	Control.Category.Constrained.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)

9. EQ :: Ordering

   constrained-categories	Control.Category.Hask

   No documentation available.

10. class Eq a

    constrained-categories	Control.Category.Hask

    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)

Page 12 of many | Previous | Next