Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. newtype WrappedMonoid m

   base-compat	Data.Semigroup.Compat

   Provide a Semigroup for an arbitrary Monoid. NOTE: This is not needed anymore since Semigroup became a superclass of Monoid in base-4.11 and this newtype be deprecated at some point in the future.

2. stimesIdempotentMonoid :: (Integral b, Monoid a) => b -> a -> a

   base-compat	Data.Semigroup.Compat

   This is a valid definition of stimes for an idempotent Monoid. When x <> x = x, this definition should be preferred, because it works in <math> rather than <math>

3. stimesMonoid :: (Integral b, Monoid a) => b -> a -> a

   base-compat	Data.Semigroup.Compat

   This is a valid definition of stimes for a Monoid. Unlike the default definition of stimes, it is defined for 0 and so it should be preferred where possible.

4. unwrapMonoid :: WrappedMonoid m -> m

   base-compat	Data.Semigroup.Compat

   No documentation available.

5. Opt_WarnNonCanonicalMonoidInstances :: WarningFlag

   ghc	GHC.Driver.DynFlags

   No documentation available.

6. Opt_WarnNonCanonicalMonoidInstances :: WarningFlag

   ghc	GHC.Driver.Flags

   No documentation available.

7. Opt_WarnNonCanonicalMonoidInstances :: WarningFlag

   ghc	GHC.Driver.Session

   No documentation available.

8. NonCanonicalMonoid :: NonCanonical_Monoid -> NonCanonicalDefinition

   ghc	GHC.Tc.Errors.Types

   Related to (<>) and mappend.

9. data NonCanonical_Monoid

   ghc	GHC.Tc.Errors.Types

   Possible cases for the -Wnoncanonical-monoid-instances.

10. commutativeMonoidLaws :: (Monoid a, Eq a, Arbitrary a, Show a) => Proxy a -> Laws

    quickcheck-classes	Test.QuickCheck.Classes

    Tests the following properties:

    • Commutative mappend a b ≡ mappend b a
    Note that this does not test associativity or identity. Make sure to use monoidLaws in addition to this set of laws.

Page 19 of many | Previous | Next