Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

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

Exact lookup

1. isProperSubsetOf :: Ord r => IntervalSet r -> IntervalSet r -> Bool

   data-interval	Data.IntervalSet

   Is this a proper subset? (i.e. a subset but not equal).

2. isSubsetOf :: Ord r => IntervalSet r -> IntervalSet r -> Bool

   data-interval	Data.IntervalSet

   Is this a subset? (is1 `isSubsetOf` is2) tells whether is1 is a subset of is2.

3. du_charset :: DataUrl -> !Maybe Text

   dataurl	Web.DataUrl

   No documentation available.

4. module Data.Type.Universe.Subset

   Represent a decidable subset of a type-level collection.

5. 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.

6. 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.

7. 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.

8. 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

9. 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.

10. 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

Page 184 of many | Previous | Next