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

   refined-containers	Data.Map.Refined

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

2. keysSet :: Map s k a -> Set s k

   refined-containers	Data.Map.Refined

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

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

   refined-containers	Data.Map.Strict.Refined

   Proof that s is a subset of the set r.

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

   refined-containers	Data.Map.Strict.Refined

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

   refined-containers	Data.Map.Strict.Refined

   Proof that s is a superset of the set r.

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

   refined-containers	Data.Map.Strict.Refined

7. fromSet :: KnownSet s k => (Key s k -> a) -> Map s k a

   refined-containers	Data.Map.Strict.Refined

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

8. keysSet :: Map s k a -> Set s k

   refined-containers	Data.Map.Strict.Refined

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

9. data InSet (f :: Flavor) s

   refined-containers	Data.Set.Refined

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

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

    refined-containers	Data.Set.Refined

    No documentation available.

Page 260 of many | Previous | Next