Hoogle Search

Within LTS Haskell 24.10 (ghc-9.10.2)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. SomeIntMap :: forall s a . !IntMap s a -> SomeIntMap a

   refined-containers	Data.IntMap.Refined

   No documentation available.

2. data SomeIntMapWith (p :: Type -> Type) a

   refined-containers	Data.IntMap.Refined

   An existential wrapper for an IntMap with an as-yet-unknown set of keys, together with a proof of some fact p about the set. Pattern matching on it gives you a way to refer to the set (the parameter s). Functions that change the set of keys in a map will return the map in this way, together with a proof that somehow relates the keys set to the function's inputs.

3. SomeIntMapWith :: forall s a (p :: Type -> Type) . !IntMap s a -> !p s -> SomeIntMapWith p a

   refined-containers	Data.IntMap.Refined

   No documentation available.

4. fromIntMap :: IntMap a -> SomeIntMap a

   refined-containers	Data.IntMap.Refined

   Construct a map from a regular IntMap.

5. toIntMap :: IntMap s a -> IntMap a

   refined-containers	Data.IntMap.Refined

   Convert to a regular IntMap, forgetting its set of keys.

6. verifyIntMap :: KnownIntSet s => IntMap a -> Maybe (IntMap s a)

   refined-containers	Data.IntMap.Refined

   Given a set of keys s known ahead of time, verify whether a regular IntMap has exactly that set of keys.

7. with2IntMapWith :: forall a b r p . Some2IntMapWith p a b -> (forall s t . () => IntMap s a -> IntMap t b -> p s t -> r) -> r

   refined-containers	Data.IntMap.Refined

   Apply a pair of maps with proof for unknown sets of keys to a continuation that can accept any pair of maps with any sets of keys satisfying the proof. This gives you a way to refer to the sets (the parameters s and t).

8. withIntMap :: SomeIntMap a -> (forall s . () => IntMap s a -> r) -> r

   refined-containers	Data.IntMap.Refined

   Apply a map with an unknown set of keys to a continuation that can accept a map with any set of keys. This gives you a way to refer to the set (the parameter s), e.g.:

   withIntMap (fromIntMap ...)
   $ \(m :: IntMap s a) -> doSomethingWith @s
   

9. withIntMapWith :: forall a r p . SomeIntMapWith p a -> (forall s . () => IntMap s a -> p s -> r) -> r

   refined-containers	Data.IntMap.Refined

   Apply a map with proof for an unknown set of keys to a continuation that can accept a map with any set of keys satisfying the proof. This gives you a way to refer to the set (the parameter s).

10. data Some2IntMapWith (p :: Type -> Type -> Type) a b

    refined-containers	Data.IntMap.Strict.Refined

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

Page 13 of many | Previous | Next