Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

1. SplitInsideCodePoint :: Position -> Rope -> VfsLog

   lsp	Language.LSP.VFS

   No documentation available.

2. divide :: CanDiv t1 t2 => t1 -> t2 -> DivType t1 t2

   mixed-types-num	Numeric.MixedTypes.Div

   No documentation available.

3. class CanTestValid t

   mixed-types-num	Numeric.MixedTypes.Eq

   No documentation available.

4. isValid :: CanTestValid t => t -> Bool

   mixed-types-num	Numeric.MixedTypes.Eq

   No documentation available.

5. specResultIsValid1 :: (Arbitrary t1, Show t1, CanTestValid t1, CanTestValid t2) => (t1 -> t2) -> String -> T t1 -> Spec

   mixed-types-num	Numeric.MixedTypes.Eq

   HSpec property checking the validity of unary operations' results.

6. specResultIsValid1Pre :: (Arbitrary t1, Show t1, CanTestValid t1, CanTestValid t2) => (t1 -> Bool) -> (t1 -> t2) -> String -> T t1 -> Spec

   mixed-types-num	Numeric.MixedTypes.Eq

   No documentation available.

7. specResultIsValid2 :: (Arbitrary t1, Show t1, Arbitrary t2, Show t2, CanTestValid t1, CanTestValid t2, CanTestValid t3) => (t1 -> t2 -> t3) -> String -> T t1 -> T t2 -> Spec

   mixed-types-num	Numeric.MixedTypes.Eq

   HSpec properties that check validity of operations' results.

8. specResultIsValid2Pre :: (Arbitrary t1, Show t1, Arbitrary t2, Show t2, CanTestValid t1, CanTestValid t2, CanTestValid t3) => (t1 -> t2 -> Bool) -> (t1 -> t2 -> t3) -> String -> T t1 -> T t2 -> Spec

   mixed-types-num	Numeric.MixedTypes.Eq

   No documentation available.

9. module Numeric.MixedTypes.PreludeHiding

   Prelude without operations that clash with MixedTypes

10. class Semigroup a => Monoid a

    mixed-types-num	Numeric.MixedTypes.PreludeHiding

    The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following:

    • Right identity x <> mempty = x
    • Left identity mempty <> x = x
    • Associativity x <> (y <> z) = (x <> y) <> z (Semigroup law)
    • Concatenation mconcat = foldr (<>) mempty
    You can alternatively define mconcat instead of mempty, in which case the laws are:
    • Unit mconcat (pure x) = x
    • Multiplication mconcat (join xss) = mconcat (fmap mconcat xss)
    • Subclass mconcat (toList xs) = sconcat xs
    The method names refer to the monoid of lists under concatenation, but there are many other instances. Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define newtypes and make those instances of Monoid, e.g. Sum and Product. NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.

Page 1397 of many | Previous | Next