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.

  1. runOutputMonoidTVar :: forall o m (r :: EffectRow) a . (Monoid m, Member (Embed IO) r) => TVar m -> (o -> m) -> Sem ((Output o :: (Type -> Type) -> Type -> Type) ': r) a -> Sem r a

    polysemy Polysemy.Output

    Run an Output effect by transforming it into atomic operations over a TVar.

  2. toMonoid :: (Monoid m, Monoid n) => (m :+. n) -> m :+: n

    monoid-extras Data.Semigroup.Coproduct

    Given monoids m and n, we can form their semigroup coproduct m :+. n. Every monoid homomorphism is a semigroup homomorphism. In particular the canonical inections of the monoid coproduct from m and n into m :+: n are semigroup homomorphisms. By pairing them using the universal property of the semigroup coproduct we obtain a canonical semigroup homomorphism toMonoid from m :+. n to m :+: n.

  3. class GMonoid (f :: Type -> Type)

    openapi3 Data.OpenApi.Internal.Utils

    No documentation available.

  4. class SwaggerMonoid m

    openapi3 Data.OpenApi.Internal.Utils

    No documentation available.

  5. data WrappedMonoid m

    protolude Protolude

    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.

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

    protolude Protolude

    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

    protolude Protolude

    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. stimesIdempotentMonoid :: (Integral b, Monoid a) => b -> a -> a

    ghc-internal GHC.Internal.Data.Semigroup.Internal

    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>

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

    ghc-internal GHC.Internal.Data.Semigroup.Internal

    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.

  10. WrapMonoid :: m -> WrappedMonoid m

    numhask NumHask.Prelude

    No documentation available.

Page 28 of many | Previous | Next