Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

  1. type KnownSet s a = Reifies s Set a

    refined-containers Data.Set.Refined

    A constraint evidencing that we know the contents of the set s at runtime. Whenever you see this constraint on a function, there is an actual Set a being passed around at runtime. Given this constraint, to obtain a regular Set a you can use reflect.

  2. data Some2SetWith (p :: Type -> Type -> Type) a

    refined-containers Data.Set.Refined

    An existential wrapper for an as-yet-unknown pair of sets, together with a proof of some fact p relating them.

  3. Some2SetWith :: forall s t a (p :: Type -> Type -> Type) . (KnownSet s a, KnownSet t a) => !p s t -> Some2SetWith p a

    refined-containers Data.Set.Refined

    No documentation available.

  4. data SomeSet a

    refined-containers Data.Set.Refined

    An existential wrapper for an as-yet-unknown set. Pattern maching on it gives you a way to refer to the set, e.g. 

    case fromSet ... of
SomeSet @s _ -> doSomethingWith @s

case fromSet ... of
SomeSet (_ :: Proxy# s) -> doSomethingWith @s

  5. SomeSet :: forall s a . KnownSet s a => Proxy# s -> SomeSet a

    refined-containers Data.Set.Refined

    No documentation available.

  6. data SomeSetWith (p :: Type -> Type) a

    refined-containers Data.Set.Refined

    An existential wrapper for an as-yet-unknown set, together with a proof of some fact p about the set. Pattern matching on it gives you a way to refer to the set (the parameter s). Most functions will return a set in this way, together with a proof that somehow relates the set to the function's inputs.

  7. SomeSetWith :: forall s a (p :: Type -> Type) . KnownSet s a => !p s -> SomeSetWith p a

    refined-containers Data.Set.Refined

    No documentation available.

  8. newtype SubsetProof (f :: Flavor) s r

    refined-containers Data.Set.Refined

    Proof that s is a subset of the set r.

  9. SubsetProof :: (InSet f s :-> InSet f r) -> SubsetProof (f :: Flavor) s r

    refined-containers Data.Set.Refined

  10. newtype SupersetProof (f :: Flavor) s r

    refined-containers Data.Set.Refined

    Proof that s is a superset of the set r.

Page 261 of many | Previous | Next