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.

Exact lookup

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

   refined-containers	Data.HashMap.Refined

   Proof that s is a subset of the set r.

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

   refined-containers	Data.HashMap.Refined

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

   refined-containers	Data.HashMap.Refined

   Proof that s is a superset of the set r.

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

   refined-containers	Data.HashMap.Refined

5. fromSet :: KnownHashSet s k => (Key s k -> a) -> HashMap s k a

   refined-containers	Data.HashMap.Refined

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

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

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

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

   refined-containers	Data.HashMap.Strict.Refined

   Proof that s is a subset of the set r.

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

   refined-containers	Data.HashMap.Strict.Refined

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

   refined-containers	Data.HashMap.Strict.Refined

   Proof that s is a superset of the set r.

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

    refined-containers	Data.HashMap.Strict.Refined

Page 253 of many | Previous | Next