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.

  1. Some2IntMapWith :: forall s t a b (p :: Type -> Type -> Type) . !IntMap s a -> !IntMap t b -> !p s t -> Some2IntMapWith p a b

    refined-containers Data.IntMap.Strict.Refined

    No documentation available.

  2. data SomeIntMap a

    refined-containers Data.IntMap.Strict.Refined

    An existential wrapper for an IntMap with an as-yet-unknown set of keys. Pattern maching on it gives you a way to refer to the set (the parameter s), e.g. 

    case fromIntMap ... of
SomeIntMap @s m -> doSomethingWith @s

case fromIntMap ... of
SomeIntMap (m :: IntMap s a) -> doSomethingWith @s

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

    refined-containers Data.IntMap.Strict.Refined

    No documentation available.

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

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

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

    refined-containers Data.IntMap.Strict.Refined

    No documentation available.

  6. fromIntMap :: IntMap a -> SomeIntMap a

    refined-containers Data.IntMap.Strict.Refined

    Construct a map from a regular IntMap.

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

    refined-containers Data.IntMap.Strict.Refined

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

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

    refined-containers Data.IntMap.Strict.Refined

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

  9. 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.Strict.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).

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

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

Page 14 of many | Previous | Next