Hoogle Search

Within LTS Haskell 24.61 (ghc-9.10.3)

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

Exact lookup

1. SomeHashSet :: forall s a . KnownHashSet s a => Proxy# s -> SomeHashSet a

   refined-containers	Data.HashSet.Refined

   No documentation available.

2. data SomeHashSetWith (p :: Type -> Type) a

   refined-containers	Data.HashSet.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.

3. SomeHashSetWith :: forall s a (p :: Type -> Type) . KnownHashSet s a => !p s -> SomeHashSetWith p a

   refined-containers	Data.HashSet.Refined

   No documentation available.

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

   refined-containers	Data.HashSet.Refined

   Proof that s is a subset of the set r.

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

   refined-containers	Data.HashSet.Refined

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

   refined-containers	Data.HashSet.Refined

   Proof that s is a superset of the set r.

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

   refined-containers	Data.HashSet.Refined

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

9. asSet :: forall s a . (Ord a, KnownHashSet s a) => Set s a

   refined-containers	Data.HashSet.Refined

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

10. fromHashSet :: HashSet a -> SomeHashSet a

    refined-containers	Data.HashSet.Refined

    Construct a set from a regular HashSet.

Page 256 of many | Previous | Next