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.
gTypeMediaTrackConstraintSet :: JSM GTypejsaddle-dom JSDOM.Types No documentation available.
noMediaTrackConstraintSet :: Maybe MediaTrackConstraintSetjsaddle-dom JSDOM.Types No documentation available.
toMediaTrackConstraintSet :: IsMediaTrackConstraintSet o => o -> MediaTrackConstraintSetjsaddle-dom JSDOM.Types No documentation available.
unMediaTrackConstraintSet :: MediaTrackConstraintSet -> JSValjsaddle-dom JSDOM.Types No documentation available.
asIntSet :: KnownHashSet s Int => IntSet srefined-containers Data.HashSet.Refined Convert an IntSet into a HashSet, retaining its set of elements, which can be converted with castFlavor.
type
KnownIntSet s = Reifies s IntSetrefined-containers Data.IntSet.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 IntSet being passed around at runtime. Given this constraint, to obtain a regular IntSet you can use reflect.
data
Some2IntSetWith (p :: Type -> Type -> Type)refined-containers Data.IntSet.Refined An existential wrapper for an as-yet-unknown pair of sets, together with a proof of some fact p relating them.
-
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.