Hoogle Search
Within LTS Haskell 24.3 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
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.
stimesIdempotentMonoid :: (Integral b, Monoid a) => b -> a -> abase Data.Semigroup 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>
stimesMonoid :: (Integral b, Monoid a) => b -> a -> abase Data.Semigroup 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.
unwrapMonoid :: WrappedMonoid m -> mbase Data.Semigroup No documentation available.