Hoogle Search
Within LTS Haskell 24.50 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
JpgExtendedSequentialArithmetic :: JpgFrameKindJuicyPixels Codec.Picture.Jpg.Internal.Types No documentation available.
JpgExtendedSequentialDCTHuffman :: JpgFrameKindJuicyPixels Codec.Picture.Jpg.Internal.Types No documentation available.
frameSequenceNum :: APngFrameControl -> !Word32JuicyPixels Codec.Picture.Png.Internal.Type Starting from 0
generateQ :: Curve -> Integer -> Pointcryptonite Crypto.PubKey.ECC.Generate Generate Q given d. WARNING: Vulnerable to timing attacks.
mkClauseQ :: [PatQ] -> ExpQ -> ClauseQhaskell-src-meta Language.Haskell.Meta.Utils No documentation available.
IgnoreTypesAndTicksEquiv :: Equivalenceinspection-testing Test.Inspection ignore types and hpc ticks during the comparison
-
inspection-testing Test.Inspection strict term equality
UnorderedLetsEquiv :: Equivalenceinspection-testing Test.Inspection allow permuted let bindings, ignore types and hpc tick during comparison
-
parallel Control.Parallel Semantically identical to seq, but with a subtle operational difference: seq is strict in both its arguments, so the compiler may, for example, rearrange a `seq` b into b `seq` a `seq` b. This is normally no problem when using seq to express strictness, but it can be a problem when annotating code for parallelism, because we need more control over the order of evaluation; we may want to evaluate a before b, because we know that b has already been sparked in parallel with par. This is why we have pseq. In contrast to seq, pseq is only strict in its first argument (as far as the compiler is concerned), which restricts the transformations that the compiler can do, and ensures that the user can retain control of the evaluation order.
type
SeqStrategy a = Strategy aparallel Control.Parallel.Strategies A name for Control.Seq.Strategy, for documentation only.