Hoogle Search
Within LTS Haskell 24.51 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
PatchIntMap :: IntMap (Maybe a) -> PatchIntMap apatch Data.Patch.IntMap No documentation available.
-
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
PatchMap :: Map k (Maybe v) -> PatchMap k vpatch Data.Patch.Map No documentation available.
-
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.
pattern
PatchMapWithMove :: Map k (NodeInfo k v) -> PatchMapWithMove k vpatch Data.Patch.MapWithMove No documentation available.
PatchMapWithMove' :: PatchMapWithPatchingMove k (Proxy v) -> PatchMapWithMove k vpatch Data.Patch.MapWithMove No documentation available.
newtype
PatchMapWithPatchingMove k ppatch 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.
PatchMapWithPatchingMove :: Map k (NodeInfo k p) -> PatchMapWithPatchingMove k ppatch Data.Patch.MapWithPatchingMove No documentation available.
module Data.Patch.
PatchOrReplacement No documentation available.
-
patch Data.Patch.PatchOrReplacement Either a patch or a replacement value. A good patch type will describe small changes very efficiently, but that often comes at the cost of describing large change rather inefficiently. PatchOrReplacement can be used as an escape hatch: when the change as a patch would be too big, just provide a new value to replace the old one with instead.