Hoogle Search

Within LTS Haskell 24.42 (ghc-9.10.3)

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

Exact lookup

1. PostAligned :: a -> Filler -> PostAligned a

   flat	Flat.Filler

   No documentation available.

2. data PreAligned a

   flat	Flat.Filler

   A Pre aligned value, a value preceded by a filler Useful to prealign ByteArrays, Texts and any structure that can be encoded more efficiently when byte aligned.

3. PreAligned :: Filler -> a -> PreAligned a

   flat	Flat.Filler

   No documentation available.

4. PercentStyle :: FormatStyle

   formatn	Data.FormatN

   100,000% 100% 0.1%

5. module Control.Monad.Freer.Par

   No documentation available.

6. pattern Pure :: a -> Freer s sq f t a

   freer-par-monad	Control.Monad.Freer.Par

   No documentation available.

7. pattern ProdNonEmpty :: (f :*: ListF f) a -> NonEmptyF f a

   functor-combinators	Control.Applicative.ListF

   Treat a NonEmptyF f as a product between an f and a ListF f. nonEmptyProd is the record accessor.

8. pattern ProdNonEmpty :: (f :*: ListF f) a -> NonEmptyF f a

   functor-combinators	Data.Functor.Combinator

   Treat a NonEmptyF f as a product between an f and a ListF f. nonEmptyProd is the record accessor.

9. data ProxyF (f :: k) (a :: k1)

   functor-combinators	Data.Functor.Combinator

   The functor combinator that forgets all structure in the input. Ignores the input structure and stores no information. Acts like the "zero" with respect to functor combinator composition.

   ComposeT ProxyF f      ~ ProxyF
   ComposeT f      ProxyF ~ ProxyF
   

   It can be injected into (losing all information), but it is impossible to ever retract or interpret it. This is essentially ConstF ().

10. ProxyF :: ProxyF (f :: k) (a :: k1)

    functor-combinators	Data.Functor.Combinator

    No documentation available.

Page 837 of many | Previous | Next