Hoogle Search
Within LTS Haskell 24.9 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
data
SomeIntSetWith (p :: Type -> Type)refined-containers Data.IntSet.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.
SomeIntSetWith :: forall s (p :: Type -> Type) . KnownIntSet s => !p s -> SomeIntSetWith prefined-containers Data.IntSet.Refined No documentation available.
fromIntSet :: IntSet -> SomeIntSetrefined-containers Data.IntSet.Refined Construct a set from a regular IntSet.
-
refined-containers Data.IntSet.Refined Apply a pair of unknown sets with proof to a continuation that can accept any pair of sets satisfying the proof. This gives you a way to refer to the sets (the parameters s and t).
withIntSet :: SomeIntSet -> (forall s . KnownIntSet s => Proxy s -> r) -> rrefined-containers Data.IntSet.Refined Apply an unknown set to a continuation that can accept any set. This gives you a way to refer to the set (the parameter s), e.g.:
withIntSet (fromIntSet ...) $ \(_ :: Proxy s) -> doSomethingWith @s
withIntSetWith :: forall r p . SomeIntSetWith p -> (forall s . KnownIntSet s => p s -> r) -> rrefined-containers Data.IntSet.Refined Apply an unknown set with proof to a continuation that can accept any set satisfying the proof. This gives you a way to refer to the set (the parameter s).
asIntSet :: KnownSet s Int => IntSet srefined-containers Data.Set.Refined Convert a Set into an IntSet, retaining its set of elements, which can be converted with castFlavor.