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.
SupersetProof :: (InSet f r :-> InSet f s) -> SupersetProof (f :: Flavor) s rrefined-containers Data.Set.Refined asHashSet :: forall s a . (Hashable a, KnownSet s a) => HashSet s arefined-containers Data.Set.Refined Convert a Set into a HashSet, retaining its set of elements, which can be converted with castFlavor.
asIntSet :: KnownSet s Int => IntSet srefined-containers Data.Set.Refined Convert a Set into an IntSet, retaining its set of elements, which can be converted with castFlavor.
-
refined-containers Data.Set.Refined Construct a set from a regular Set.
isSubsetOf :: forall s t a . (Ord a, KnownSet s a, KnownSet t a) => Maybe (SubsetProof 'Regular s t)refined-containers Data.Set.Refined If s is a subset of t (or is equal to), return a proof of that.
-
refined-containers Data.Set.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).
withSet :: SomeSet a -> (forall s . KnownSet s a => Proxy s -> r) -> rrefined-containers Data.Set.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.:
withSet (fromSet ...) $ \(_ :: Proxy s) -> doSomethingWith @s
withSetWith :: forall a r p . SomeSetWith p a -> (forall s . KnownSet s a => p s -> r) -> rrefined-containers Data.Set.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).
groupingSets :: AggregatingSetList a -> AggregateKey arelational-schemas Database.Custom.IBMDB2 Finalize grouping set list.
groupingSets :: AggregatingSetList a -> AggregateKey arelational-schemas Database.Custom.MySQL Finalize grouping set list.