Hoogle Search

Within LTS Haskell 24.62 (ghc-9.10.3)

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

Exact lookup

1. DivideByZero :: ArithException

   base	Control.Exception.Base

   No documentation available.

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

   base	Data.Functor

   void value discards or ignores the result of evaluation, such as the return value of an IO action.

   Examples

   Replace the contents of a Maybe Int with unit:

   >>> void Nothing
   Nothing
   

   >>> void (Just 3)
   Just ()
   

   Replace the contents of an Either Int Int with unit, resulting in an Either Int ():

   >>> void (Left 8675309)
   Left 8675309
   

   >>> void (Right 8675309)
   Right ()
   

   Replace every element of a list with unit:

   >>> void [1,2,3]
   [(),(),()]
   

   Replace the second element of a pair with unit:

   >>> void (1,2)
   (1,())
   

   Discard the result of an IO action:

   >>> mapM print [1,2]
   1
   2
   [(),()]
   

   >>> void $ mapM print [1,2]
   1
   2
   

3. runIdentity :: Identity a -> a

   base	Data.Functor.Identity

   No documentation available.

4. module Data.Monoid

   A type a is a Monoid if it provides an associative function (<>) that lets you combine any two values of type a into one, and a neutral element (mempty) such that

   a <> mempty == mempty <> a == a
   

   A Monoid is a Semigroup with the added requirement of a neutral element. Thus any Monoid is a Semigroup, but not the other way around.

   Examples

   The Sum monoid is defined by the numerical addition operator and `0` as neutral element:

   >>> mempty :: Sum Int
   Sum {getSum = 0}
   
   >>> Sum 1 <> Sum 2 <> Sum 3 <> Sum 4 :: Sum Int
   Sum {getSum = 10}
   

   We can combine multiple values in a list into a single value using the mconcat function. Note that we have to specify the type here since Int is a monoid under several different operations:

   >>> mconcat [1,2,3,4] :: Sum Int
   Sum {getSum = 10}
   
   >>> mconcat [] :: Sum Int
   Sum {getSum = 0}
   

   Another valid monoid instance of Int is Product It is defined by multiplication and `1` as neutral element:

   >>> Product 1 <> Product 2 <> Product 3 <> Product 4 :: Product Int
   Product {getProduct = 24}
   
   >>> mconcat [1,2,3,4] :: Product Int
   Product {getProduct = 24}
   
   >>> mconcat [] :: Product Int
   Product {getProduct = 1}
   

5. class Semigroup a => Monoid a

   base	Data.Monoid

   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.

6. WrapMonoid :: m -> WrappedMonoid m

   base	Data.Semigroup

   No documentation available.

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

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

   base	Data.Semigroup

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

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

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

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

Page 359 of many | Previous | Next