# Hoogle Search

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

1. base Prelude

No documentation available.

2. base 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 /=.

3. Equality

4. base Data.Eq

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

5. base Data.Ord

No documentation available.

6. tasty Test.Tasty.Patterns.Types

No documentation available.

7. ghc-prim GHC.Classes

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

8. ghc-prim GHC.Types

No documentation available.

9. hedgehog Hedgehog.Internal.Prelude

No documentation available.

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

Page 1 of many | Next