Hoogle Search

Within LTS Haskell 24.64 (ghc-9.10.3)

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

Exact lookup

1. varId :: KahnDouble -> Int

   ad	Numeric.AD.Internal.Kahn.Double

   No documentation available.

2. varId :: KahnFloat -> Int

   ad	Numeric.AD.Internal.Kahn.Float

   No documentation available.

3. varId :: Reverse s a -> Int

   ad	Numeric.AD.Internal.Reverse

   No documentation available.

4. varId :: ReverseDouble s -> Int

   ad	Numeric.AD.Internal.Reverse.Double

   No documentation available.

5. TypePrimitiveInvalid :: String -> ASN1Error

   asn1-encoding	Data.ASN1.Error

   Invalid primitive type

6. OID :: OID -> ASN1

   asn1-encoding	Data.ASN1.Prim

   No documentation available.

7. getOID :: ByteString -> Either ASN1Error ASN1

   asn1-encoding	Data.ASN1.Prim

   return an OID

8. putOID :: [Integer] -> ByteString

   asn1-encoding	Data.ASN1.Prim

   No documentation available.

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

   base-compat-batteries	Control.Monad.Compat

   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
   

10. class Semigroup a => Monoid a

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

Page 575 of many | Previous | Next