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.

Create a PatchMapWithPatchingMove, validating it

Create a PatchMapWithPatchingMove that inserts everything in the given Map

Make a PatchMapWithPatchingMove k p which has the effect of inserting or replacing a value v at the given key k, like insert.

Make a PatchMapWithPatchingMove k p which has the effect of moving the value from the first key k to the second key k, equivalent to:

    delete src (maybe map (insert dst) (Map.lookup src map))

Make a PatchMapWithPatchingMove k p which has the effect of swapping two keys in the mapping, equivalent to:

    let aMay = Map.lookup a map
        bMay = Map.lookup b map
    in maybe id (Map.insert a) (bMay <> aMay)
     . maybe id (Map.insert b) (aMay <> bMay)
     . Map.delete a . Map.delete b $ map

Make a PatchMapWithPatchingMove k v which has the effect of deleting a key in the mapping, equivalent to delete.

Wrap a Map k (NodeInfo k v) representing patch changes into a PatchMapWithPatchingMove k v, without checking any invariants.

Warning: when using this function, you must ensure that the invariants of PatchMapWithPatchingMove are preserved; they will not be checked.

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

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

Create a PatchMapWithPatchingMove that, if applied to the given Map, will sort its values using the given ordering function. The set keys of the Map is not changed.

Create a PatchMapWithPatchingMove that, if applied to the first Map provided, will produce a Map with the same values as the second Map but with the values sorted with the given ordering function.

Create a PatchMapWithPatchingMove that, if applied to the first Map provided, will produce the second Map. Note: this will never produce a patch on a value.

Holds the information about each key: where its new value should come from, and where its old value should go to

Traverse the NodeInfo over the key, patch, and patch target. Because of the type families here, this doesn't it any bi- or tri-traversal class.

Change the From value of a NodeInfo

Change the From value of a NodeInfo, using a Functor (or Applicative, Monad, etc.) action to get the new value

Set the To field of a NodeInfo

Describe how a key's new value should be produced

Traverse the From over the key, patch, and patch target. Because of the type families here, this doesn't it any bi- or tri-traversal class.

Describe where a key's old value will go. If this is Just, that means the key's old value will be moved to the given other key; if it is Nothing, that means it will be deleted.

Helper data structure used for composing patches using the monoid instance.