Hoogle Search
Within LTS Haskell 24.2 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
Eliminator functions for data types in Data.Monoid. All of these are re-exported from Data.Eliminator with the following exceptions:
- First and Last are not re-exported from Data.Eliminator, as they clash with eliminators of the same names in Data.Eliminator.Functor and Data.Eliminator.Semigroup.
- Sum and Product are not re-exported from Data.Eliminator, as they clash with eliminators of the same names in Data.Eliminator.Functor.
-
Bidirectional transforms for Data.Monoid.
module Parameterized.Data.
Monoid No documentation available.
class Monoid m =>
MonoidNull mmonoid-subclasses Data.Monoid.Null Extension of Monoid that allows testing a value for equality with mempty. The following law must hold:
null x == (x == mempty)
Furthermore, the performance of this method should be constant, i.e., independent of the length of its argument.-
monoid-extras Data.Monoid.WithSemigroup For base < 4.11, the Monoid' constraint is a synonym for things which are instances of both Semigroup and Monoid. For base version 4.11 and onwards, Monoid has Semigroup as a superclass already, so for backwards compatibility Monoid' is provided as a synonym for Monoid.
-
This module provides a HashMap variant which uses the value's Monoid instance to accumulate conflicting entries when merging Maps. While some functions mirroring those of HashMap are provided here for convenience, more specialized needs will likely want to use either the Newtype or Wrapped instances to manipulate the underlying Map.
-
monoidal-containers Data.HashMap.Monoidal A HashMap with monoidal accumulation
MonoidalHashMap :: HashMap k a -> MonoidalHashMap k amonoidal-containers Data.HashMap.Monoidal No documentation available.
-
This module provides a IntMap variant which uses the value's Monoid instance to accumulate conflicting entries when merging Maps. While some functions mirroring those of IntMap are provided here for convenience, more specialized needs will likely want to use either the Newtype or Wrapped instances to manipulate the underlying Map.
-
monoidal-containers Data.IntMap.Monoidal An IntMap with monoidal accumulation