Hoogle Search

Within LTS Haskell 24.5 (ghc-9.10.2)

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

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

    base Data.Semigroup

    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>

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

    base Data.Semigroup

    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.

  3. unwrapMonoid :: WrappedMonoid m -> m

    base Data.Semigroup

    No documentation available.

  4. class GSemigroup f => GMonoid (f :: Type -> Type)

    semigroups Data.Semigroup.Generic

    No documentation available.

  5. newtype GenericSemigroupMonoid a

    semigroups 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))

  6. GenericSemigroupMonoid :: a -> GenericSemigroupMonoid a

    semigroups Data.Semigroup.Generic

    No documentation available.

  7. getGenericSemigroupMonoid :: GenericSemigroupMonoid a -> a

    semigroups Data.Semigroup.Generic

    No documentation available.

  8. data ReifiedMonoid a

    lens Control.Lens.Internal.Fold

    No documentation available.

  9. ReifiedMonoid :: (a -> a -> a) -> a -> ReifiedMonoid a

    lens Control.Lens.Internal.Fold

    No documentation available.

  10. WrapMonoid :: m -> WrappedMonoid m

    base-compat Data.Semigroup.Compat

    No documentation available.

Page 18 of many | Previous | Next