Hoogle Search

Within LTS Haskell 24.39 (ghc-9.10.3)

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

  1. newtype MediaTrackConstraintSet

    jsaddle-dom JSDOM.Types

    Functions for this inteface are in JSDOM.MediaTrackConstraintSet. Mozilla MediaTrackConstraintSet documentation

  2. MediaTrackConstraintSet :: JSVal -> MediaTrackConstraintSet

    jsaddle-dom JSDOM.Types

    No documentation available.

  3. gTypeMediaTrackConstraintSet :: JSM GType

    jsaddle-dom JSDOM.Types

    No documentation available.

  4. noMediaTrackConstraintSet :: Maybe MediaTrackConstraintSet

    jsaddle-dom JSDOM.Types

    No documentation available.

  5. toMediaTrackConstraintSet :: IsMediaTrackConstraintSet o => o -> MediaTrackConstraintSet

    jsaddle-dom JSDOM.Types

    No documentation available.

  6. unMediaTrackConstraintSet :: MediaTrackConstraintSet -> JSVal

    jsaddle-dom JSDOM.Types

    No documentation available.

  7. asIntSet :: KnownHashSet s Int => IntSet s

    refined-containers Data.HashSet.Refined

    Convert an IntSet into a HashSet, retaining its set of elements, which can be converted with castFlavor.

  8. type KnownIntSet s = Reifies s IntSet

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

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

  10. Some2IntSetWith :: forall s t (p :: Type -> Type -> Type) . (KnownIntSet s, KnownIntSet t) => !p s t -> Some2IntSetWith p

    refined-containers Data.IntSet.Refined

    No documentation available.

Page 73 of many | Previous | Next