Hoogle Search

Within LTS Haskell 24.66 (ghc-9.10.3)

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

Exact lookup

1. DecidedLazy :: DecidedStrictness

   barbies	Barbies.Internal

   No documentation available.

2. DecidedStrict :: DecidedStrictness

   barbies	Barbies.Internal

   No documentation available.

3. data DecidedStrictness

   barbies	Barbies.Internal

   The strictness that GHC infers for a field during compilation. Whereas there are nine different combinations of SourceUnpackedness and SourceStrictness, the strictness that GHC decides will ultimately be one of lazy, strict, or unpacked. What GHC decides is affected both by what the user writes in the source code and by GHC flags. As an example, consider this data type:

   data E = ExampleConstructor {-# UNPACK #-} !Int !Int Int
   

   • If compiled without optimization or other language extensions, then the fields of ExampleConstructor will have DecidedStrict, DecidedStrict, and DecidedLazy, respectively.
   • If compiled with -XStrictData enabled, then the fields will have DecidedStrict, DecidedStrict, and DecidedStrict, respectively.
   • If compiled with -O2 enabled, then the fields will have DecidedUnpack, DecidedStrict, and DecidedLazy, respectively.

4. DecidedUnpack :: DecidedStrictness

   barbies	Barbies.Internal

   No documentation available.

5. selDecidedStrictness :: forall k1 t (f :: k1 -> Type) (a :: k1) . Selector s => t s f a -> DecidedStrictness

   barbies	Barbies.Internal

   The strictness that the compiler inferred for the selector

6. class Semigroup a => Monoid a

   base-prelude	BasePrelude

   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.

7. pattern ThreadId :: () => ThreadId# -> ThreadId

   base-prelude	BasePrelude

   No documentation available.

8. data BeamOpenURIInvalid

   beam-core	Database.Beam.Backend.URI

   No documentation available.

9. BeamOpenURIInvalid :: BeamOpenURIInvalid

   beam-core	Database.Beam.Backend.URI

   No documentation available.

10. SqlIdentityUpdate :: SqlUpdate be (table :: (Type -> Type) -> Type)

    beam-core	Database.Beam.Query

    No documentation available.

Page 1345 of many | Previous | Next