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. asSet :: KnownIntSet s => Set s Int

    refined-containers Data.IntSet.Refined

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

  2. fromIntSet :: IntSet -> SomeIntSet

    refined-containers Data.IntSet.Refined

    Construct a set from a regular IntSet.

  3. isSubsetOf :: (KnownIntSet s, KnownIntSet t) => Maybe (SubsetProof 'Int s t)

    refined-containers Data.IntSet.Refined

    If s is a subset of t (or is equal to), return a proof of that.

  4. with2IntSetWith :: forall r p . Some2IntSetWith p -> (forall s t . (KnownIntSet s, KnownIntSet t) => p s t -> r) -> r

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

  5. withIntSet :: SomeIntSet -> (forall s . KnownIntSet s => Proxy s -> r) -> r

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

  6. withIntSetWith :: forall r p . SomeIntSetWith p -> (forall s . KnownIntSet s => p s -> r) -> r

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

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

    refined-containers Data.Map.Refined

    Proof that s is a subset of the set r.

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

    refined-containers Data.Map.Refined

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

    refined-containers Data.Map.Refined

    Proof that s is a superset of the set r.

  10. SupersetProof :: (InSet f r :-> InSet f s) -> SupersetProof (f :: Flavor) s r

    refined-containers Data.Map.Refined

Page 259 of many | Previous | Next