Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. monoidMap :: (Ord k, DecidablyEmpty v) => MonoidalMap k v -> MonoidMap k v

   monoid-map	Data.MonoidMap

   Convert a MonoidalMap into a MonoidMap

2. package monoidmap-quickcheck

   QuickCheck support for monoidmap. QuickCheck support for the monoidmap package.

3. monoidSort :: (Monoid a, Ord a) => [a] -> [a]

   sort	Data.Sort

   Sort the list, agregating duplicates with the monoid.

4. monoidSortAssocs :: (Monoid a, Ord k) => [(k, a)] -> [(k, a)]

   sort	Data.Sort

   Sort the list of associations, aggregating duplicates with the monoid.

5. 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.

6. 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.

7. 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.

8. WrapMonoid :: m -> WrappedMonoid m

   base	Data.Semigroup

   No documentation available.

9. newtype WrappedMonoid m

   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.

10. stimesIdempotentMonoid :: (Integral b, Monoid a) => b -> a -> a

    base	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>

Page 17 of many | Previous | Next