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.
-
A monoidal map with the right group instance Newtype wrapper around Data.Map.Monoidal.MonoidalMap that has a correct Group instance. The Group instance for Data.MonoidMap has a unique neutral element, as compared to Data.Map.Monoidal.MonoidalMap.
monoidMap :: (Ord k, DecidablyEmpty v) => MonoidalMap k v -> MonoidMap k vmonoid-map Data.MonoidMap Convert a MonoidalMap into a MonoidMap
-
QuickCheck support for monoidmap. QuickCheck support for the monoidmap package.
monoidSort :: (Monoid a, Ord a) => [a] -> [a]sort Data.Sort Sort the list, agregating duplicates with the monoid.
monoidSortAssocs :: (Monoid a, Ord k) => [(k, a)] -> [(k, a)]sort Data.Sort Sort the list of associations, aggregating duplicates with the monoid.
monoidSortAssocsBy :: Monoid a => (k -> k -> Ordering) -> [(k, a)] -> [(k, a)]sort Data.Sort Sort the list of associations, aggregating duplicates with the monoid and ordering the keys with the argument compare function.
monoidSortBy :: Monoid a => (a -> a -> Ordering) -> [a] -> [a]sort Data.Sort Sort the list, agregating duplicates with the monoid and ordering the keys with the argument compare function.
monoidSortOn :: (Monoid a, Ord k) => (a -> k) -> [a] -> [a]sort Data.Sort Sort the list, agregating duplicates with the monoid and ordering the elements by the items generated by the argument function.
WrapMonoid :: m -> WrappedMonoid mbase Data.Semigroup No documentation available.
-
base Data.Semigroup 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.