Hoogle Search

Within Stackage Nightly 2025-10-12 (ghc-9.12.2)

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

  1. module DataFrame.Operations.Subset

    No documentation available.

  2. du_charset :: DataUrl -> !Maybe Text

    dataurl Web.DataUrl

    No documentation available.

  3. module Data.Type.Universe.Subset

    Represent a decidable subset of a type-level collection.

  4. data Subset (f :: Type -> Type) (a :: k ~> Type) (b :: TyFun f k Type)

    decidable Data.Type.Universe.Subset

    A Subset f p is a predicate that some decidable subset of an input as is true.

  5. newtype WitSubset (f :: Type -> Type) (p :: k ~> Type) (as :: f k)

    decidable Data.Type.Universe.Subset

    A WitSubset f p as describes a decidable subset of type-level collection as.

  6. WitSubset :: (forall (a :: k) . () => Elem f as a -> Decision (p @@ a)) -> WitSubset (f :: Type -> Type) (p :: k ~> Type) (as :: f k)

    decidable Data.Type.Universe.Subset

    No documentation available.

  7. imergeSubset :: forall (f :: Type -> Type) k (p :: k ~> Type) (q :: k ~> Type) (r :: k ~> Type) (as :: f k) . (forall (a :: k) . () => Elem f as a -> Decision (p @@ a) -> Decision (q @@ a) -> Decision (r @@ a)) -> (Subset f p @@ as) -> (Subset f q @@ as) -> Subset f r @@ as

    decidable Data.Type.Universe.Subset

    Combine two subsets based on a decision function

  8. makeSubset :: forall (f :: Type -> Type) k (p :: k ~> Type) (as :: f k) . Universe f => (forall (a :: k) . () => Elem f as a -> Sing a -> Decision (p @@ a)) -> Sing as -> Subset f p @@ as

    decidable Data.Type.Universe.Subset

    Create a Subset from a predicate.

  9. mergeSubset :: forall (f :: Type -> Type) k (p :: k ~> Type) (q :: k ~> Type) (r :: k ~> Type) (as :: f k) . (forall (a :: k) . () => Decision (p @@ a) -> Decision (q @@ a) -> Decision (r @@ a)) -> (Subset f p @@ as) -> (Subset f q @@ as) -> Subset f r @@ as

    decidable Data.Type.Universe.Subset

    Combine two subsets based on a decision function

  10. runWitSubset :: WitSubset (f :: Type -> Type) (p :: k ~> Type) (as :: f k) -> forall (a :: k) . () => Elem f as a -> Decision (p @@ a)

    decidable Data.Type.Universe.Subset

    No documentation available.

Page 183 of many | Previous | Next