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. getMonoidalMap :: MonoidalMap k a -> Map k a

    monoidal-containers Data.Map.Monoidal

    No documentation available.

  2. getMonoidalMap :: MonoidalMap k a -> Map k a

    monoidal-containers Data.Map.Monoidal.Strict

    No documentation available.

  3. unMonoidalDMap :: MonoidalDMap (f :: k -> Type) (g :: k -> Type) -> DMap f g

    dependent-monoidal-map Data.Dependent.Map.Monoidal

    No documentation available.

  4. module Data.DoMonoid

    Construct monoids with do notation. For more information see https://github.com/tserduke/do-list#readme.

  5. type DoMonoid m = DoMonoidM m ()

    do-list Data.DoMonoid

    The type shortcut.

  6. newtype DoMonoidM m r

    do-list Data.DoMonoid

    DoMonoidM is not a real instance of Monad, Applicative or Functor. It pretends being them with a phantom result type.

  7. elimWrappedMonoid :: forall m (p :: WrappedMonoid m ~> Type) (s :: WrappedMonoid m) . Sing s -> (forall (f0 :: m) . () => Sing f0 -> Apply p ('WrapMonoid f0)) -> Apply p s

    eliminators Data.Eliminator

    No documentation available.

  8. elimWrappedMonoid :: forall m (p :: WrappedMonoid m ~> Type) (s :: WrappedMonoid m) . Sing s -> (forall (f0 :: m) . () => Sing f0 -> Apply p ('WrapMonoid f0)) -> Apply p s

    eliminators Data.Eliminator.Semigroup

    No documentation available.

  9. forMonoid :: Monoid i => Args i i

    fold-debounce-conduit Data.Conduit.FoldDebounce

    Args for monoids. Input events are appended to the tail.

  10. newtype GenericMonoid a

    generic-monoid Data.Monoid.Generic

    A newtype which allows you to using the DerivingVia extension to reduce boilerplate. 

    data X = X [Int] String
deriving (Generic, Show)
deriving Semigroup via GenericSemigroup X
deriving Monoid    via GenericMonoid X
    Note: Do NOT attempt to derive Semigroup via GenericMonoid. That will lead to infinite recursion.

Page 14 of many | Previous | Next