Hoogle Search

Within LTS Haskell 24.41 (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.IntMap

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

   No documentation available.

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

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

   patch	Data.Patch.Map

   No documentation available.

5. newtype PatchMapWithMove k v

   patch	Data.Patch.MapWithMove

   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.

6. pattern PatchMapWithMove :: Map k (NodeInfo k v) -> PatchMapWithMove k v

   patch	Data.Patch.MapWithMove

   No documentation available.

7. PatchMapWithMove' :: PatchMapWithPatchingMove k (Proxy v) -> PatchMapWithMove k v

   patch	Data.Patch.MapWithMove

   No documentation available.

8. newtype PatchMapWithPatchingMove k p

   patch	Data.Patch.MapWithPatchingMove

   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.

9. PatchMapWithPatchingMove :: Map k (NodeInfo k p) -> PatchMapWithPatchingMove k p

   patch	Data.Patch.MapWithPatchingMove

   No documentation available.

10. module Data.Patch.PatchOrReplacement

    No documentation available.

Page 632 of many | Previous | Next