Hoogle Search
Within LTS Haskell 24.40 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
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.
patchMapNewElements :: PatchMap k v -> [v]patch Data.Patch.Map Returns all the new elements that will be added to the Map
patchMapNewElementsMap :: PatchMap k v -> Map k vpatch Data.Patch.Map Returns all the new elements that will be added to the Map
unPatchMap :: PatchMap k v -> Map k (Maybe v)patch 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.
deleteMapKey :: k -> PatchMapWithMove k vpatch Data.Patch.MapWithMove Make a PatchMapWithMove k v which has the effect of deleting a key in the mapping, equivalent to delete.
insertMapKey :: k -> v -> PatchMapWithMove k vpatch Data.Patch.MapWithMove Make a PatchMapWithMove k v which has the effect of inserting or updating a value v to the given key k, like insert.