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.
SubsetProof :: (InSet f s :-> InSet f r) -> SubsetProof (f :: Flavor) s rrefined-containers Data.IntMap.Strict.Refined newtype
SupersetProof (f :: Flavor) s rrefined-containers Data.IntMap.Strict.Refined Proof that s is a superset of the set r.
SupersetProof :: (InSet f r :-> InSet f s) -> SupersetProof (f :: Flavor) s rrefined-containers Data.IntMap.Strict.Refined fromSet :: KnownIntSet s => (Key s -> a) -> IntMap s arefined-containers Data.IntMap.Strict.Refined Create a map from a set of keys, and a function that for each key computes the corresponding value.
keysSet :: IntMap s a -> IntSet srefined-containers Data.IntMap.Strict.Refined Return the set of keys in the map, with the contents of the set still tracked by the s parameter. See Data.IntSet.Refined.
-
refined-containers Data.IntSet.Refined A predicate for use with Refined, verifying that a value is an element of the set s.
InSet :: InSet (f :: Flavor) srefined-containers Data.IntSet.Refined No documentation available.
type
IntSet s = Dict KnownIntSet srefined-containers Data.IntSet.Refined A IntSet whose contents are tracked by the type parameter s. This is a "singleton": for a given s there's only one value of this type. Since this is just a Dict, you can freely convert between the value (IntSet) and the constraint (KnownIntSet). This library prefers to use the constraint.
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.