Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

Exact lookup

1. type AppendMap = MonoidalMap

   reflex	Data.AppendMap

   Deprecated: Use MonoidalMap instead

2. pattern AppendMap :: Map k v -> MonoidalMap k v

   reflex	Data.AppendMap

   Deprecated: Use MonoidalMap instead

3. _unAppendMap :: MonoidalMap k v -> Map k v

   reflex	Data.AppendMap

   Deprecated: Use getMonoidalMap instead

4. module Data.FastMutableIntMap

   No documentation available.

5. data FastMutableIntMap a

   reflex	Data.FastMutableIntMap

   A FastMutableIntMap holds a map of values of type a and allows low-overhead modifications via IO. Operations on FastMutableIntMap run in IO.

6. newtype PatchIntMap a

   reflex	Data.FastMutableIntMap

   Patch for IntMap which represents insertion or deletion of keys in the mapping. Internally represented by 'IntMap (Maybe a)', where Just means insert/update and Nothing means delete.

7. PatchIntMap :: IntMap (Maybe a) -> PatchIntMap a

   reflex	Data.FastMutableIntMap

   No documentation available.

8. patchIntMapNewElements :: PatchIntMap a -> [a]

   reflex	Data.FastMutableIntMap

   Extract all as inserted/updated by the given PatchIntMap a.

9. patchIntMapNewElementsMap :: PatchIntMap a -> IntMap a

   reflex	Data.FastMutableIntMap

   Convert the given PatchIntMap a into an IntMap a with all the inserts/updates in the given patch.

10. traverseIntMapPatchWithKey :: Applicative f => (Int -> a -> f b) -> PatchIntMap a -> f (PatchIntMap b)

    reflex	Data.FastMutableIntMap

    Map an effectful function Int -> a -> f b over all as in the given PatchIntMap a (that is, all inserts/updates), producing a f (PatchIntMap b).

Page 583 of many | Previous | Next