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.
-
Cabal-syntax Distribution.FieldGrammar.Class Monoidal field. Values are combined with mappend. Note: optionalFieldAla is a monoidalField with Last monoid.
monoidLaws :: (Monoid a, Eq a, Arbitrary a, Show a) => Proxy a -> Lawsquickcheck-classes-base Test.QuickCheck.Classes.Base Tests the following properties:
- Associative mappend a (mappend b c) ≡ mappend (mappend a b) c
- Left Identity mappend mempty a ≡ a
- Right Identity mappend a mempty ≡ a
- Concatenation mconcat as ≡ foldr mappend mempty as
-
Various extra monoid-related definitions and utilities Various extra monoid-related definitions and utilities, such as monoid actions, monoid coproducts, semi-direct products, "deletable" monoids, "split" monoids, and "cut" monoids.
-
ghc-lib-parser GHC.Builtin.Names No documentation available.
-
ghc-lib-parser GHC.Builtin.Names No documentation available.
monoidD :: Monoid a => MonoidD acheckers Test.QuickCheck.Checkers monoidMorphism :: (Monoid a, Monoid b, EqProp b, Show a, Arbitrary a) => (a -> b) -> TestBatchcheckers Test.QuickCheck.Classes Monoid homomorphism properties. See also homomorphism.
-
Containers with monoidal accumulation Containers with merging via monoidal accumulation. The Monoid instances provided by the containers and unordered-containers packages merge structures in a left-biased manner instead of using the underlying monoidal structure of the value. This package wraps the types provided by these packages, but provides Monoid instances implemented in terms of the value type's mappend. For instance, the Monoid Map instance looks like,
instance (Ord k, Semigroup a) => Monoid (MonoidalMap k a)
monoidConcatMap :: (Read sig a, Monoid m) => (a -> m) -> sig a -> msynthesizer-core Synthesizer.Generic.Signal Deprecated: Use foldMap instead.
monoidConcat :: Monoid m => T m -> msynthesizer-core Synthesizer.State.Signal Deprecated: Use foldMap instead.