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. class AppendSemigroup sh => AppendMonoid sh

   comfort-array	Data.Array.Comfort.Shape

   No documentation available.

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

   quickcheck-classes-base	Test.QuickCheck.Classes.Base

   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.

3. semigroupMonoidLaws :: (Semigroup a, Monoid a, Eq a, Arbitrary a, Show a) => Proxy a -> Laws

   quickcheck-classes-base	Test.QuickCheck.Classes.Base

   No documentation available.

4. data WrappedMonoid m

   relude	Relude.Monoid

   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.

5. maybeToMonoid :: Monoid m => Maybe m -> m

   relude	Relude.Monoid

   Extracts Monoid value from Maybe returning mempty if Nothing.

   >>> maybeToMonoid (Just [1,2,3] :: Maybe [Int])
   [1,2,3]
   
   >>> maybeToMonoid (Nothing :: Maybe [Int])
   []
   

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

   relude	Relude.Monoid

   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>

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

   relude	Relude.Monoid

   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.

8. WrapMonoid :: m -> WrappedMonoid m

   base-compat-batteries	Data.Semigroup.Compat

   No documentation available.

9. newtype WrappedMonoid m

   base-compat-batteries	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.

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

    base-compat-batteries	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>

Page 24 of many | Previous | Next