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.
-
refined-containers Data.IntSet.Refined No documentation available.
-
refined-containers Data.IntSet.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 fromIntSet ... of SomeIntSet @s _ -> doSomethingWith @s case fromIntSet ... of SomeIntSet (_ :: Proxy# s) -> doSomethingWith @s
SomeIntSet :: forall s . KnownIntSet s => Proxy# s -> SomeIntSetrefined-containers Data.IntSet.Refined No documentation available.
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.
newtype
SubsetProof (f :: Flavor) s rrefined-containers Data.IntSet.Refined Proof that s is a subset of the set r.
SubsetProof :: (InSet f s :-> InSet f r) -> SubsetProof (f :: Flavor) s rrefined-containers Data.IntSet.Refined newtype
SupersetProof (f :: Flavor) s rrefined-containers Data.IntSet.Refined Proof that s is a superset of the set r.
SupersetProof :: (InSet f r :-> InSet f s) -> SupersetProof (f :: Flavor) s rrefined-containers Data.IntSet.Refined asHashSet :: KnownIntSet s => HashSet s Intrefined-containers Data.IntSet.Refined Convert an IntSet into a HashSet, retaining its set of elements, which can be converted with castFlavor.