Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

Exact lookup

1. httpEquiv :: AttributeValue -> Attribute

   blaze-html	Text.Blaze.XHtml5.Attributes

   Combinator for the http-equiv attribute. Example:

   div ! httpEquiv "bar" $ "Hello."
   

   Result:

   <div http-equiv="bar">Hello.</div>
   

2. required :: AttributeValue -> Attribute

   blaze-html	Text.Blaze.XHtml5.Attributes

   Combinator for the required attribute. Example:

   div ! required "bar" $ "Hello."
   

   Result:

   <div required="bar">Hello.</div>
   

3. data ASeq (f :: Type -> Type) a

   free	Control.Applicative.Free.Fast

   The free applicative is composed of a sequence of effects, and a pure function to apply that sequence to. The fast free applicative separates these from each other, so that the sequence may be built up independently, and so that fmap can run in constant time by having immediate access to the pure function.

4. hoistASeq :: (forall x . () => f x -> g x) -> ASeq f a -> ASeq g a

   free	Control.Applicative.Free.Fast

   Given a natural transformation from f to g this gives a natural transformation from ASeq f to ASeq g.

5. rebaseASeq :: forall (f :: Type -> Type) u y z v . ASeq f u -> (forall x . () => (x -> y) -> ASeq f x -> z) -> (v -> u -> y) -> ASeq f v -> z

   free	Control.Applicative.Free.Fast

   It may not be obvious, but this essentially acts like ++, traversing the first sequence and creating a new one by appending the second sequence. The difference is that this also has to modify the return functions and that the return type depends on the input types. See the source of hoistAp as an example usage.

6. reduceASeq :: Applicative f => ASeq f u -> f u

   free	Control.Applicative.Free.Fast

   Interprets the sequence of effects using the semantics for pure and <*> given by the Applicative instance for f.

7. traverseASeq :: Applicative h => (forall x . () => f x -> h (g x)) -> ASeq f a -> h (ASeq g a)

   free	Control.Applicative.Free.Fast

   Traverse a sequence with resepect to its interpretation type f.

8. DictionaryRequired :: DecompressError

   zlib	Codec.Compression.GZip

   It is possible to do zlib compression with a custom dictionary. This allows slightly higher compression ratios for short files. However such compressed streams require the same dictionary when decompressing. This error is for when we encounter a compressed stream that needs a dictionary, and it's not provided.

9. DictionaryRequired :: DecompressError

   zlib	Codec.Compression.Zlib

   It is possible to do zlib compression with a custom dictionary. This allows slightly higher compression ratios for short files. However such compressed streams require the same dictionary when decompressing. This error is for when we encounter a compressed stream that needs a dictionary, and it's not provided.

10. CompressInputRequired :: (ByteString -> m (CompressStream m)) -> CompressStream (m :: Type -> Type)

    zlib	Codec.Compression.Zlib.Internal

    No documentation available.

Page 184 of many | Previous | Next