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. runIdentity :: Identity a -> a

   basement	Basement.Compat.Identity

   No documentation available.

2. data InvalidRecast

   basement	Basement.Exception

   No documentation available.

3. InvalidRecast :: RecastSourceSize -> RecastDestinationSize -> InvalidRecast

   basement	Basement.Exception

   No documentation available.

4. class Semigroup a => Monoid a

   basement	Basement.Imports

   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.

5. midentity :: Multiplicative a => a

   basement	Basement.Numerical.Multiplicative

   Identity element over multiplication

6. InvalidContinuation :: ValidationFailure

   basement	Basement.String

   No documentation available.

7. InvalidHeader :: ValidationFailure

   basement	Basement.String

   No documentation available.

8. data ValidationFailure

   basement	Basement.String

   Possible failure related to validating bytes of UTF8 sequences.

9. mutableValidate :: PrimMonad prim => MUArray Word8 (PrimState prim) -> Offset Word8 -> CountOf Word8 -> prim (Offset Word8, Maybe ValidationFailure)

   basement	Basement.String

   Similar to validate but works on a MutableByteArray

10. divide :: forall (m :: Type -> Type) a b c . Applicative m => (a -> (b, c)) -> LogAction m b -> LogAction m c -> LogAction m a

    co-log-core	Colog.Core.Action

    divide combinator from Divisible type class.

    >>> logInt = LogAction print
    
    >>> "ABC" &> divide (\s -> (s, length s)) logStringStdout logInt
    ABC
    3
    

Page 544 of many | Previous | Next