Hoogle Search

Within LTS Haskell 24.63 (ghc-9.10.3)

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

Exact lookup

1. class Semigroup a => Monoid a

   base-compat	Data.Monoid.Compat

   The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following:

   • Right identity x <> mempty = x
   • Left identity mempty <> x = x
   • Associativity x <> (y <> z) = (x <> y) <> z (Semigroup law)
   • Concatenation mconcat = foldr (<>) mempty
   You can alternatively define mconcat instead of mempty, in which case the laws are:
   • Unit mconcat (pure x) = x
   • Multiplication mconcat (join xss) = mconcat (fmap mconcat xss)
   • Subclass mconcat (toList xs) = sconcat xs
   The method names refer to the monoid of lists under concatenation, but there are many other instances. Some types can be viewed as a monoid in more than one way, e.g. both addition and multiplication on numbers. In such cases we often define newtypes and make those instances of Monoid, e.g. Sum and Product. NOTE: Semigroup is a superclass of Monoid since base-4.11.0.0.

2. WrapMonoid :: m -> WrappedMonoid m

   base-compat	Data.Semigroup.Compat

   No documentation available.

3. newtype WrappedMonoid m

   base-compat	Data.Semigroup.Compat

   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.

4. stimesIdempotent :: Integral b => b -> a -> a

   base-compat	Data.Semigroup.Compat

   This is a valid definition of stimes for an idempotent Semigroup. When x <> x = x, this definition should be preferred, because it works in <math> rather than <math>.

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

   base-compat	Data.Semigroup.Compat

   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>

6. stimesMonoid :: (Integral b, Monoid a) => b -> a -> a

   base-compat	Data.Semigroup.Compat

   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.

7. unwrapMonoid :: WrappedMonoid m -> m

   base-compat	Data.Semigroup.Compat

   No documentation available.

8. traceId :: String -> String

   base-compat	Debug.Trace.Compat

   Like trace but returns the message instead of a third value.

   >>> traceId "hello"
   hello
   "hello"
   

9. traceShowId :: Show a => a -> a

   base-compat	Debug.Trace.Compat

   Like traceShow but returns the shown value instead of a third value.

   >>> traceShowId (1+2+3, "hello" ++ "world")
   (6,"helloworld")
   (6,"helloworld")
   

10. void :: Functor f => f a -> f ()

    utility-ht	Control.Functor.HT

    No documentation available.

Page 413 of many | Previous | Next