Hoogle Search

Within LTS Haskell 24.52 (ghc-9.10.3)

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

Exact lookup

1. testsRequested :: ComponentRequestedSpec -> Bool

   Cabal-syntax	Distribution.Types.ComponentRequestedSpec

   No documentation available.

2. includeRequiresRn :: IncludeRenaming -> ModuleRenaming

   Cabal-syntax	Distribution.Types.IncludeRenaming

   No documentation available.

3. RequiredTypeArguments :: KnownExtension

   Cabal-syntax	Language.Haskell.Extension

   Allow the use of visible forall in types of terms.

4. requireCheck :: CheckSingleton check -> Result check a -> Result check a

   comfort-array	Data.Array.Comfort.Shape

   No documentation available.

5. class C sh => ShapeSequence sh

   comfort-array	Data.Array.Comfort.Storable.Dim2

   No documentation available.

6. switchSequence :: ShapeSequence sh => f Zero -> (forall sh0 shs . (C sh0, Eq sh0, ShapeSequence shs) => f (sh0 ::+ shs)) -> f sh

   comfort-array	Data.Array.Comfort.Storable.Dim2

   No documentation available.

7. seqA :: ArrowList a => [a b b] -> a b b

   hxt	Control.Arrow.ArrowList

   generalization of arrow combinator >>> definition: seqA = foldl (>>>) this

8. module Control.FlatSeq

   Force evaluation like deepseq in Control.DeepSeq, but control the depth of evaluation. flatseq may evaluate more than seq but less than deepseq

9. flatseq :: WNFData a => a -> b -> b

   hxt	Control.FlatSeq

   No documentation available.

10. xpSeq :: (b -> a) -> PU a -> (a -> PU b) -> PU b

    hxt	Text.XML.HXT.Arrow.Pickle

    Combine two picklers sequentially. If the first fails during unpickling, the whole unpickler fails

Page 288 of many | Previous | Next