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. PatchIntMap :: IntMap (Maybe a) -> PatchIntMap a

   patch	Data.Patch.IntMap

   No documentation available.

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

   patch	Data.Patch.IntMap

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

3. patchIntMapNewElementsMap :: PatchIntMap a -> IntMap a

   patch	Data.Patch.IntMap

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

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

   patch	Data.Patch.IntMap

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

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

   patch	Data.Patch.IntMap

   No documentation available.

6. newtype PatchMap k v

   patch	Data.Patch.Map

   A set of changes to a Map. Any element may be inserted/updated or deleted. Insertions are represented as values wrapped in Just, while deletions are represented as Nothings

7. PatchMap :: Map k (Maybe v) -> PatchMap k v

   patch	Data.Patch.Map

   No documentation available.

8. patchMapNewElements :: PatchMap k v -> [v]

   patch	Data.Patch.Map

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

9. patchMapNewElementsMap :: PatchMap k v -> Map k v

   patch	Data.Patch.Map

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

10. unPatchMap :: PatchMap k v -> Map k (Maybe v)

    patch	Data.Patch.Map

    No documentation available.

Page 963 of many | Previous | Next