Hoogle Search

Within LTS Haskell 24.45 (ghc-9.10.3)

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

Exact lookup

1. newtype PatchIntMap a

   patch	Data.Patch

   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.

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

   patch	Data.Patch

   No documentation available.

3. data PatchMapWithMove k v

   patch	Data.Patch

   Patch a Map with additions, deletions, and moves. Invariant: If key k1 is coming from From_Move k2, then key k2 should be going to Just k1, and vice versa. There should never be any unpaired From/To keys.

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

   patch	Data.Patch

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

5. patchIntMapNewElementsMap :: PatchIntMap a -> IntMap a

   patch	Data.Patch

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

6. patchMapWithMoveNewElements :: PatchMapWithMove k v -> [v]

   patch	Data.Patch

   Returns all the new elements that will be added to the Map.

7. patchMapWithMoveNewElementsMap :: PatchMapWithMove k v -> Map k v

   patch	Data.Patch

   Return a Map k v with all the inserts/updates from the given PatchMapWithMove k v.

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

   patch	Data.Patch

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

9. unPatchDMap :: PatchDMap (k1 :: k -> Type) (v :: k -> Type) -> DMap k1 (ComposeMaybe v)

   patch	Data.Patch

   No documentation available.

10. unPatchIntMap :: PatchIntMap a -> IntMap (Maybe a)

    patch	Data.Patch

    No documentation available.

Page 961 of many | Previous | Next