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. with2HashSetWith :: forall a r p . Some2HashSetWith p a -> (forall s t . (KnownHashSet s a, KnownHashSet t a) => p s t -> r) -> r

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

  2. withHashSet :: SomeHashSet a -> (forall s . KnownHashSet s a => Proxy s -> r) -> r

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

    withHashSet (fromHashSet ...) $ \(_ :: Proxy s) -> doSomethingWith @s

  3. withHashSetWith :: forall a r p . SomeHashSetWith p a -> (forall s . KnownHashSet s a => p s -> r) -> r

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

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

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

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

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

  8. fromSet :: KnownIntSet s => (Key s -> a) -> IntMap s a

    refined-containers Data.IntMap.Refined

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

  9. keysSet :: IntMap s a -> IntSet s

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

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

    refined-containers Data.IntMap.Strict.Refined

    Proof that s is a subset of the set r.

Page 256 of many | Previous | Next