Hoogle Search
Within LTS Haskell 24.3 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
class GSemigroup f =>
GMonoid (f :: Type -> Type)semigroups Data.Semigroup.Generic No documentation available.
newtype
GenericSemigroupMonoid asemigroups Data.Semigroup.Generic An adapter newtype, suitable for DerivingVia. Its Semigroup and Monoid instances leverage the Generic-based defaults defined by gmappend and gmempty. Here is an example of how to use it:
{-# LANGUAGE DerivingVia #-} import Data.Semigroup.Generic data Pair a = MkPair a a deriving (Semigroup, Monoid) via (GenericSemigroupMonoid (Pair a))
GenericSemigroupMonoid :: a -> GenericSemigroupMonoid asemigroups Data.Semigroup.Generic No documentation available.
getGenericSemigroupMonoid :: GenericSemigroupMonoid a -> asemigroups Data.Semigroup.Generic No documentation available.
WrapMonoid :: m -> WrappedMonoid mbase-compat Data.Semigroup.Compat No documentation available.
-
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.
stimesIdempotentMonoid :: (Integral b, Monoid a) => b -> a -> abase-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>
stimesMonoid :: (Integral b, Monoid a) => b -> a -> abase-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.
unwrapMonoid :: WrappedMonoid m -> mbase-compat Data.Semigroup.Compat No documentation available.
newtype
ReflectedMonoid a (s :: k)reflection Data.Reflection No documentation available.