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. fromSet :: KnownHashSet s k => (Key s k -> a) -> HashMap s k a

    refined-containers Data.HashMap.Strict.Refined

    Create a map from a set of keys, and a function that for each key computes the corresponding value.

  2. keysSet :: HashMap s k a -> HashSet s k

    refined-containers Data.HashMap.Strict.Refined

    Return the set of keys in the map, with the contents of the set still tracked by the s parameter. See Data.HashSet.Refined.

  3. type HashSet s a = Dict KnownHashSet s a

    refined-containers Data.HashSet.Refined

    A HashSet 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 (HashSet) and the constraint (KnownHashSet). This library prefers to use the constraint.

  4. data InSet (f :: Flavor) s

    refined-containers Data.HashSet.Refined

    A predicate for use with Refined, verifying that a value is an element of the set s.

  5. InSet :: InSet (f :: Flavor) s

    refined-containers Data.HashSet.Refined

    No documentation available.

  6. type KnownHashSet s a = Reifies s HashSet a

    refined-containers Data.HashSet.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 HashSet a being passed around at runtime. Given this constraint, to obtain a regular HashSet a you can use reflect.

  7. data Some2HashSetWith (p :: Type -> Type -> Type) a

    refined-containers Data.HashSet.Refined

    An existential wrapper for an as-yet-unknown pair of sets, together with a proof of some fact p relating them.

  8. Some2HashSetWith :: forall s t a (p :: Type -> Type -> Type) . (KnownHashSet s a, KnownHashSet t a) => !p s t -> Some2HashSetWith p a

    refined-containers Data.HashSet.Refined

    No documentation available.

  9. data SomeHashSet a

    refined-containers Data.HashSet.Refined

    An existential wrapper for an as-yet-unknown set. Pattern maching on it gives you a way to refer to the set, e.g. 

    case fromHashSet ... of
SomeHashSet @s _ -> doSomethingWith @s

case fromHashSet ... of
SomeHashSet (_ :: Proxy# s) -> doSomethingWith @s

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

    refined-containers Data.HashSet.Refined

    No documentation available.

Page 254 of many | Previous | Next