Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

1. mdReproduction :: String

   nerd-font-icons	Graphics.Icons.NerdFont

   No documentation available.

2. pdcProductVersions :: String -> Query -> IO [Object]

   pdc	Fedora.PDC

   Product Version List https://pdc.fedoraproject.org/rest_api/v1/product-versions/

3. pdcProducts :: String -> Query -> IO [Object]

   pdc	Fedora.PDC

   Product List https://pdc.fedoraproject.org/rest_api/v1/products/

4. newtype CoproductProof (f :: Flavor) s t r

   refined-containers	Data.Set.Refined

   Proof that the tagged disjoint union of s and t is r.

5. CoproductProof :: (forall a b . () => Coercion (Either (Refined (InSet f s) a) (Refined (InSet f t) b)) (Refined (InSet f r) (Either a b))) -> CoproductProof (f :: Flavor) s t r

   refined-containers	Data.Set.Refined

   Coproduct of elements of s and t can be converted into an element of r and back. You can use coerceWith co and coerceWith (sym co).

6. cartesianProduct :: forall s t a b . (KnownSet s a, KnownSet t b) => SomeSetWith (ProductProof 'Regular s t) (a, b)

   refined-containers	Data.Set.Refined

   Cartesian product of two sets. The elements are all pairs (x, y) for each x from s and for each y from t.

Page 260 of many | Previous | Next